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
|
/*
* Copyright 2006-2012 Adrian Thurston <thurston@complang.org>
*/
/* This file is part of Colm.
*
* Colm is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Colm 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Colm; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "global.h"
#include "parsedata.h"
using namespace std;
void Compiler::writeTransList( PdaState *state )
{
ostream &out = *outStream;
for ( TransMap::Iter trans = state->transMap; trans.lte(); trans++ ) {
/* Write out the from and to states. */
out << "\t" << state->stateNum << " -> " << trans->value->toState->stateNum;
/* Begin the label. */
out << " [ label = \"";
long key = trans->key;
LangEl *lel = langElIndex[key];
if ( lel != 0 )
out << lel->name;
else
out << (char)key;
if ( trans->value->actions.length() > 0 ) {
out << " / ";
for ( ActDataList::Iter act = trans->value->actions; act.lte(); act++ ) {
switch ( *act & 0x3 ) {
case 1:
out << "S(" << trans->value->actOrds[act.pos()] << ")";
break;
case 2: {
out << "R(" << prodIdIndex[(*act >> 2)]->data <<
", " << trans->value->actOrds[act.pos()] << ")";
break;
}
case 3: {
out << "SR(" << prodIdIndex[(*act >> 2)]->data <<
", " << trans->value->actOrds[act.pos()] << ")";
break;
}}
if ( ! act.last() )
out << ", ";
}
}
out << "\" ];\n";
}
}
void Compiler::writeDotFile( PdaGraph *graph )
{
ostream &out = *outStream;
out <<
"digraph " << parserName << " {\n"
" rankdir=LR;\n"
" ranksep=\"0\"\n"
" nodesep=\"0.25\"\n"
"\n";
/* Define the psuedo states. Transitions will be done after the states
* have been defined as either final or not final. */
out <<
" node [ shape = point ];\n";
for ( int i = 0; i < graph->entryStateSet.length(); i++ )
out << "\tENTRY" << i << " [ label = \"\" ];\n";
out <<
"\n"
" node [ shape = circle, fixedsize = true, height = 0.6 ];\n";
/* Walk the states. */
for ( PdaStateList::Iter st = graph->stateList; st.lte(); st++ )
out << " " << st->stateNum << " [ label = \"" << st->stateNum << "\" ];\n";
out << "\n";
/* Walk the states. */
for ( PdaStateList::Iter st = graph->stateList; st.lte(); st++ )
writeTransList( st );
/* Start state and other entry points. */
for ( PdaStateSet::Iter st = graph->entryStateSet; st.lte(); st++ )
out << "\tENTRY" << st.pos() << " -> " << (*st)->stateNum << " [ label = \"\" ];\n";
out <<
"}\n";
}
void Compiler::writeDotFile()
{
writeDotFile( pdaGraph );
}
|
