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
257
258
259
260
261
262
|
/*****************************************************************************
*
* Copyright (c) 2000 - 2010, Lawrence Livermore National Security, LLC
* Produced at the Lawrence Livermore National Laboratory
* LLNL-CODE-400124
* All rights reserved.
*
* This file is part of VisIt. For details, see https://visit.llnl.gov/. The
* full copyright notice is contained in the file COPYRIGHT located at the root
* of the VisIt distribution or at http://www.llnl.gov/visit/copyright.html.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the disclaimer below.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the disclaimer (as noted below) in the
* documentation and/or other materials provided with the distribution.
* - Neither the name of the LLNS/LLNL nor the names of its contributors may
* be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 LAWRENCE LIVERMORE NATIONAL SECURITY,
* LLC, THE U.S. DEPARTMENT OF ENERGY OR 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.
*
*****************************************************************************/
#include "ExprGrammar.h"
#include "ExprToken.h"
//
// VisIt Expression Grammar
//
//
// Written April 5, 2002 by Jeremy Meredith
//
//
// Modifications:
// Jeremy Meredith, Wed Nov 24 11:43:51 PST 2004
// Refactored the parser into a standalone module. This required
// telling some tokens what their display name is instead of
// getting it from a function.
//
// Jeremy Meredith, Wed Nov 24 14:52:41 PST 2004
// Removed Expr => List and added Arg => List because we cannot
// work with lists as expressions just yet. We can change this
// back someday.
//
// Jeremy Meredith, Wed Jun 8 17:04:23 PDT 2005
// Made symbols all be associated with a dictionary.
//
// Brad Whitlock, Fri Oct 6 11:49:02 PDT 2006
// I made the symbols be static in the ExprGrammar class so there are no
// conflicts with Python 2.5.
//
// Jeremy Meredith, Wed Jul 23 13:29:06 EDT 2008
// Added a backslash symbol. We use it both for escaping and as
// a path separator. Added two rules here for the latter use.
//
Dictionary D;
// ------------------------------------------------------------------------
// TERMINALS
// ------------------------------------------------------------------------
Symbol ExprGrammar::T_Plus (D, '+');
Symbol ExprGrammar::T_Mult (D, '*');
Symbol ExprGrammar::T_Minus (D, '-');
Symbol ExprGrammar::T_Slash (D, '/');
Symbol ExprGrammar::T_BackSlash (D, '\\');
Symbol ExprGrammar::T_Exp (D, '^');
Symbol ExprGrammar::T_Mod (D, '%');
Symbol ExprGrammar::T_LBracket (D, '[');
Symbol ExprGrammar::T_RBracket (D, ']');
Symbol ExprGrammar::T_LParen (D, '(');
Symbol ExprGrammar::T_RParen (D, ')');
Symbol ExprGrammar::T_LCarat (D, '<');
Symbol ExprGrammar::T_RCarat (D, '>');
Symbol ExprGrammar::T_LBrace (D, '{');
Symbol ExprGrammar::T_RBrace (D, '}');
Symbol ExprGrammar::T_Pound (D, '#');
Symbol ExprGrammar::T_Equal (D, '=');
Symbol ExprGrammar::T_At (D, '@');
Symbol ExprGrammar::T_Comma (D, ',');
Symbol ExprGrammar::T_Colon (D, ':');
Symbol ExprGrammar::T_Ident (D, TT_Identifier, "Identifier");
Symbol ExprGrammar::T_Integer (D, TT_IntegerConst, "Integer");
Symbol ExprGrammar::T_Float (D, TT_FloatConst, "Float");
Symbol ExprGrammar::T_String (D, TT_StringConst, "String");
Symbol ExprGrammar::T_Bool (D, TT_BoolConst, "Bool");
Symbol ExprGrammar::T_And (D, '&');
// ------------------------------------------------------------------------
// NON-TERMINALS
// ------------------------------------------------------------------------
Symbol ExprGrammar::Expr (D, "Expr" );
Symbol ExprGrammar::Constant (D, "Constant" );
Symbol ExprGrammar::Vector (D, "Vector" );
Symbol ExprGrammar::List (D, "List" );
Symbol ExprGrammar::ListElems (D, "ListElems" );
Symbol ExprGrammar::ListElem (D, "ListElem" );
Symbol ExprGrammar::Function (D, "Function" );
Symbol ExprGrammar::Args (D, "Args" );
Symbol ExprGrammar::Arg (D, "Arg" );
Symbol ExprGrammar::PathSpec (D, "PathSpec" );
Symbol ExprGrammar::MultiSlash (D, "MultiSlash" );
Symbol ExprGrammar::Variable (D, "Variable" );
Symbol ExprGrammar::Database (D, "Database" );
Symbol ExprGrammar::DBSpec (D, "DBSpec" );
Symbol ExprGrammar::PathMachSpec (D, "PathMachSpec" );
Symbol ExprGrammar::MachSpec (D, "MachSpec" );
Symbol ExprGrammar::TimeSpec (D, "TimeSpec" );
// ****************************************************************************
// Constructor: ExprGrammar::ExprGrammar
//
// Programmer: Jeremy Meredith
// Creation: April 5, 2002
//
// ****************************************************************************
ExprGrammar::ExprGrammar() : Grammar(D)
{
// ----------------------------------------------------------------------
// Start rule
SetStartSymbol(Expr);
// ----------------------------------------------------------------------
// Expression
AddRule(Rule(0, Expr) >> Expr + T_Plus + Expr ); // addition
AddRule(Rule(1, Expr) >> Expr + T_Minus + Expr ); // subtraction
AddRule(Rule(2, Expr) >> Expr + T_Mult + Expr ); // multiplication
AddRule(Rule(3, Expr) >> Expr + T_Slash + Expr ); // division
AddRule(Rule(4, Expr) >> Expr + T_Exp + Expr ); // exponentiation
AddRule(Rule(5, Expr) >> Expr + T_Mod + Expr ); // modulo
AddRule(Rule(15, Expr) >> Expr + T_And + Expr ); // bitwise and
AddRule(Rule(6, Expr) >> Expr + T_LBracket + T_Integer + T_RBracket ); // index
AddRule(Rule(7, Expr) >> T_Minus + Expr, 5); // u-negative, prec=5
AddRule(Rule(8, Expr) >> T_LParen + Expr + T_RParen );
AddRule(Rule(9, Expr) >> Constant );
AddRule(Rule(10, Expr) >> Vector );
AddRule(Rule(11, Expr) >> Function );
AddRule(Rule(12, Expr) >> Variable );
AddRule(Rule(13, Expr) >> Database );
//AddRule(Rule(14, Expr) >> List );
// Constant
AddRule(Rule(0, Constant) >> T_Integer );
AddRule(Rule(1, Constant) >> T_Float );
AddRule(Rule(2, Constant) >> T_String );
AddRule(Rule(3, Constant) >> T_Bool );
// Vector
AddRule(Rule(0, Vector) >> T_LBrace + Expr + T_Comma + Expr + T_RBrace);
AddRule(Rule(1, Vector) >> T_LBrace + Expr + T_Comma + Expr + T_Comma + Expr + T_RBrace);
// List
AddRule(Rule(0, List) >> T_LBracket + ListElems + T_RBracket);
// ListElems
AddRule(Rule(0, ListElems) >> ListElems + T_Comma + ListElem);
AddRule(Rule(1, ListElems) >> ListElem);
// ListElem
AddRule(Rule(0, ListElem) >> Expr);
AddRule(Rule(1, ListElem) >> Expr + T_Colon + Expr);
AddRule(Rule(2, ListElem) >> Expr + T_Colon + Expr + T_Colon + Expr);
// Function
AddRule(Rule(0, Function) >> T_Ident + T_LParen + T_RParen);
AddRule(Rule(1, Function) >> T_Ident + T_LParen + Args + T_RParen);
// Args
AddRule(Rule(0, Args) >> Args + T_Comma + Arg);
AddRule(Rule(1, Args) >> Arg);
// Arg
AddRule(Rule(0, Arg) >> Expr);
AddRule(Rule(1, Arg) >> T_Ident + T_Equal + Expr);
AddRule(Rule(2, Arg) >> List);
// PathSpec
AddRule(Rule(0, PathSpec) >> PathSpec + MultiSlash + T_Ident);
AddRule(Rule(1, PathSpec) >> MultiSlash + T_Ident);
AddRule(Rule(2, PathSpec) >> T_Ident);
// MultiSlash
AddRule(Rule(0, MultiSlash) >> MultiSlash + T_Slash);
AddRule(Rule(1, MultiSlash) >> T_Slash);
AddRule(Rule(2, MultiSlash) >> MultiSlash + T_BackSlash);
AddRule(Rule(3, MultiSlash) >> T_BackSlash);
// Variable
AddRule(Rule(0, Variable) >> T_Ident );
AddRule(Rule(1, Variable) >> T_LCarat + PathSpec + T_RCarat );
AddRule(Rule(2, Variable) >> T_LCarat + DBSpec + T_Colon + PathSpec + T_RCarat );
// Database
AddRule(Rule(0, Database) >> T_LCarat + DBSpec + T_Colon + T_RCarat );
// DBSpec
AddRule(Rule(0, DBSpec) >> PathSpec );
AddRule(Rule(1, DBSpec) >> PathSpec + MachSpec);
AddRule(Rule(2, DBSpec) >> TimeSpec );
AddRule(Rule(3, DBSpec) >> PathSpec + TimeSpec );
AddRule(Rule(4, DBSpec) >> PathSpec + MachSpec + TimeSpec );
// MachSpec
AddRule(Rule(0, MachSpec) >> T_At + T_Ident );
// TimeSpec
AddRule(Rule(0, TimeSpec) >> T_LBracket + ListElems + T_RBracket + T_Ident);
AddRule(Rule(1, TimeSpec) >> T_LBracket + ListElems + T_RBracket);
AddRule(Rule(2, TimeSpec) >> T_LBracket + T_Pound + ListElems + T_RBracket);
// ----------------------------------------------------------------------
// -- associativity --
SetAssoc(T_Mod, Grammar::NonAssoc);
SetAssoc(T_Plus, Grammar::Left);
SetAssoc(T_Minus, Grammar::Left);
SetAssoc(T_Mult, Grammar::Left);
SetAssoc(T_Slash, Grammar::Left);
SetAssoc(T_Exp, Grammar::Right);
SetAssoc(T_And, Grammar::NonAssoc);
// -- precedence --
SetPrec(T_Mod, 1);
SetPrec(T_Plus, 2);
SetPrec(T_Minus, 2);
SetPrec(T_Mult, 3);
SetPrec(T_Slash, 3);
SetPrec(T_Exp, 4);
SetPrec(T_And, 4);
// Unary minus is 5 -- see rule above
SetPrec(T_LBracket, 6);
}
// ****************************************************************************
// Destructor: ExprGrammar::~ExprGrammar
//
// Programmer: Jeremy Meredith
// Creation: April 5, 2002
//
// ****************************************************************************
ExprGrammar::~ExprGrammar()
{
}
|
