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
|
/*****************************************************************************
*
* Copyright (c) 2000 - 2017, Lawrence Livermore National Security, LLC
* Produced at the Lawrence Livermore National Laboratory
* LLNL-CODE-442911
* 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.
*
*****************************************************************************/
#ifndef VISIT_PARSER_H
#define VISIT_PARSER_H
#include <parser_exports.h>
#include <vector>
#include <visitstream.h>
#include <Token.h>
#include <ParseTreeNode.h>
#include <Symbol.h>
#include <State.h>
#include <Grammar.h>
// ****************************************************************************
// Class: ParseElem
//
// Purpose:
// An element of a parse stack.
//
// Programmer: Jeremy Meredith
// Creation: April 5, 2002
//
// Modifications:
// Jeremy Meredith, Wed Nov 24 11:59:11 PST 2004
// Major refactoring. Added storage of Token here because it no longer
// derives directly from a parse tree node.
//
// Jeremy Meredith, Wed Jun 8 16:32:35 PDT 2005
// Changed token based constructor to take the symbol as passed in.
// This was to remove all static data and have the Parser look up
// the symbol in a dictionary.
//
// Jeremy Meredith, Mon Jun 13 15:59:20 PDT 2005
// Removed TokenParseTreeNode -- it had become superfluous and was keeping
// an extra pointer to Tokens around, preventing good memory management.
// Added pos here to prevent having to look in the node or token members.
//
// ****************************************************************************
struct PARSER_API ParseElem
{
const Symbol *sym;
ParseTreeNode *node;
Token *token;
Pos pos;
ParseElem(const Symbol *s, Token * t)
{
sym = s;
node = NULL;
token = t;
pos = t->GetPos();
}
ParseElem(const Symbol *s, ParseTreeNode *n)
{
sym = s;
node = n;
token = NULL;
pos = n->GetPos();
}
};
// ****************************************************************************
// Class: Parser
//
// Purpose:
// Abstract base for a parser.
//
// Programmer: Jeremy Meredith
// Creation: April 5, 2002
//
// Modifications:
// Jeremy Meredith, Wed Nov 24 11:59:55 PST 2004
// Removed the ParserInterface base class (it wasn't doing much good).
// Renamed this class Parser for consistency. Added list of tokens
// to the rule reduction method to make life easier for the implementor.
//
// Jeremy Meredith, Mon Nov 17 17:04:43 EST 2008
// Don't use the element stack to store the final parse tree; it's not
// really a parse element, because there's not really a lhs other than
// START, which doesn't make much sense. Instead, we just store it in
// a new data member, which is more direct and more clear.
//
// Tom Fogal, Wed Apr 29 15:36:42 MDT 2009
// Check for empty `elems' so we don't deref an empty vector.
//
// Kathleen Bonnell, Tue May 5 17:23:42 PDT 2009
// Revert GetParseTree changes back to Jeremy's fix from Nov 17, 2008.
//
// ****************************************************************************
class PARSER_API Parser
{
public:
Parser();
virtual ~Parser();
void Init();
void ParseOneToken(Token *);
bool Accept() { return accept; }
virtual ParseTreeNode *Parse(const std::string &) = 0;
ParseTreeNode *GetParseTree() { return parseTree; }
void SetGrammar(Grammar * g) { G = g; }
protected:
Grammar *G;
std::vector<int> states;
std::vector<ParseElem> elems;
bool accept;
ParseTreeNode *parseTree;
protected:
void Shift(Token *, int);
void Reduce(int);
virtual ParseTreeNode *ApplyRule(const Symbol &, const Rule *,
std::vector<ParseTreeNode*>&,
std::vector<Token*>&,
Pos) = 0;
void PrintState(ostream &);
};
#endif
|
