1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
/*
* Copyright 2005-2007 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Ragel.
*
* Ragel is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Ragel is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Ragel; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _XMLCODEGEN_H
#define _XMLCODEGEN_H
#include <iostream>
#include "avltree.h"
#include "fsmgraph.h"
#include "parsedata.h"
#include "redfsm.h"
/* Forwards. */
struct TransAp;
struct FsmAp;
struct ParseData;
struct GenInlineList;
struct CodeGenData;
struct RedActionTable
:
public AvlTreeEl<RedActionTable>
{
RedActionTable( const ActionTable &key )
:
key(key),
id(0)
{ }
const ActionTable &getKey()
{ return key; }
ActionTable key;
int id;
};
typedef AvlTree<RedActionTable, ActionTable, CmpActionTable> ActionTableMap;
struct NextRedTrans
{
Key lowKey, highKey;
TransAp *trans;
TransAp *next;
void load() {
if ( trans != 0 ) {
next = trans->next;
lowKey = trans->lowKey;
highKey = trans->highKey;
}
}
NextRedTrans( TransAp *t ) {
trans = t;
load();
}
void increment() {
trans = next;
load();
}
};
struct GenBase
{
GenBase( char *fsmName, ParseData *pd, FsmAp *fsm );
void appendTrans( TransListVect &outList, Key lowKey, Key highKey, TransAp *trans );
void reduceActionTables();
char *fsmName;
ParseData *pd;
FsmAp *fsm;
ActionTableMap actionTableMap;
int nextActionTableId;
};
class XMLCodeGen : protected GenBase
{
public:
XMLCodeGen( char *fsmName, ParseData *pd, FsmAp *fsm, std::ostream &out );
void writeXML( );
private:
void writeStateActions( StateAp *state );
void writeStateList();
void writeStateConditions( StateAp *state );
void writeKey( Key key );
void writeText( InlineItem *item );
void writeGoto( InlineItem *item );
void writeGotoExpr( InlineItem *item );
void writeCall( InlineItem *item );
void writeCallExpr( InlineItem *item );
void writeNext( InlineItem *item );
void writeNextExpr( InlineItem *item );
void writeEntry( InlineItem *item );
void writeLmOnLast( InlineItem *item );
void writeLmOnNext( InlineItem *item );
void writeLmOnLagBehind( InlineItem *item );
void writeExports();
bool writeNameInst( NameInst *nameInst );
void writeEntryPoints();
void writeConditions();
void writeInlineList( InlineList *inlineList );
void writeActionList();
void writeActionTableList();
void reduceTrans( TransAp *trans );
void writeTransList( StateAp *state );
void writeEofTrans( StateAp *state );
void writeTrans( Key lowKey, Key highKey, TransAp *defTrans );
void writeAction( Action *action );
void writeLmSwitch( InlineItem *item );
void writeMachine();
void writeActionExec( InlineItem *item );
std::ostream &out;
};
class BackendGen : protected GenBase
{
public:
BackendGen( char *fsmName, ParseData *pd, FsmAp *fsm, CodeGenData *cgd );
void makeBackend( );
private:
void makeGenInlineList( GenInlineList *outList, InlineList *inList );
void makeKey( GenInlineList *outList, Key key );
void makeText( GenInlineList *outList, InlineItem *item );
void makeLmOnLast( GenInlineList *outList, InlineItem *item );
void makeLmOnNext( GenInlineList *outList, InlineItem *item );
void makeLmOnLagBehind( GenInlineList *outList, InlineItem *item );
void makeActionExec( GenInlineList *outList, InlineItem *item );
void makeLmSwitch( GenInlineList *outList, InlineItem *item );
void makeSetTokend( GenInlineList *outList, long offset );
void makeSetAct( GenInlineList *outList, long lmId );
void makeSubList( GenInlineList *outList, InlineList *inlineList,
GenInlineItem::Type type );
void makeTargetItem( GenInlineList *outList, NameInst *nameTarg, GenInlineItem::Type type );
void makeExecGetTokend( GenInlineList *outList );
void makeExports();
void makeMachine();
void makeActionList();
void makeAction( Action *action );
void makeActionTableList();
void makeConditions();
void makeEntryPoints();
bool makeNameInst( std::string &out, NameInst *nameInst );
void makeStateList();
void makeStateActions( StateAp *state );
void makeEofTrans( StateAp *state );
void makeStateConditions( StateAp *state );
void makeTransList( StateAp *state );
void makeTrans( Key lowKey, Key highKey, TransAp *trans );
void close_ragel_def();
CodeGenData *cgd;
/* Collected during parsing. */
int curAction;
int curActionTable;
int curTrans;
int curState;
int curCondSpace;
int curStateCond;
};
#endif
|
