-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProduction.C
154 lines (104 loc) · 2.42 KB
/
Production.C
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
/****************************************************************
Production.C
This is open-source software, governed by the ARTISTIC LICENSE
(see www.opensource.org).
****************************************************************/
#include <iostream>
#include "Production.H"
using namespace std;
using namespace BOOM;
Production::Production()
{
// ctor
}
GrammarSymbol *Production::getLHS() const
{
return lhs;
}
void Production::setLHS(GrammarSymbol *s)
{
lhs=s;
}
Vector<GrammarSymbol*> &Production::getRHS()
{
return rhs;
}
float Production::getProbability() const
{
return P;
}
void Production::setProbability(float p)
{
P=p;
}
int Production::rhsLength() const
{
return rhs.size();
}
bool Production::isInCNF() const
{
switch(rhs.size()) {
case 1:
return rhs[0]->isTerminal();
case 2:
return rhs[0]->isNonterminal() && rhs[1]->isNonterminal();
default:
return false;
}
}
void Production::printOn(ostream &os) const
{
os<<lhs->getLexeme()<<" -> ";
const int n=rhsLength();
for(int i=0 ; i<n ; ++i) {
GrammarSymbol *s=rhs[i];
if(s->getType()==NONTERMINAL_SYMBOL) os<<s->getLexeme()<<" ";
else os<<"'"<<s->getLexeme()<<"' ";
}
os<<"{ "<<P<<" }";
}
ostream &operator<<(ostream &os,const Production &prod)
{
prod.printOn(os);
return os;
}
bool Production::isNull() const
{
return rhs.isEmpty();
}
bool Production::isTerminal() const
{
if(isNull()) return false;
for(Vector<GrammarSymbol*>::const_iterator cur=rhs.begin(), end=rhs.end() ;
cur!=end ; ++cur)
if((*cur)->isNonterminal()) return false;
return true;
}
bool Production::isTerminalOrNull() const
{
for(Vector<GrammarSymbol*>::const_iterator cur=rhs.begin(), end=rhs.end() ;
cur!=end ; ++cur)
if((*cur)->isNonterminal()) return false;
return true;
}
bool Production::containsAnyTerminals() const
{
for(Vector<GrammarSymbol*>::const_iterator cur=rhs.begin(), end=rhs.end() ;
cur!=end ; ++cur)
if((*cur)->isTerminal()) return true;
return false;
}
bool Production::containsAnyNonterminals() const
{
for(Vector<GrammarSymbol*>::const_iterator cur=rhs.begin(), end=rhs.end() ;
cur!=end ; ++cur)
if((*cur)->isNonterminal()) return true;
return false;
}
bool Production::operator==(const Production &other) const
{
if(lhs!=other.lhs) return false;
if(P!=other.P) return false;
if(rhs!=other.rhs) return false;
}