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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
|
/*
* Copyright (C) 2010 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef SyntaxChecker_h
#define SyntaxChecker_h
#include "Lexer.h"
#include <yarr/YarrSyntaxChecker.h>
namespace JSC {
class SyntaxChecker {
public:
struct BinaryExprContext {
BinaryExprContext(SyntaxChecker& context)
: m_context(&context)
{
m_context->m_topBinaryExprs.append(m_context->m_topBinaryExpr);
m_context->m_topBinaryExpr = 0;
}
~BinaryExprContext()
{
m_context->m_topBinaryExpr = m_context->m_topBinaryExprs.last();
m_context->m_topBinaryExprs.removeLast();
}
private:
SyntaxChecker* m_context;
};
struct UnaryExprContext {
UnaryExprContext(SyntaxChecker& context)
: m_context(&context)
{
m_context->m_topUnaryTokens.append(m_context->m_topUnaryToken);
m_context->m_topUnaryToken = 0;
}
~UnaryExprContext()
{
m_context->m_topUnaryToken = m_context->m_topUnaryTokens.last();
m_context->m_topUnaryTokens.removeLast();
}
private:
SyntaxChecker* m_context;
};
SyntaxChecker(JSGlobalData* , void*)
{
}
typedef SyntaxChecker FunctionBodyBuilder;
enum { NoneExpr = 0,
ResolveEvalExpr, ResolveExpr, NumberExpr, StringExpr,
ThisExpr, NullExpr, BoolExpr, RegExpExpr, ObjectLiteralExpr,
FunctionExpr, BracketExpr, DotExpr, CallExpr,
NewExpr, PreExpr, PostExpr, UnaryExpr, BinaryExpr,
ConditionalExpr, AssignmentExpr, TypeofExpr,
DeleteExpr, ArrayLiteralExpr };
typedef int ExpressionType;
typedef ExpressionType Expression;
typedef int SourceElements;
typedef int Arguments;
typedef ExpressionType Comma;
struct Property {
ALWAYS_INLINE Property(void* = 0)
: type((PropertyNode::Type)0)
{
}
ALWAYS_INLINE Property(const Identifier* ident, PropertyNode::Type ty)
: name(ident)
, type(ty)
{
}
ALWAYS_INLINE Property(PropertyNode::Type ty)
: name(0)
, type(ty)
{
}
ALWAYS_INLINE bool operator!() { return !type; }
const Identifier* name;
PropertyNode::Type type;
};
typedef int PropertyList;
typedef int ElementList;
typedef int ArgumentsList;
typedef int FormalParameterList;
typedef int FunctionBody;
typedef int Statement;
typedef int ClauseList;
typedef int Clause;
typedef int ConstDeclList;
typedef int BinaryOperand;
static const bool CreatesAST = false;
static const bool NeedsFreeVariableInfo = false;
static const bool CanUseFunctionCache = true;
static const unsigned DontBuildKeywords = LexexFlagsDontBuildKeywords;
static const unsigned DontBuildStrings = LexerFlagsDontBuildStrings;
int createSourceElements() { return 1; }
ExpressionType makeFunctionCallNode(int, int, int, int, int, int) { return CallExpr; }
void appendToComma(ExpressionType& base, ExpressionType right) { base = right; }
ExpressionType createCommaExpr(int, ExpressionType, ExpressionType right) { return right; }
ExpressionType makeAssignNode(int, ExpressionType, Operator, ExpressionType, bool, bool, int, int, int) { return AssignmentExpr; }
ExpressionType makePrefixNode(int, ExpressionType, Operator, int, int, int) { return PreExpr; }
ExpressionType makePostfixNode(int, ExpressionType, Operator, int, int, int) { return PostExpr; }
ExpressionType makeTypeOfNode(int, ExpressionType) { return TypeofExpr; }
ExpressionType makeDeleteNode(int, ExpressionType, int, int, int) { return DeleteExpr; }
ExpressionType makeNegateNode(int, ExpressionType) { return UnaryExpr; }
ExpressionType makeBitwiseNotNode(int, ExpressionType) { return UnaryExpr; }
ExpressionType createLogicalNot(int, ExpressionType) { return UnaryExpr; }
ExpressionType createUnaryPlus(int, ExpressionType) { return UnaryExpr; }
ExpressionType createVoid(int, ExpressionType) { return UnaryExpr; }
ExpressionType thisExpr(int) { return ThisExpr; }
ExpressionType createResolve(int, const Identifier*, int) { return ResolveExpr; }
ExpressionType createObjectLiteral(int) { return ObjectLiteralExpr; }
ExpressionType createObjectLiteral(int, int) { return ObjectLiteralExpr; }
ExpressionType createArray(int, int) { return ArrayLiteralExpr; }
ExpressionType createArray(int, int, int) { return ArrayLiteralExpr; }
ExpressionType createNumberExpr(int, double) { return NumberExpr; }
ExpressionType createString(int, const Identifier*) { return StringExpr; }
ExpressionType createBoolean(int, bool) { return BoolExpr; }
ExpressionType createNull(int) { return NullExpr; }
ExpressionType createBracketAccess(int, ExpressionType, ExpressionType, bool, int, int, int) { return BracketExpr; }
ExpressionType createDotAccess(int, ExpressionType, const Identifier*, int, int, int) { return DotExpr; }
ExpressionType createRegExp(int, const Identifier& pattern, const Identifier&, int) { return Yarr::checkSyntax(pattern.ustring()) ? 0 : RegExpExpr; }
ExpressionType createNewExpr(int, ExpressionType, int, int, int, int) { return NewExpr; }
ExpressionType createNewExpr(int, ExpressionType, int, int) { return NewExpr; }
ExpressionType createConditionalExpr(int, ExpressionType, ExpressionType, ExpressionType) { return ConditionalExpr; }
ExpressionType createAssignResolve(int, const Identifier&, ExpressionType, bool, int, int, int) { return AssignmentExpr; }
ExpressionType createFunctionExpr(int, const Identifier*, int, int, int, int, int, int) { return FunctionExpr; }
int createFunctionBody(int, bool) { return 1; }
int createArguments() { return 1; }
int createArguments(int) { return 1; }
int createArgumentsList(int, int) { return 1; }
int createArgumentsList(int, int, int) { return 1; }
template <bool complete> Property createProperty(const Identifier* name, int, PropertyNode::Type type)
{
if (!complete)
return Property(type);
ASSERT(name);
return Property(name, type);
}
template <bool complete> Property createProperty(JSGlobalData* globalData, double name, int, PropertyNode::Type type)
{
if (!complete)
return Property(type);
return Property(&globalData->parserArena->identifierArena().makeNumericIdentifier(globalData, name), type);
}
int createPropertyList(int, Property) { return 1; }
int createPropertyList(int, Property, int) { return 1; }
int createElementList(int, int) { return 1; }
int createElementList(int, int, int) { return 1; }
int createFormalParameterList(const Identifier&) { return 1; }
int createFormalParameterList(int, const Identifier&) { return 1; }
int createClause(int, int) { return 1; }
int createClauseList(int) { return 1; }
int createClauseList(int, int) { return 1; }
void setUsesArguments(int) { }
int createFuncDeclStatement(int, const Identifier*, int, int, int, int, int, int) { return 1; }
int createBlockStatement(int, int, int, int) { return 1; }
int createExprStatement(int, int, int, int) { return 1; }
int createIfStatement(int, int, int, int, int) { return 1; }
int createIfStatement(int, int, int, int, int, int) { return 1; }
int createForLoop(int, int, int, int, int, bool, int, int) { return 1; }
int createForInLoop(int, const Identifier*, int, int, int, int, int, int, int, int, int, int) { return 1; }
int createForInLoop(int, int, int, int, int, int, int, int, int) { return 1; }
int createEmptyStatement(int) { return 1; }
int createVarStatement(int, int, int, int) { return 1; }
int createReturnStatement(int, int, int, int, int, int) { return 1; }
int createBreakStatement(int, int, int, int, int) { return 1; }
int createBreakStatement(int, const Identifier*, int, int, int, int) { return 1; }
int createContinueStatement(int, int, int, int, int) { return 1; }
int createContinueStatement(int, const Identifier*, int, int, int, int) { return 1; }
int createTryStatement(int, int, const Identifier*, int, int, int, int) { return 1; }
int createSwitchStatement(int, int, int, int, int, int, int) { return 1; }
int createWhileStatement(int, int, int, int, int) { return 1; }
int createWithStatement(int, int, int, int, int, int, int) { return 1; }
int createDoWhileStatement(int, int, int, int, int) { return 1; }
int createLabelStatement(int, const Identifier*, int, int, int) { return 1; }
int createThrowStatement(int, int, int, int, int, int) { return 1; }
int createDebugger(int, int, int) { return 1; }
int createConstStatement(int, int, int, int) { return 1; }
int appendConstDecl(int, int, const Identifier*, int) { return 1; }
template <bool strict> Property createGetterOrSetterProperty(int, PropertyNode::Type type, const Identifier* name, int, int, int, int, int, int)
{
ASSERT(name);
if (!strict)
return Property(type);
return Property(name, type);
}
void appendStatement(int, int) { }
void addVar(const Identifier*, bool) { }
int combineCommaNodes(int, int, int) { return 1; }
int evalCount() const { return 0; }
void appendBinaryExpressionInfo(int& operandStackDepth, int expr, int, int, int, bool)
{
if (!m_topBinaryExpr)
m_topBinaryExpr = expr;
else
m_topBinaryExpr = BinaryExpr;
operandStackDepth++;
}
// Logic to handle datastructures used during parsing of binary expressions
void operatorStackPop(int& operatorStackDepth) { operatorStackDepth--; }
bool operatorStackHasHigherPrecedence(int&, int) { return true; }
BinaryOperand getFromOperandStack(int) { return m_topBinaryExpr; }
void shrinkOperandStackBy(int& operandStackDepth, int amount) { operandStackDepth -= amount; }
void appendBinaryOperation(int, int& operandStackDepth, int&, BinaryOperand, BinaryOperand) { operandStackDepth++; }
void operatorStackAppend(int& operatorStackDepth, int, int) { operatorStackDepth++; }
int popOperandStack(int&) { int res = m_topBinaryExpr; m_topBinaryExpr = 0; return res; }
void appendUnaryToken(int& stackDepth, int tok, int) { stackDepth = 1; m_topUnaryToken = tok; }
int unaryTokenStackLastType(int&) { return m_topUnaryToken; }
int unaryTokenStackLastStart(int&) { return 0; }
void unaryTokenStackRemoveLast(int& stackDepth) { stackDepth = 0; }
void assignmentStackAppend(int, int, int, int, int, Operator) { }
int createAssignment(int, int, int, int, int, int) { ASSERT_NOT_REACHED(); return 1; }
const Identifier& getName(const Property& property) const { ASSERT(property.name); return *property.name; }
PropertyNode::Type getType(const Property& property) const { return property.type; }
bool isResolve(ExpressionType expr) const { return expr == ResolveExpr || expr == ResolveEvalExpr; }
private:
int m_topBinaryExpr;
int m_topUnaryToken;
Vector<int, 8> m_topBinaryExprs;
Vector<int, 8> m_topUnaryTokens;
};
}
#endif
|
