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
|
/*
* 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
namespace JSC {
class SyntaxChecker {
public:
SyntaxChecker(JSGlobalData*, Lexer*)
{
}
typedef SyntaxChecker FunctionBodyBuilder;
typedef int Expression;
typedef int SourceElements;
typedef int Arguments;
typedef int Comma;
typedef int Property;
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;
int createSourceElements() { return 1; }
int makeFunctionCallNode(int, int, int, int, int) { return 1; }
void appendToComma(int, int) { }
int createCommaExpr(int, int) { return 1; }
int makeAssignNode(int, Operator, int, bool, bool, int, int, int) { return 1; }
int makePrefixNode(int, Operator, int, int, int) { return 1; }
int makePostfixNode(int, Operator, int, int, int) { return 1; }
int makeTypeOfNode(int) { return 1; }
int makeDeleteNode(int, int, int, int) { return 1; }
int makeNegateNode(int) { return 1; }
int makeBitwiseNotNode(int) { return 1; }
int createLogicalNot(int) { return 1; }
int createUnaryPlus(int) { return 1; }
int createVoid(int) { return 1; }
int thisExpr() { return 1; }
int createResolve(const Identifier*, int) { return 1; }
int createObjectLiteral() { return 1; }
int createObjectLiteral(int) { return 1; }
int createArray(int) { return 1; }
int createArray(int, int) { return 1; }
int createNumberExpr(double) { return 1; }
int createString(const Identifier*) { return 1; }
int createBoolean(bool) { return 1; }
int createNull() { return 1; }
int createBracketAccess(int, int, bool, int, int, int) { return 1; }
int createDotAccess(int, const Identifier&, int, int, int) { return 1; }
int createRegex(const Identifier&, const Identifier&, int) { return 1; }
int createNewExpr(int, int, int, int, int) { return 1; }
int createNewExpr(int, int, int) { return 1; }
int createConditionalExpr(int, int, int) { return 1; }
int createAssignResolve(const Identifier&, int, bool, int, int, int) { return 1; }
int createFunctionExpr(const Identifier*, int, int, int, int, int, int) { return 1; }
int createFunctionBody() { return 1; }
int createArguments() { return 1; }
int createArguments(int) { return 1; }
int createArgumentsList(int) { return 1; }
int createArgumentsList(int, int) { return 1; }
int createProperty(const Identifier*, int, PropertyNode::Type) { return 1; }
int createProperty(double, int, PropertyNode::Type) { return 1; }
int createPropertyList(int) { return 1; }
int createPropertyList(int, 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(const Identifier*, int, int, int, int, int, int) { return 1; }
int createBlockStatement(int, int, int) { return 1; }
int createExprStatement(int, int, int) { return 1; }
int createIfStatement(int, int, int, int) { return 1; }
int createIfStatement(int, int, int, int, int) { return 1; }
int createForLoop(int, int, int, int, bool, int, int) { return 1; }
int createForInLoop(const Identifier*, int, int, int, int, int, int, int, int, int, int) { return 1; }
int createForInLoop(int, int, int, int, int, int, int, int) { return 1; }
int createEmptyStatement() { return 1; }
int createVarStatement(int, int, int) { return 1; }
int createReturnStatement(int, int, int, int, int) { return 1; }
int createBreakStatement(int, int, int, int) { return 1; }
int createBreakStatement(const Identifier*, int, int, int, int) { return 1; }
int createContinueStatement(int, int, int, int) { return 1; }
int createContinueStatement(const Identifier*, int, int, int, int) { return 1; }
int createTryStatement(int, const Identifier*, bool, int, int, int, int) { return 1; }
int createSwitchStatement(int, int, int, int, int, int) { return 1; }
int createWhileStatement(int, int, int, int) { return 1; }
int createWithStatement(int, int, int, int, int, int) { return 1; }
int createDoWhileStatement(int, int, int, int) { return 1; }
int createLabelStatement(const Identifier*, int, int, int) { return 1; }
int createThrowStatement(int, int, int, int, int) { return 1; }
int createDebugger(int, int) { return 1; }
int createConstStatement(int, int, int) { return 1; }
int appendConstDecl(int, const Identifier*, int) { return 1; }
int createGetterOrSetterProperty(const Identifier*, const Identifier*, int, int, int, int, int, int) { return 1; }
void appendStatement(int, int) { }
void addVar(const Identifier*, bool) { }
int combineCommaNodes(int, int) { return 1; }
int evalCount() const { return 0; }
void appendBinaryExpressionInfo(int& operandStackDepth, int, int, int, int, bool) { 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 1; }
void shrinkOperandStackBy(int& operandStackDepth, int amount) { operandStackDepth -= amount; }
void appendBinaryOperation(int& operandStackDepth, int&, BinaryOperand, BinaryOperand) { operandStackDepth++; }
void operatorStackAppend(int& operatorStackDepth, int, int) { operatorStackDepth++; }
int popOperandStack(int&) { return 1; }
void appendUnaryToken(int&, int, int) { }
int unaryTokenStackLastType(int&) { ASSERT_NOT_REACHED(); return 1; }
int unaryTokenStackLastStart(int&) { ASSERT_NOT_REACHED(); return 1; }
void unaryTokenStackRemoveLast(int&) { }
void assignmentStackAppend(int, int, int, int, int, Operator) { }
int createAssignment(int, int, int, int, int) { ASSERT_NOT_REACHED(); return 1; }
};
}
#endif
|
