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
|
# grammar.py, part of Yapps 2 - yet another python parser system
# Copyright 1999-2003 by Amit J. Patel <amitp@cs.stanford.edu>
# Enhancements copyright 2003-2004 by Matthias Urlichs <smurf@debian.org>
#
# This version of the Yapps 2 grammar can be distributed under the
# terms of the MIT open source license, either found in the LICENSE
# file included with the Yapps distribution
# <http://theory.stanford.edu/~amitp/yapps/> or at
# <http://www.opensource.org/licenses/mit-license.php>
#
"""Parser for Yapps grammars.
This file defines the grammar of Yapps grammars. Naturally, it is
implemented in Yapps. The grammar.py module needed by Yapps is built
by running Yapps on yapps_grammar.g. (Holy circularity, Batman!)
"""
try:
from yapps import parsetree
except ImportError:
import parsetree
######################################################################
def cleanup_choice(rule, lst):
if len(lst) == 0:
return parsetree.Sequence(rule, [])
if len(lst) == 1:
return lst[0]
return parsetree.Choice(rule, *tuple(lst))
def cleanup_sequence(rule, lst):
if len(lst) == 1:
return lst[0]
return parsetree.Sequence(rule, *tuple(lst))
def resolve_name(rule, tokens, id, args):
if id in [x[0] for x in tokens]:
# It's a token
if args:
print 'Warning: ignoring parameters on TOKEN %s<<%s>>' % (id, args)
return parsetree.Terminal(rule, id)
else:
# It's a name, so assume it's a nonterminal
return parsetree.NonTerminal(rule, id, args)
%%
parser ParserDescription:
ignore: "[ \t\r\n]+"
ignore: "#.*?\r?\n"
token EOF: "$"
token ATTR: "<<.+?>>"
token STMT: "{{.+?}}"
token ID: '[a-zA-Z_][a-zA-Z_0-9]*'
token STR: '[rR]?\'([^\\n\'\\\\]|\\\\.)*\'|[rR]?"([^\\n"\\\\]|\\\\.)*"'
token LP: '\\('
token RP: '\\)'
token LB: '\\['
token RB: '\\]'
token OR: '[|]'
token STAR: '[*]'
token PLUS: '[+]'
token QUEST: '[?]'
token COLON: ':'
rule Parser: "parser" ID ":"
Options
Tokens
Rules<<Tokens>>
EOF
{{ return parsetree.Generator(ID, Options, Tokens, Rules) }}
rule Options: {{ opt = {} }}
( "option" ":" Str {{ opt[Str] = 1 }} )*
{{ return opt }}
rule Tokens: {{ tok = [] }}
(
"token" ID
":" Str {{ tid = (ID, Str) }}
( STMT {{ tid += (STMT[2:-2],) }} )?
{{ tok.append(tid) }}
| "ignore"
":" Str {{ ign = ('#ignore', Str) }}
( STMT {{ ign += (STMT[2:-2],) }} )?
{{ tok.append(ign) }}
)*
{{ return tok }}
rule Rules<<tokens>>:
{{ rul = [] }}
(
"rule" ID OptParam ":" ClauseA<<ID, tokens>>
{{ rul.append((ID, OptParam, ClauseA)) }}
)*
{{ return rul }}
rule ClauseA<<rule, tokens>>:
ClauseB<<rule, tokens>>
{{ v = [ClauseB] }}
( OR ClauseB<<rule, tokens>> {{ v.append(ClauseB) }} )*
{{ return cleanup_choice(rule, v) }}
rule ClauseB<<rule, tokens>>:
{{ v = [] }}
( ClauseC<<rule, tokens>> {{ v.append(ClauseC) }} )*
{{ return cleanup_sequence(rule, v) }}
rule ClauseC<<rule, tokens>>:
ClauseD<<rule, tokens>>
( PLUS {{ return parsetree.Plus(rule, ClauseD) }}
| STAR {{ return parsetree.Star(rule, ClauseD) }}
| QUEST {{ return parsetree.Option(rule, ClauseD) }}
| {{ return ClauseD }} )
rule ClauseD<<rule, tokens>>:
STR {{ t = (STR, eval(STR, {}, {})) }}
{{ if t not in tokens: }}
{{ tokens.insert(0, t) }}
{{ return parsetree.Terminal(rule, STR) }}
| ID OptParam {{ return resolve_name(rule, tokens, ID, OptParam) }}
| LP ClauseA<<rule, tokens>> RP {{ return ClauseA }}
| LB ClauseA<<rule, tokens>> RB {{ return parsetree.Option(rule, ClauseA) }}
| STMT {{ return parsetree.Eval(rule, STMT[2:-2]) }}
rule OptParam: [ ATTR {{ return ATTR[2:-2] }} ] {{ return '' }}
rule Str: STR {{ return eval(STR, {}, {}) }}
%%
|
