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
|
/*****************************************************************************
*
* 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.
*
*****************************************************************************/
#ifndef CONFIGURATINGSET_H
#define CONFIGURATINGSET_H
#include <parser_exports.h>
#include <vector>
#include <map>
#include "ConfiguratingItem.h"
// ****************************************************************************
// Class: ConfiguratingSet
//
// Purpose:
// The working set of ConfiguratingItems. When finished, each
// configurating set (or at least its shift/reduce maps) becomes a state
// in the final parser.
//
// Programmer: Jeremy Meredith
// Creation: April 4, 2002
//
// ****************************************************************************
class PARSER_API ConfiguratingSet
{
friend struct State;
public:
ConfiguratingSet();
bool operator==(const ConfiguratingSet&) const;
void AddItem(const ConfiguratingItem&);
void Merge(const ConfiguratingSet&);
void Close(const std::vector<const Rule*>&);
SymbolSet GetShiftSymbols();
ConfiguratingSet GetShiftSet(const Symbol*);
SymbolSet GetReduceSymbols();
std::vector<int> GetReduceRules(const Symbol*);
void SetShiftTransition(const Symbol *s, int t) { shift[s] = t; }
void SetReduceRule(const Symbol *s, int r) { reduce[s] = r; }
void RemoveShiftTransition(const Symbol *s) { shift.erase(s); }
void RemoveReduceRule(const Symbol *s) { reduce.erase(s); }
void SetConflict(bool c) { conflict = c; }
bool HasConflict() const { return conflict; }
friend ostream &operator<<(ostream&, const ConfiguratingSet&);
private:
bool conflict;
std::vector<ConfiguratingItem> items;
std::map<const Symbol*, int> shift;
std::map<const Symbol*, int> reduce;
};
#endif
|
