/
mainc.py
executable file
·184 lines (142 loc) · 4.6 KB
/
mainc.py
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
#! /usr/bin/env python
#
#
# Copyright (c) 2007-2013, University of California / Singapore Management University
# Lingxiao Jiang <lxjiang@ucdavis.edu> <lxjiang@smu.edu.sg>
# Ghassan Misherghi <ghassanm@ucdavis.edu>
# Zhendong Su <su@ucdavis.edu>
# Stephane Glondu <steph@glondu.net>
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
# * Neither the name of the University of California nor the
# names of its contributors may be used to endorse or promote products
# derived from this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#
#
# Given a normal yacc .y file, simply split it into three files for our yacc.g to work: *.y (which contains and only contains all the rules), *.y.head, *.y.foot
# Pi: To make the parse reentrant. http://www.gnu.org/software/bison/manual/html_mono/bison.html#Pure-Decl
import sys
sys.path.append('..')
import YaccParser,YaccLexer
if len(sys.argv) != 2:
print >> sys.stderr, "usage %s grammar"%sys.argv[0]
sys.exit(1)
grammar= open(sys.argv[1],'r')
y= YaccParser.Parser(YaccLexer.Lexer(grammar))
y.grammar()
grammar.close()
outg= open('pt_'+sys.argv[1],'w')
print >> outg, """
%pure-parser
%{
#include<ptree.h>
using namespace std;
%}
%union{
Tree *t;
}
%{
void yyerror(char*s);
int yylex(YYSTYPE *yylvalp);
Tree *root;
%}
"""
for nt in y.NonTerminals:
print >> outg, '%type <t>', nt
header= open(sys.argv[1]+'.head','r')
outg.write( header.read() )
header.close()
print >> outg, """
%%
"""
name2id= {}
current= 0
for nt in y.NonTerminals:
name2id[nt]=current
current+=1
for t in y.Terminals:
name2id[t]=current
current+=1
#outh= open('tokid.h','w')
#for nt in y.NonTerminals:
# print >> outh, '#define ID_'+nt, name2id[nt]
#outh.close()
for rule in y.Rules:
print >> outg, rule[0], ':',
for production in rule[1]:
print >> outg, production[1],
"""
leave= False
for production in rule[1]:
if production[0]=="error":
leave= True
break
if leave:
print >> outg, ';\n'
continue
"""
print >> outg, """
{
$$= new NonTerminal(""", name2id[rule[0]], ");"
nodelist= [ production[0] for production \
in zip(range(1,len(rule[1])+1),rule[1]) \
if production[1][0]=="node"]
for i in range(len(nodelist)):
print >> outg, "\n $$->addChild($%d);"%nodelist[i]
print >> outg, "\n $%d->parent= $$;"%nodelist[i]
if i + 1 < len(nodelist):
print >> outg,\
"\n $%d->nextSibbling= $%d;"%\
(nodelist[i],nodelist[i+1])
if rule[0]=="program":
print >> outg, "root= $$;"
print >> outg, """
}
;
"""
print >> outg, """
%%
"""
footer= open(sys.argv[1]+'.foot','r')
print >> outg, footer.read()
footer.close()
outg.close()
head = open('head.cc','w')
print >> head, """
#include <map>
#include <string>
using namespace std;
extern map<string,int> name2id;
extern map<int,string> id2name;
void id_init()
{
"""
for nt in y.NonTerminals:
id= name2id[nt]
print >> head, 'name2id["%s"]= %d;'%(nt,id)
print >> head, 'id2name[%d]= "%s";'%(id,nt)
for t in y.Terminals:
id= name2id[t]
print >> head, 'name2id["%s"]= %d;'%(t,id)
print >> head, 'id2name[%d]= "%s";'%(id,t)
print >> head, '}'
print >> head
head.close()