2 * Copyright 2005-2007 Adrian Thurston <thurston@complang.org>
5 /* This file is part of Ragel.
7 * Ragel is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * Ragel is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Ragel; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24 #include "xmlcodegen.h"
26 #include "parsedata.h"
33 XMLCodeGen::XMLCodeGen( char *fsmName, ParseData *pd, FsmAp *fsm,
34 std::ostream &out, XmlParser &xmlParser )
46 void XMLCodeGen::writeActionList()
48 /* Determine which actions to write. */
50 for ( ActionList::Iter act = pd->actionList; act.lte(); act++ ) {
51 if ( act->numRefs() > 0 || act->numCondRefs > 0 )
52 act->actionId = nextActionId++;
56 out << " <action_list length=\"" << nextActionId << "\">\n";
57 for ( ActionList::Iter act = pd->actionList; act.lte(); act++ ) {
58 if ( act->actionId >= 0 )
61 out << " </action_list>\n";
64 void XMLCodeGen::writeActionTableList()
66 /* Must first order the action tables based on their id. */
67 int numTables = nextActionTableId;
68 RedActionTable **tables = new RedActionTable*[numTables];
69 for ( ActionTableMap::Iter at = actionTableMap; at.lte(); at++ )
72 out << " <action_table_list length=\"" << numTables << "\">\n";
73 for ( int t = 0; t < numTables; t++ ) {
74 out << " <action_table id=\"" << t << "\" length=\"" <<
75 tables[t]->key.length() << "\">";
76 for ( ActionTable::Iter atel = tables[t]->key; atel.lte(); atel++ ) {
77 out << atel->value->actionId;
81 out << "</action_table>\n";
83 out << " </action_table_list>\n";
88 void XMLCodeGen::reduceActionTables()
90 /* Reduce the actions tables to a set. */
91 for ( StateList::Iter st = fsm->stateList; st.lte(); st++ ) {
92 RedActionTable *actionTable = 0;
94 /* Reduce To State Actions. */
95 if ( st->toStateActionTable.length() > 0 ) {
96 if ( actionTableMap.insert( st->toStateActionTable, &actionTable ) )
97 actionTable->id = nextActionTableId++;
100 /* Reduce From State Actions. */
101 if ( st->fromStateActionTable.length() > 0 ) {
102 if ( actionTableMap.insert( st->fromStateActionTable, &actionTable ) )
103 actionTable->id = nextActionTableId++;
106 /* Reduce EOF actions. */
107 if ( st->eofActionTable.length() > 0 ) {
108 if ( actionTableMap.insert( st->eofActionTable, &actionTable ) )
109 actionTable->id = nextActionTableId++;
112 /* Loop the transitions and reduce their actions. */
113 for ( TransList::Iter trans = st->outList; trans.lte(); trans++ ) {
114 if ( trans->actionTable.length() > 0 ) {
115 if ( actionTableMap.insert( trans->actionTable, &actionTable ) )
116 actionTable->id = nextActionTableId++;
122 void XMLCodeGen::appendTrans( TransListVect &outList, Key lowKey,
123 Key highKey, TransAp *trans )
125 if ( trans->toState != 0 || trans->actionTable.length() > 0 )
126 outList.append( TransEl( lowKey, highKey, trans ) );
129 void XMLCodeGen::writeKey( Key key )
131 if ( keyOps->isSigned )
134 out << (unsigned long) key.getVal();
137 void XMLCodeGen::writeTrans( Key lowKey, Key highKey, TransAp *trans )
139 /* First reduce the action. */
140 RedActionTable *actionTable = 0;
141 if ( trans->actionTable.length() > 0 )
142 actionTable = actionTableMap.find( trans->actionTable );
144 /* Write the transition. */
150 if ( trans->toState != 0 )
151 out << " " << trans->toState->alg.stateNum;
155 if ( actionTable != 0 )
156 out << " " << actionTable->id;
162 void XMLCodeGen::writeTransList( StateAp *state )
164 TransListVect outList;
166 /* If there is only are no ranges the task is simple. */
167 if ( state->outList.length() > 0 ) {
168 /* Loop each source range. */
169 for ( TransList::Iter trans = state->outList; trans.lte(); trans++ ) {
170 /* Reduce the transition. If it reduced to anything then add it. */
171 appendTrans( outList, trans->lowKey, trans->highKey, trans );
175 out << " <trans_list length=\"" << outList.length() << "\">\n";
176 for ( TransListVect::Iter tvi = outList; tvi.lte(); tvi++ )
177 writeTrans( tvi->lowKey, tvi->highKey, tvi->value );
178 out << " </trans_list>\n";
181 void XMLCodeGen::writeEofTrans( StateAp *state )
183 RedActionTable *eofActions = 0;
184 if ( state->eofActionTable.length() > 0 )
185 eofActions = actionTableMap.find( state->eofActionTable );
187 /* The <eof_t> is used when there is an eof target, otherwise the eof
188 * action goes into state actions. */
189 if ( state->eofTarget != 0 ) {
190 out << " <eof_t>" << state->eofTarget->alg.stateNum;
192 if ( eofActions != 0 )
193 out << " " << eofActions->id;
197 out << "</eof_t>" << endl;
201 void XMLCodeGen::writeText( InlineItem *item )
203 if ( item->prev == 0 || item->prev->type != InlineItem::Text )
205 xmlEscapeHost( out, item->data, strlen(item->data) );
206 if ( item->next == 0 || item->next->type != InlineItem::Text )
210 void XMLCodeGen::writeGoto( InlineItem *item )
212 if ( pd->generatingSectionSubset )
213 out << "<goto>-1</goto>";
215 EntryMapEl *targ = fsm->entryPoints.find( item->nameTarg->id );
216 out << "<goto>" << targ->value->alg.stateNum << "</goto>";
220 void XMLCodeGen::writeCall( InlineItem *item )
222 if ( pd->generatingSectionSubset )
223 out << "<call>-1</call>";
225 EntryMapEl *targ = fsm->entryPoints.find( item->nameTarg->id );
226 out << "<call>" << targ->value->alg.stateNum << "</call>";
230 void XMLCodeGen::writeNext( InlineItem *item )
232 if ( pd->generatingSectionSubset )
233 out << "<next>-1</next>";
235 EntryMapEl *targ = fsm->entryPoints.find( item->nameTarg->id );
236 out << "<next>" << targ->value->alg.stateNum << "</next>";
240 void XMLCodeGen::writeGotoExpr( InlineItem *item )
242 out << "<goto_expr>";
243 writeInlineList( item->children );
244 out << "</goto_expr>";
247 void XMLCodeGen::writeCallExpr( InlineItem *item )
249 out << "<call_expr>";
250 writeInlineList( item->children );
251 out << "</call_expr>";
254 void XMLCodeGen::writeNextExpr( InlineItem *item )
256 out << "<next_expr>";
257 writeInlineList( item->children );
258 out << "</next_expr>";
261 void XMLCodeGen::writeEntry( InlineItem *item )
263 if ( pd->generatingSectionSubset )
264 out << "<entry>-1</entry>";
266 EntryMapEl *targ = fsm->entryPoints.find( item->nameTarg->id );
267 out << "<entry>" << targ->value->alg.stateNum << "</entry>";
271 void XMLCodeGen::writeActionExec( InlineItem *item )
274 writeInlineList( item->children );
278 void XMLCodeGen::writeLmOnLast( InlineItem *item )
280 out << "<set_tokend>1</set_tokend>";
282 if ( item->longestMatchPart->action != 0 ) {
283 out << "<sub_action>";
284 writeInlineList( item->longestMatchPart->action->inlineList );
285 out << "</sub_action>";
289 void XMLCodeGen::writeLmOnNext( InlineItem *item )
291 out << "<set_tokend>0</set_tokend>";
292 out << "<hold></hold>";
294 if ( item->longestMatchPart->action != 0 ) {
295 out << "<sub_action>";
296 writeInlineList( item->longestMatchPart->action->inlineList );
297 out << "</sub_action>";
301 void XMLCodeGen::writeLmOnLagBehind( InlineItem *item )
303 out << "<exec><get_tokend></get_tokend></exec>";
305 if ( item->longestMatchPart->action != 0 ) {
306 out << "<sub_action>";
307 writeInlineList( item->longestMatchPart->action->inlineList );
308 out << "</sub_action>";
312 void XMLCodeGen::writeLmSwitch( InlineItem *item )
314 LongestMatch *longestMatch = item->longestMatch;
315 out << "<lm_switch>\n";
317 /* We can't put the <exec> here because we may need to handle the error
318 * case and in that case p should not be changed. Instead use a default
319 * label in the switch to adjust p when user actions are not set. An id of
320 * -1 indicates the default. */
322 if ( longestMatch->lmSwitchHandlesError ) {
323 /* If the switch handles error then we should have also forced the
325 assert( fsm->errState != 0 );
327 out << " <sub_action id=\"0\">";
328 out << "<goto>" << fsm->errState->alg.stateNum << "</goto>";
329 out << "</sub_action>\n";
332 bool needDefault = false;
333 for ( LmPartList::Iter lmi = *longestMatch->longestMatchList; lmi.lte(); lmi++ ) {
334 if ( lmi->inLmSelect ) {
335 if ( lmi->action == 0 )
338 /* Open the action. Write it with the context that sets up _p
339 * when doing control flow changes from inside the machine. */
340 out << " <sub_action id=\"" << lmi->longestMatchId << "\">";
341 out << "<exec><get_tokend></get_tokend></exec>";
342 writeInlineList( lmi->action->inlineList );
343 out << "</sub_action>\n";
349 out << " <sub_action id=\"-1\"><exec><get_tokend>"
350 "</get_tokend></exec></sub_action>\n";
353 out << " </lm_switch>";
356 void XMLCodeGen::writeInlineList( InlineList *inlineList )
358 for ( InlineList::Iter item = *inlineList; item.lte(); item++ ) {
359 switch ( item->type ) {
360 case InlineItem::Text:
363 case InlineItem::Goto:
366 case InlineItem::GotoExpr:
367 writeGotoExpr( item );
369 case InlineItem::Call:
372 case InlineItem::CallExpr:
373 writeCallExpr( item );
375 case InlineItem::Next:
378 case InlineItem::NextExpr:
379 writeNextExpr( item );
381 case InlineItem::Break:
382 out << "<break></break>";
384 case InlineItem::Ret:
385 out << "<ret></ret>";
387 case InlineItem::PChar:
388 out << "<pchar></pchar>";
390 case InlineItem::Char:
391 out << "<char></char>";
393 case InlineItem::Curs:
394 out << "<curs></curs>";
396 case InlineItem::Targs:
397 out << "<targs></targs>";
399 case InlineItem::Entry:
403 case InlineItem::Hold:
404 out << "<hold></hold>";
406 case InlineItem::Exec:
407 writeActionExec( item );
410 case InlineItem::LmSetActId:
411 out << "<set_act>" <<
412 item->longestMatchPart->longestMatchId <<
415 case InlineItem::LmSetTokEnd:
416 out << "<set_tokend>1</set_tokend>";
419 case InlineItem::LmOnLast:
420 writeLmOnLast( item );
422 case InlineItem::LmOnNext:
423 writeLmOnNext( item );
425 case InlineItem::LmOnLagBehind:
426 writeLmOnLagBehind( item );
428 case InlineItem::LmSwitch:
429 writeLmSwitch( item );
432 case InlineItem::LmInitAct:
433 out << "<init_act></init_act>";
435 case InlineItem::LmInitTokStart:
436 out << "<init_tokstart></init_tokstart>";
438 case InlineItem::LmSetTokStart:
439 out << "<set_tokstart></set_tokstart>";
445 void XMLCodeGen::makeKey( GenInlineList *outList, Key key )
449 void XMLCodeGen::makeText( GenInlineList *outList, InlineItem *item )
453 void XMLCodeGen::makeGoto( GenInlineList *outList, InlineItem *item )
457 void XMLCodeGen::makeGotoExpr( GenInlineList *outList, InlineItem *item )
461 void XMLCodeGen::makeCall( GenInlineList *outList, InlineItem *item )
465 void XMLCodeGen::makeCallExpr( GenInlineList *outList, InlineItem *item )
469 void XMLCodeGen::makeNext( GenInlineList *outList, InlineItem *item )
473 void XMLCodeGen::makeNextExpr( GenInlineList *outList, InlineItem *item )
477 void XMLCodeGen::makeEntry( GenInlineList *outList, InlineItem *item )
481 void XMLCodeGen::makeLmSetActId( GenInlineList *outList, InlineItem *item )
485 void XMLCodeGen::makeLmOnLast( GenInlineList *outList, InlineItem *item )
489 void XMLCodeGen::makeLmOnNext( GenInlineList *outList, InlineItem *item )
493 void XMLCodeGen::makeLmOnLagBehind( GenInlineList *outList, InlineItem *item )
497 void XMLCodeGen::makeActionExec( GenInlineList *outList, InlineItem *item )
501 void XMLCodeGen::makeLmSwitch( GenInlineList *outList, InlineItem *item )
505 void XMLCodeGen::makeGenInlineList( GenInlineList *outList, InlineList *inList )
507 for ( InlineList::Iter item = *inList; item.lte(); item++ ) {
508 switch ( item->type ) {
509 case InlineItem::Text:
510 makeText( outList, item );
512 case InlineItem::Goto:
513 makeGoto( outList, item );
515 case InlineItem::GotoExpr:
516 makeGotoExpr( outList, item );
518 case InlineItem::Call:
519 makeCall( outList, item );
521 case InlineItem::CallExpr:
522 makeCallExpr( outList, item );
524 case InlineItem::Next:
525 makeNext( outList, item );
527 case InlineItem::NextExpr:
528 makeNextExpr( outList, item );
530 case InlineItem::Break:
531 out << "<break></break>";
533 case InlineItem::Ret:
534 out << "<ret></ret>";
536 case InlineItem::PChar:
537 out << "<pchar></pchar>";
539 case InlineItem::Char:
540 out << "<char></char>";
542 case InlineItem::Curs:
543 out << "<curs></curs>";
545 case InlineItem::Targs:
546 out << "<targs></targs>";
548 case InlineItem::Entry:
549 makeEntry( outList, item );
552 case InlineItem::Hold:
553 out << "<hold></hold>";
555 case InlineItem::Exec:
556 makeActionExec( outList, item );
559 case InlineItem::LmSetActId:
560 out << "<set_act>" <<
561 item->longestMatchPart->longestMatchId <<
564 case InlineItem::LmSetTokEnd:
565 out << "<set_tokend>1</set_tokend>";
568 case InlineItem::LmOnLast:
569 makeLmOnLast( outList, item );
571 case InlineItem::LmOnNext:
572 makeLmOnNext( outList, item );
574 case InlineItem::LmOnLagBehind:
575 makeLmOnLagBehind( outList, item );
577 case InlineItem::LmSwitch:
578 makeLmSwitch( outList, item );
581 case InlineItem::LmInitAct:
582 out << "<init_act></init_act>";
584 case InlineItem::LmInitTokStart:
585 out << "<init_tokstart></init_tokstart>";
587 case InlineItem::LmSetTokStart:
588 out << "<set_tokstart></set_tokstart>";
595 void XMLCodeGen::writeAction( Action *action )
597 out << " <action id=\"" << action->actionId << "\"";
598 if ( action->name != 0 )
599 out << " name=\"" << action->name << "\"";
600 out << " line=\"" << action->loc.line << "\" col=\"" << action->loc.col << "\">";
601 writeInlineList( action->inlineList );
602 out << "</action>\n";
605 void xmlEscapeHost( std::ostream &out, char *data, long len )
607 char *end = data + len;
608 while ( data != end ) {
610 case '<': out << "<"; break;
611 case '>': out << ">"; break;
612 case '&': out << "&"; break;
613 default: out << *data; break;
619 void XMLCodeGen::writeStateActions( StateAp *state )
621 RedActionTable *toStateActions = 0;
622 if ( state->toStateActionTable.length() > 0 )
623 toStateActions = actionTableMap.find( state->toStateActionTable );
625 RedActionTable *fromStateActions = 0;
626 if ( state->fromStateActionTable.length() > 0 )
627 fromStateActions = actionTableMap.find( state->fromStateActionTable );
629 /* EOF actions go out here only if the state has no eof target. If it has
630 * an eof target then an eof transition will be used instead. */
631 RedActionTable *eofActions = 0;
632 if ( state->eofTarget == 0 && state->eofActionTable.length() > 0 )
633 eofActions = actionTableMap.find( state->eofActionTable );
635 if ( toStateActions != 0 || fromStateActions != 0 || eofActions != 0 ) {
636 out << " <state_actions>";
637 if ( toStateActions != 0 )
638 out << toStateActions->id;
642 if ( fromStateActions != 0 )
643 out << " " << fromStateActions->id;
647 if ( eofActions != 0 )
648 out << " " << eofActions->id;
652 out << "</state_actions>\n";
656 void XMLCodeGen::writeStateConditions( StateAp *state )
658 if ( state->stateCondList.length() > 0 ) {
659 out << " <cond_list length=\"" << state->stateCondList.length() << "\">\n";
660 for ( StateCondList::Iter scdi = state->stateCondList; scdi.lte(); scdi++ ) {
662 writeKey( scdi->lowKey );
664 writeKey( scdi->highKey );
666 out << scdi->condSpace->condSpaceId;
669 out << " </cond_list>\n";
673 void XMLCodeGen::writeStateList()
675 /* Write the list of states. */
676 out << " <state_list length=\"" << fsm->stateList.length() << "\">\n";
677 for ( StateList::Iter st = fsm->stateList; st.lte(); st++ ) {
678 out << " <state id=\"" << st->alg.stateNum << "\"";
679 if ( st->isFinState() )
680 out << " final=\"t\"";
683 writeStateActions( st );
685 writeStateConditions( st );
686 writeTransList( st );
688 out << " </state>\n";
693 out << " </state_list>\n";
696 bool XMLCodeGen::writeNameInst( NameInst *nameInst )
698 bool written = false;
699 if ( nameInst->parent != 0 )
700 written = writeNameInst( nameInst->parent );
702 if ( nameInst->name != 0 ) {
705 out << nameInst->name;
712 void XMLCodeGen::writeEntryPoints()
714 /* List of entry points other than start state. */
715 if ( fsm->entryPoints.length() > 0 || pd->lmRequiresErrorState ) {
716 out << " <entry_points";
717 if ( pd->lmRequiresErrorState )
718 out << " error=\"t\"";
720 for ( EntryMap::Iter en = fsm->entryPoints; en.lte(); en++ ) {
721 /* Get the name instantiation from nameIndex. */
722 NameInst *nameInst = pd->nameIndex[en->key];
723 StateAp *state = en->value;
724 out << " <entry name=\"";
725 writeNameInst( nameInst );
726 out << "\">" << state->alg.stateNum << "</entry>\n";
728 out << " </entry_points>\n";
732 void XMLCodeGen::writeMachine()
734 /* Open the machine. */
735 out << " <machine>\n";
738 reduceActionTables();
741 writeActionTableList();
745 out << " <start_state>" << fsm->startState->alg.stateNum <<
749 if ( fsm->errState != 0 ) {
750 out << " <error_state>" << fsm->errState->alg.stateNum <<
757 out << " </machine>\n";
761 void XMLCodeGen::writeConditions()
763 if ( condData->condSpaceMap.length() > 0 ) {
764 long nextCondSpaceId = 0;
765 for ( CondSpaceMap::Iter cs = condData->condSpaceMap; cs.lte(); cs++ )
766 cs->condSpaceId = nextCondSpaceId++;
768 out << " <cond_space_list length=\"" << condData->condSpaceMap.length() << "\">\n";
769 for ( CondSpaceMap::Iter cs = condData->condSpaceMap; cs.lte(); cs++ ) {
770 out << " <cond_space id=\"" << cs->condSpaceId <<
771 "\" length=\"" << cs->condSet.length() << "\">";
772 writeKey( cs->baseKey );
773 for ( CondSet::Iter csi = cs->condSet; csi.lte(); csi++ )
774 out << " " << (*csi)->actionId;
775 out << "</cond_space>\n";
777 out << " </cond_space_list>\n";
781 void XMLCodeGen::writeExports()
783 if ( pd->exportList.length() > 0 ) {
784 out << " <exports>\n";
785 for ( ExportList::Iter exp = pd->exportList; exp.lte(); exp++ ) {
786 out << " <ex name=\"" << exp->name << "\">";
787 writeKey( exp->key );
790 out << " </exports>\n";
794 void XMLCodeGen::writeXML()
796 /* Open the definition. */
797 xmlParser.open_ragel_def( fsmName );
800 xmlParser.cgd->setAlphType( keyOps->alphType->internalName );
802 /* Getkey expression. */
803 if ( pd->getKeyExpr != 0 ) {
805 writeInlineList( pd->getKeyExpr );
806 out << "</getkey>\n";
809 /* Access expression. */
810 if ( pd->accessExpr != 0 ) {
812 writeInlineList( pd->accessExpr );
813 out << "</access>\n";
816 /* PrePush expression. */
817 if ( pd->prePushExpr != 0 ) {
819 writeInlineList( pd->prePushExpr );
820 out << "</prepush>\n";
823 /* PostPop expression. */
824 if ( pd->postPopExpr != 0 ) {
826 writeInlineList( pd->postPopExpr );
827 out << "</postpop>\n";
831 * Variable expressions.
834 if ( pd->pExpr != 0 ) {
836 writeInlineList( pd->pExpr );
837 out << "</p_expr>\n";
840 if ( pd->peExpr != 0 ) {
842 writeInlineList( pd->peExpr );
843 out << "</pe_expr>\n";
846 if ( pd->eofExpr != 0 ) {
847 out << " <eof_expr>";
848 writeInlineList( pd->eofExpr );
849 out << "</eof_expr>\n";
852 if ( pd->csExpr != 0 ) {
854 writeInlineList( pd->csExpr );
855 out << "</cs_expr>\n";
858 if ( pd->topExpr != 0 ) {
859 out << " <top_expr>";
860 writeInlineList( pd->topExpr );
861 out << "</top_expr>\n";
864 if ( pd->stackExpr != 0 ) {
865 out << " <stack_expr>";
866 writeInlineList( pd->stackExpr );
867 out << "</stack_expr>\n";
870 if ( pd->actExpr != 0 ) {
871 out << " <act_expr>";
872 writeInlineList( pd->actExpr );
873 out << "</act_expr>\n";
876 if ( pd->tokstartExpr != 0 ) {
877 out << " <tokstart_expr>";
878 writeInlineList( pd->tokstartExpr );
879 out << "</tokstart_expr>\n";
882 if ( pd->tokendExpr != 0 ) {
883 out << " <tokend_expr>";
884 writeInlineList( pd->tokendExpr );
885 out << "</tokend_expr>\n";
888 if ( pd->dataExpr != 0 ) {
889 out << " <data_expr>";
890 writeInlineList( pd->dataExpr );
891 out << "</data_expr>\n";
902 void XMLCodeGen::makeBackend()
904 /* Open the definition. */
905 xmlParser.open_ragel_def( fsmName );
908 xmlParser.cgd->setAlphType( keyOps->alphType->internalName );
910 /* Getkey expression. */
911 if ( pd->getKeyExpr != 0 ) {
913 writeInlineList( pd->getKeyExpr );
914 out << "</getkey>\n";
917 /* Access expression. */
918 if ( pd->accessExpr != 0 ) {
920 writeInlineList( pd->accessExpr );
921 out << "</access>\n";
924 /* PrePush expression. */
925 if ( pd->prePushExpr != 0 ) {
927 writeInlineList( pd->prePushExpr );
928 out << "</prepush>\n";
931 /* PostPop expression. */
932 if ( pd->postPopExpr != 0 ) {
934 writeInlineList( pd->postPopExpr );
935 out << "</postpop>\n";
939 * Variable expressions.
942 if ( pd->pExpr != 0 ) {
944 writeInlineList( pd->pExpr );
945 out << "</p_expr>\n";
948 if ( pd->peExpr != 0 ) {
950 writeInlineList( pd->peExpr );
951 out << "</pe_expr>\n";
954 if ( pd->eofExpr != 0 ) {
955 out << " <eof_expr>";
956 writeInlineList( pd->eofExpr );
957 out << "</eof_expr>\n";
960 if ( pd->csExpr != 0 ) {
962 writeInlineList( pd->csExpr );
963 out << "</cs_expr>\n";
966 if ( pd->topExpr != 0 ) {
967 out << " <top_expr>";
968 writeInlineList( pd->topExpr );
969 out << "</top_expr>\n";
972 if ( pd->stackExpr != 0 ) {
973 out << " <stack_expr>";
974 writeInlineList( pd->stackExpr );
975 out << "</stack_expr>\n";
978 if ( pd->actExpr != 0 ) {
979 out << " <act_expr>";
980 writeInlineList( pd->actExpr );
981 out << "</act_expr>\n";
984 if ( pd->tokstartExpr != 0 ) {
985 out << " <tokstart_expr>";
986 writeInlineList( pd->tokstartExpr );
987 out << "</tokstart_expr>\n";
990 if ( pd->tokendExpr != 0 ) {
991 out << " <tokend_expr>";
992 writeInlineList( pd->tokendExpr );
993 out << "</tokend_expr>\n";
996 if ( pd->dataExpr != 0 ) {
997 out << " <data_expr>";
998 writeInlineList( pd->dataExpr );
999 out << "</data_expr>\n";