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
193
194
195
196
197
198
199
200
201
202
|
/*
* Copyright 2007-2009 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Colm.
*
* Colm 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.
*
* Colm 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 Colm; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _PDARUN_H
#define _PDARUN_H
#include <iostream>
#include "bytecode.h"
#include "rtvector.h"
#include "fsmrun2.h"
#include "input.h"
#include "pdarun2.h"
using std::ostream;
typedef struct _Tree Tree;
struct ParseData;
struct FsmRun;
struct KlangEl;
struct InputStreamAccum;
#include "map.h"
MapEl *mapCopyBranch( Program *prg, Map *map, MapEl *el, Kid *oldNextDown, Kid *&newNextDown );
MapEl *mapInsert( Program *prg, Map *map, MapEl *element, MapEl **lastFound = 0 );
MapEl *mapInsert( Program *prg, Map *map, Tree *key, MapEl **lastFound = 0 );
MapEl *mapImplFind( Program *prg, Map *map, Tree *key );
void mapImplRemove( Program *prg, Map *map, MapEl *element );
bool mapImplRemove( Program *prg, Map *map, Tree *key );
MapEl *mapDetachByKey( Program *prg, Map *map, Tree *key );
MapEl *mapDetach( Program *prg, Map *map, MapEl *element );
typedef struct _Accum
{
/* Must overlay Tree. */
short id;
unsigned short flags;
long refs;
Kid *child;
GenericInfo *genericInfo;
PdaRun *pdaRun;
FsmRun *fsmRun;
Stream *stream;
} Accum;
/*
* Iterators.
*/
struct TreeIter
{
Ref rootRef;
Ref ref;
long searchId;
Tree **stackRoot;
long stackSize;
};
inline void initTreeIter( TreeIter *treeIter, const Ref *rootRef, int searchId, Tree **stackRoot )
{
treeIter->rootRef = *rootRef;
treeIter->searchId = searchId;
treeIter->stackRoot = stackRoot;
treeIter->stackSize = 0;
treeIter->ref.kid = 0;
treeIter->ref.next = 0;
}
/* This must overlay tree iter because some of the same bytecodes are used. */
struct RevTreeIter
{
Ref rootRef;
Ref ref;
long searchId;
Tree **stackRoot;
long stackSize;
/* For detecting a split at the leaf. */
Kid *kidAtYield;
long children;
Kid **cur;
};
inline void initRevTreeIter( RevTreeIter *revTriter, const Ref *rootRef,
int searchId, Tree **stackRoot, int children )
{
revTriter->rootRef = *rootRef;
revTriter->searchId = searchId;
revTriter->stackRoot = stackRoot;
revTriter->stackSize = children;
revTriter->kidAtYield = 0;
revTriter->children = children;
revTriter->ref.kid = 0;
revTriter->ref.next = 0;
}
void initUserIter( UserIter *userIter, Tree **stackRoot, long argSize, long searchId );
bool makeReverseCode( CodeVect *all, CodeVect &reverseCode );
typedef RtVector<Tree*> Bindings;
struct PdaRun
{
PdaRun( Program *prg, PdaTables *tables, FsmRun *fsmRun, int parserId,
long stopTarget, bool revertOn )
:
prg(prg),
tables(tables),
fsmRun(fsmRun),
parserId(parserId),
stopParsing(false),
stopTarget(stopTarget),
queue(0),
queueLast(0),
revertOn(revertOn),
context(0),
consumed(0),
targetConsumed(-1)
{
}
int numRetry;
Kid *stackTop;
int errCount;
int cs;
int nextRegionInd;
/* Offset can be used to look at the next nextRegionInd. */
int getNextRegion( int offset = 0 )
{ return tables->tokenRegions[nextRegionInd+offset]; }
Program *prg;
PdaTables *tables;
FsmRun *fsmRun;
int parserId;
long stackTopTarget();
void commitKid( Tree **root, Kid *lel );
void commit();
bool isParserStopFinished();
void match( Kid *tree, Kid *pattern );
Kid *extractIgnore();
/* Report an error encountered by the parser. */
ostream &parseError( int tokId, Tree *tree );
/* Reused. */
CodeVect reverseCode;
CodeVect *allReverseCode;
bool stopParsing;
long stopTarget;
Kid *accumIgnore;
Kid *queue, *queueLast;
Bindings bindings;
bool revertOn;
Tree *context;
void clearContext( Tree **sp );
//bool fragStop;
bool stop;
long consumed;
long targetConsumed;
};
void initPdaRun( PdaRun *pdaRun, Tree *tree );
void cleanParser( Tree **root, PdaRun *pdaRun );
void ignore( PdaRun *pdaRun, Tree *tree );
void parseToken( Tree **sp, PdaRun *pdaRun, FsmRun *fsmRun, InputStream *inputStream, Kid *input );
long undoParse( Tree **sp, PdaRun *pdaRun, FsmRun *fsmRun, InputStream *inputStream, Tree *tree );
void xml_print_list( RuntimeData *runtimeData, Kid *lel, int depth );
ostream &parseError( InputStream *inputStream, FsmRun *fsmRun, PdaRun *pdaRun, int tokId, Tree *tree );
#endif /* _PDARUN_H */
|
