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 | -- Abstract:
--
-- See spec
--
-- Copyright (C) 2009-2010, 2012-2015, 2017 - 2023 Stephen Leake
-- Copyright (C) 2000 Ted Dennison
--
-- This file is part of the WisiToken package.
--
-- The WisiToken package 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 3, or
-- (at your option) any later version. The WisiToken package 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 distributed with the WisiToken package;
-- see file GPL.txt. If not, write to the Free Software Foundation,
-- 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
pragma License (GPL);
with Ada.Characters.Latin_1;
with Ada.Text_IO;
with WisiToken.Gen_Token_Enum;
with WisiToken.Generate.LR.LALR_Generate;
with WisiToken.Lexer.Regexp;
with WisiToken.Parse.LR.Parser;
with WisiToken.Productions;
with WisiToken.Syntax_Trees;
with WisiToken.Text_IO_Trace;
with WisiToken.Wisi_Ada; use WisiToken.Wisi_Ada;
package body Trivial_Productions_Test is
----------
-- Test procedures
package Expression is
procedure Test_One (Test : in out AUnit.Test_Cases.Test_Case'Class);
end Expression;
package body Expression is
type Token_Enum_ID is
(
-- Terminals
Symbol_ID, EOI_ID,
-- Nonterminals
E_ID, F_ID, T_ID,
SOI_ID);
package Token_Enum is new WisiToken.Gen_Token_Enum
(Token_Enum_ID => Token_Enum_ID,
First_Terminal => Symbol_ID,
Last_Terminal => EOI_ID,
First_Nonterminal => E_ID,
Last_Nonterminal => T_ID,
SOI_ID => SOI_ID,
EOI_ID => EOI_ID,
Accept_ID => E_ID,
Case_Insensitive => False);
use Token_Enum;
Trace : aliased WisiToken.Text_IO_Trace.Trace;
Log_File : Ada.Text_IO.File_Type;
procedure Test_One (Test : in out AUnit.Test_Cases.Test_Case'Class)
is
pragma Unreferenced (Test);
package Lexer renames WisiToken.Lexer.Regexp;
Syntax : constant Lexer.Syntax := To_Syntax
((EOI_ID => Lexer.Get ("" & Ada.Characters.Latin_1.EOT),
Symbol_ID => Lexer.Get ("symbol")));
Null_Action : WisiToken.Syntax_Trees.Post_Parse_Action renames WisiToken.Syntax_Trees.Null_Action;
Grammar : WisiToken.Productions.Prod_Arrays.Vector :=
E_ID <= T_ID & EOI_ID + Null_Action and
T_ID <= F_ID + Null_Action and
F_ID <= Symbol_ID + Null_Action;
Parser : WisiToken.Parse.LR.Parser.Parser;
Text : constant String := "symbol";
Recursions : WisiToken.Generate.Recursions := WisiToken.Generate.Empty_Recursions;
begin
-- The test is that there are no exceptions raised, either during grammar construction or parsing
WisiToken.Parse.LR.Parser.New_Parser
(Parser,
Lexer.New_Lexer (Trace'Access, LALR_Descriptor'Access, Syntax),
WisiToken.Generate.LR.LALR_Generate.Generate
(Grammar, WisiToken.Precedence_Lists_Arrays.Empty_Vector, LALR_Descriptor,
Grammar_File_Name => "", Error_Recover => False, Recursions => Recursions),
WisiToken.Syntax_Trees.Production_Info_Trees.Empty_Vector,
User_Data => null,
Language_Fixes => null,
Language_Matching_Begin_Tokens => null,
Language_String_ID_Set => null);
Parser.Tree.Lexer.Reset_With_String (Text);
Parser.Parse (Log_File);
end Test_One;
end Expression;
package Subprograms is
procedure Test_One (T : in out AUnit.Test_Cases.Test_Case'Class);
end Subprograms;
package body Subprograms is
-- Hand-written WisiToken grammar matching
-- ../wisi/test/subprograms.wy, to show that wisi-generate
-- produces the same grammar.
type Token_ID is
(Whitespace_ID,
-- Terminals
Function_ID,
Procedure_ID,
Symbol_ID,
Left_Paren_ID,
Right_Paren_ID,
EOI_ID,
-- Nonterminal
WisiToken_Accept_ID,
Declarations_ID,
Declaration_ID,
Subprogram_ID,
Parameter_List_ID,
SOI_ID);
package Token_Enum is new WisiToken.Gen_Token_Enum
(Token_Enum_ID => Token_ID,
First_Terminal => Function_ID,
Last_Terminal => EOI_ID,
First_Nonterminal => WisiToken_Accept_ID,
Last_Nonterminal => Parameter_List_ID,
SOI_ID => SOI_ID,
EOI_ID => EOI_ID,
Accept_ID => WisiToken_Accept_ID,
Case_Insensitive => False);
use Token_Enum;
Trace : aliased WisiToken.Text_IO_Trace.Trace;
Log_File : Ada.Text_IO.File_Type;
procedure Test_One (T : in out AUnit.Test_Cases.Test_Case'Class)
is
pragma Unreferenced (T);
package Lexer renames WisiToken.Lexer.Regexp;
Syntax : constant Lexer.Syntax := To_Syntax
((
Whitespace_ID => Lexer.Get (" ", Report => False),
Function_ID => Lexer.Get ("function"),
Left_Paren_ID => Lexer.Get ("\("),
Procedure_ID => Lexer.Get ("procedure"),
Right_Paren_ID => Lexer.Get ("\)"),
Symbol_ID => Lexer.Get ("symbol"),
EOI_ID => Lexer.Get ("" & Ada.Characters.Latin_1.EOT)
));
Null_Action : WisiToken.Syntax_Trees.Post_Parse_Action renames WisiToken.Syntax_Trees.Null_Action;
Grammar : WisiToken.Productions.Prod_Arrays.Vector :=
WisiToken_Accept_ID <= Declarations_ID & EOI_ID + Null_Action and
(Declarations_ID <= Declaration_ID + Null_Action or
Declarations_ID & Declaration_ID + Null_Action) and
Declaration_ID <= Subprogram_ID + Null_Action and
Subprogram_ID <= Function_ID & Parameter_List_ID & Symbol_ID + Null_Action and
Subprogram_ID <= Procedure_ID & Parameter_List_ID + Null_Action and
(Parameter_List_ID <= +Null_Action or
Left_Paren_ID & Symbol_ID & Right_Paren_ID + Null_Action);
Parser : WisiToken.Parse.LR.Parser.Parser;
Text : constant String := "function (symbol) symbol procedure";
Recursions : WisiToken.Generate.Recursions := WisiToken.Generate.Empty_Recursions;
begin
-- The test is that there are no exceptions raised, either during grammar construction or parsing
WisiToken.Parse.LR.Parser.New_Parser
(Parser,
Lexer.New_Lexer (Trace'Access, LALR_Descriptor'Access, Syntax),
WisiToken.Generate.LR.LALR_Generate.Generate
(Grammar, WisiToken.Precedence_Lists_Arrays.Empty_Vector, LALR_Descriptor,
Grammar_File_Name => "", Error_Recover => False, Recursions => Recursions),
WisiToken.Syntax_Trees.Production_Info_Trees.Empty_Vector,
User_Data => null,
Language_Fixes => null,
Language_Matching_Begin_Tokens => null,
Language_String_ID_Set => null);
Parser.Tree.Lexer.Reset_With_String (Text);
Parser.Parse (Log_File);
end Test_One;
end Subprograms;
----------
-- Public subprograms
overriding procedure Register_Tests (T : in out Test_Case)
is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Expression.Test_One'Access, "Expression");
Register_Routine (T, Subprograms.Test_One'Access, "Subprograms");
end Register_Tests;
overriding function Name (T : Test_Case) return AUnit.Message_String
is
pragma Unreferenced (T);
begin
return new String'("trivial_productions_test.adb");
end Name;
end Trivial_Productions_Test;
|