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
263
264
|
/* <auto_header>
* <FILENAME>
*
* INTEL CONFIDENTIAL
* Copyright © 2011 Intel
* Corporation All Rights Reserved.
*
* The source code contained or described herein and all documents related to
* the source code ("Material") are owned by Intel Corporation or its suppliers
* or licensors. Title to the Material remains with Intel Corporation or its
* suppliers and licensors. The Material contains trade secrets and proprietary
* and confidential information of Intel or its suppliers and licensors. The
* Material is protected by worldwide copyright and trade secret laws and
* treaty provisions. No part of the Material may be used, copied, reproduced,
* modified, published, uploaded, posted, transmitted, distributed, or
* disclosed in any way without Intel’s prior express written permission.
*
* No license under any patent, copyright, trade secret or other intellectual
* property right is granted to or conferred upon you by disclosure or delivery
* of the Materials, either expressly, by implication, inducement, estoppel or
* otherwise. Any license under such intellectual property rights must be
* express and approved by Intel in writing.
*
* AUTHOR: Patrick Benavoli (patrickx.benavoli@intel.com)
* CREATED: 2011-06-01
* UPDATED: 2011-07-27
*
*
* </auto_header>
*/
#include "RuleParser.h"
#include "CompoundRule.h"
#include "SelectionCriterionRule.h"
#include <assert.h>
// Matches
const char* CRuleParser::_acDelimiters[CRuleParser::ENbStatuses] = {
"{", // EInit
"{} ", // EBeginCompoundRule
",}", // EEndCompoundRule
",}", // ECriterionRule
"{ ", // EContinue
"" // EDone
};
CRuleParser::CRuleParser(const string& strApplicationRule, const CSelectionCriteriaDefinition* pSelectionCriteriaDefinition) :
_strApplicationRule(strApplicationRule),
_pSelectionCriteriaDefinition(pSelectionCriteriaDefinition),
_uiCurrentPos(0),
_uiCurrentDeepness(0),
_eStatus(CRuleParser::EInit),
_pRootRule(NULL)
{
}
CRuleParser::~CRuleParser()
{
delete _pRootRule;
}
// Parse
bool CRuleParser::parse(CCompoundRule* pParentRule, string& strError)
{
while (true) {
// Iterate till next relevant delimiter
if (!iterate(strError)) {
return false;
}
switch(_eStatus) {
case EBeginCompoundRule: {
// Create new compound rule
CCompoundRule* pCompoundRule = new CCompoundRule;
// Parse
if (!pCompoundRule->parse(*this, strError)) {
delete pCompoundRule;
return false;
}
// Parent rule creation context?
if (pParentRule) {
// Chain
pParentRule->addChild(pCompoundRule);
} else {
// Root rule
delete _pRootRule;
_pRootRule = pCompoundRule;
}
// Parse
if (!parse(pCompoundRule, strError)) {
return false;
}
// Go on
break;
}
case EEndCompoundRule:
return true;
case EContinue:
// Seek for new rule
break;
case ECriterionRule: {
// Create new criterion rule
CSelectionCriterionRule* pCriterionRule = new CSelectionCriterionRule;
// Parse
if (!pCriterionRule->parse(*this, strError)) {
delete pCriterionRule;
return false;
}
// Chain
pParentRule->addChild(pCriterionRule);
// Go on
break;
}
case EDone: {
// If the current state is EDone, check that at least one rule has been found.
if (_pRootRule) {
// At least one rule found
return true;
} else {
strError = "Syntax error, no rule found";
return false;
}
}
default:
assert(0);
return false;
}
}
return true;
}
// Iterate
bool CRuleParser::iterate(string& strError)
{
string::size_type iDelimiter;
assert(_uiCurrentPos <= _strApplicationRule.length());
// Consume spaces
if ((iDelimiter = _strApplicationRule.find_first_not_of(" ", _uiCurrentPos)) != string::npos) {
// New pos
_uiCurrentPos = iDelimiter;
}
// Parse
if ((_uiCurrentPos != _strApplicationRule.length()) && ((iDelimiter = _strApplicationRule.find_first_of(_acDelimiters[_eStatus], _uiCurrentPos)) != string::npos)) {
switch(_strApplicationRule[iDelimiter]) {
case '{':
_eStatus = EBeginCompoundRule;
// Extract type
_strRuleType = _strApplicationRule.substr(_uiCurrentPos, iDelimiter - _uiCurrentPos);
_uiCurrentDeepness++;
break;
case '}':
_eStatus = EEndCompoundRule;
if (!_uiCurrentDeepness--) {
strError = "Missing opening brace";
return false;
}
break;
case ' ':
_eStatus = ECriterionRule;
// Extract type
_strRuleType = _strApplicationRule.substr(_uiCurrentPos, iDelimiter - _uiCurrentPos);
break;
case ',':
_eStatus = EContinue;
break;
}
// New pos
_uiCurrentPos = iDelimiter + 1;
} else {
if (_uiCurrentDeepness) {
strError = "Missing closing brace";
return false;
}
// Remaining characters
if (_uiCurrentPos != _strApplicationRule.length()) {
strError = "Syntax error";
return false;
}
// Done
_eStatus = EDone;
}
return true;
}
// Rule type
const string& CRuleParser::getType() const
{
return _strRuleType;
}
// Criteria defintion
const CSelectionCriteriaDefinition* CRuleParser::getSelectionCriteriaDefinition() const
{
return _pSelectionCriteriaDefinition;
}
// Root rule
CCompoundRule* CRuleParser::grabRootRule()
{
CCompoundRule* pRootRule = _pRootRule;
assert(pRootRule);
_pRootRule = NULL;
return pRootRule;
}
// Next word
bool CRuleParser::next(string& strNext, string& strError)
{
string::size_type iDelimiter;
// Consume spaces
if ((iDelimiter = _strApplicationRule.find_first_not_of(" ", _uiCurrentPos)) != string::npos) {
// New pos
_uiCurrentPos = iDelimiter;
}
if ((iDelimiter = _strApplicationRule.find_first_of("{} ,", _uiCurrentPos)) == string::npos) {
strError = "Syntax error";
return false;
}
strNext = _strApplicationRule.substr(_uiCurrentPos, iDelimiter - _uiCurrentPos);
// New pos
_uiCurrentPos = iDelimiter;
return true;
}
|
