1 # Exercising Bison Grammar Reduction. -*- Autotest -*-
2 # Copyright 2001 Free Software Foundation, Inc.
4 # This program is free software; you can redistribute it and/or modify
5 # it under the terms of the GNU General Public License as published by
6 # the Free Software Foundation; either version 2, or (at your option)
9 # This program is distributed in the hope that it will be useful,
10 # but WITHOUT ANY WARRANTY; without even the implied warranty of
11 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 # GNU General Public License for more details.
14 # You should have received a copy of the GNU General Public License
15 # along with this program; if not, write to the Free Software
16 # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
19 AT_BANNER([[Grammar Reduction.]])
22 ## ------------------- ##
23 ## Useless Terminals. ##
24 ## ------------------- ##
26 AT_SETUP([Useless Terminals])
47 AT_CHECK([[bison input.y]])
49 AT_CHECK([[sed -n '/^Grammar/q;/^$/!p' input.output]], 0,
50 [[Terminals which are not used:
66 ## ---------------------- ##
67 ## Useless Nonterminals. ##
68 ## ---------------------- ##
70 AT_SETUP([Useless Nonterminals])
91 AT_CHECK([[bison input.y]], 0, [],
92 [[input.y contains 9 useless nonterminals
95 AT_CHECK([[sed -n '/^Grammar/q;/^$/!p' input.output]], 0,
96 [[Useless nonterminals:
112 ## --------------- ##
114 ## --------------- ##
116 AT_SETUP([Useless Rules])
135 AT_CHECK([[bison input.y]], 0, [],
136 [[input.y contains 9 useless nonterminals and 9 useless rules
139 AT_CHECK([[sed -n '/^Grammar/q;/^$/!p' input.output]], 0,
140 [[Useless nonterminals:
150 Terminals which are not used:
176 ## ------------------- ##
177 ## Reduced Automaton. ##
178 ## ------------------- ##
180 # Check that the automaton is that as the for the grammar reduced by
183 AT_SETUP([Reduced Automaton])
185 # The non reduced grammar.
186 # ------------------------
187 AT_DATA([[not-reduced.y]],
188 [[/* A useless token. */
193 %output="not-reduced.c"
197 exp: useful { /* A useful action. */ }
198 | non_productive { /* A non productive action. */ }
201 not_reachable: useful { /* A not reachable action. */ }
204 non_productive: non_productive useless_token
205 { /* Another non productive action. */ }
209 AT_CHECK([[bison not-reduced.y]], 0, [],
210 [[not-reduced.y contains 2 useless nonterminals and 3 useless rules
213 AT_CHECK([[sed -n '/^Grammar/q;/^$/!p' not-reduced.output]], 0,
214 [[Useless nonterminals:
217 Terminals which are not used:
220 #2 exp: non_productive;
221 #3 not_reachable: useful;
222 #4 non_productive: non_productive useless_token;
225 # The reduced grammar.
226 # --------------------
227 AT_DATA([[reduced.y]],
228 [[/* A useless token. */
237 exp: useful { /* A useful action. */ }
238 // | non_productive { /* A non productive action. */ } */
241 //not_reachable: useful { /* A not reachable action. */ }
244 //non_productive: non_productive useless_token
245 // { /* Another non productive action. */ }
249 AT_CHECK([[bison reduced.y]])
251 # Comparing the parsers.
253 AT_CHECK([sed 's/not-reduced/reduced/g' not-reduced.c], 0, [expout])
259 ## ------------------- ##
260 ## Underivable Rules. ##
261 ## ------------------- ##
263 AT_SETUP([Underivable Rules])
270 exp: useful | underivable;
271 underivable: indirection;
272 indirection: underivable;
275 AT_CHECK([[bison input.y]], 0, [],
276 [[input.y contains 2 useless nonterminals and 3 useless rules
279 AT_CHECK([[sed -n '/^Grammar/q;/^$/!p' input.output]], 0,
280 [[Useless nonterminals:
285 #3 underivable: indirection;
286 #4 indirection: underivable;