-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGrammarSymbol.C
More file actions
88 lines (56 loc) · 1.26 KB
/
GrammarSymbol.C
File metadata and controls
88 lines (56 loc) · 1.26 KB
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
/****************************************************************
GrammarSymbol.C
william.majoros@duke.edu
This is open-source software, governed by the ARTISTIC LICENSE
(see www.opensource.org).
****************************************************************/
#include <iostream>
#include "GrammarSymbol.H"
#include "BOOM/Constants.H"
using namespace std;
using namespace BOOM;
GrammarSymbol::GrammarSymbol(SymbolType t,const BOOM::String &lexeme)
: type(t), lexeme(lexeme)
{
// ctor
}
GrammarSymbol::GrammarSymbol()
{
// ctor
}
BOOM::String &GrammarSymbol::getLexeme()
{
return lexeme;
}
SymbolType &GrammarSymbol::getType()
{
return type;
}
bool GrammarSymbol::isTerminal() const
{
return type==TERMINAL_SYMBOL;
}
bool GrammarSymbol::isNonterminal() const
{
return type==NONTERMINAL_SYMBOL;
}
unsigned GrammarSymbol::hash() const
{
//unsigned u=reinterpret_cast<unsigned>(this);
//return u%UINT_MAX;
return lexeme.hash();
}
bool GrammarSymbol::operator==(const GrammarSymbol &other)
{
//return this==&other;
return type==other.type && lexeme==other.lexeme;
}
void GrammarSymbol::printOn(ostream &os) const
{
os<<lexeme;
}
ostream &operator<<(ostream &os,const GrammarSymbol &S)
{
S.printOn(os);
return os;
}