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
|
/* sequencerule.vala
*
* Copyright (C) 2008-2009 Florian Brosch, Didier Villevalois
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author:
* Didier 'Ptitjes Villevalois <ptitjes@free.fr>
*/
internal class Valadoc.SequenceRule : Rule {
public SequenceRule (Object[] scheme) {
_scheme = scheme;
}
private Object[] _scheme;
private class State : Object {
public int index = 0;
}
public override bool is_optional () {
return false;
}
public override bool starts_with_token (Token token) {
return test_token (0, token);
}
private bool test_token (int from_index, Token token) {
int i = from_index;
while (i < _scheme.length) {
if (has_start_token (_scheme[i], token)) {
return true;
}
if (!is_optional_rule (_scheme[i])) {
break;
}
i++;
}
return false;
}
private bool test_reduce (int from_index, Token token) {
int i = from_index;
while (i < _scheme.length) {
if (!is_optional_rule (_scheme[i])) {
return false;
}
i++;
}
return true;
}
public override bool accept_token (Token token, ParserCallback parser,
Rule.Forward forward) throws ParserError
{
var state = parser.get_rule_state () as State;
if (state == null) {
state = new State ();
parser.set_rule_state (state);
}
if (state.index == 0) {
do_start (parser);
} else if (state.index == _scheme.length) {
do_reduce (parser);
return false;
}
Object? scheme_element = null;
bool handled;
do {
scheme_element = _scheme[state.index];
if (try_to_apply (scheme_element, token, parser, out handled)) {
state.index++;
return handled;
}
if (!is_optional_rule (scheme_element)) {
break;
} else {
((Rule) scheme_element).do_skip (parser);
}
state.index++;
} while (state.index < _scheme.length);
if (state.index == _scheme.length) {
do_reduce (parser);
return false;
}
if (scheme_element is TokenType) {
parser.error (token, "expected %s".printf (((TokenType) scheme_element).to_pretty_string ()));
} else {
parser.error (token, "unexpected token");
}
assert_not_reached ();
}
public override bool would_accept_token (Token token, Object? rule_state) {
var state = rule_state as State;
return test_token (state.index, token);
}
public override bool would_reduce (Token token, Object? rule_state) {
var state = rule_state as State;
return state.index == _scheme.length || test_reduce (state.index, token);
}
public override string to_string (Object? rule_state) {
var state = rule_state as State;
if (state == null) {
state = new State ();
}
return "%-15s%-15s(index=%d/%d)".printf (name != null ? name : " ", "[seq]", state.index, _scheme.length);
}
}
|
