Re: Q1. reducing grammar redundancy

SM Ryan <wyrmwif@tsoft.org>
28 Feb 2005 00:45:09 -0500

          From comp.compilers

Related articles
Q1. reducing grammar redundancy spam@abelectron.com (valentin tihomirov) (2005-02-20)
Re: Q1. reducing grammar redundancy wyrmwif@tsoft.org (SM Ryan) (2005-02-28)
RE: Q1. reducing grammar redundancy ralfla@microsoft.com (Ralf Lammel) (2005-02-28)
Re: Q1. reducing grammar redundancy vidar@hokstad.name (Vidar Hokstad) (2005-02-28)
Re: Q1. reducing grammar redundancy branco.medeiros@gmail.com (2005-02-28)
Re: Q1. reducing grammar redundancy spam@abelectron.com (valentin tihomirov) (2005-02-28)
| List of all articles for this month |

From: SM Ryan <wyrmwif@tsoft.org>
Newsgroups: comp.compilers
Date: 28 Feb 2005 00:45:09 -0500
Organization: Quick STOP Groceries
References: 05-02-086
Keywords: parse

# Is there a known technique to define a basic "element" rule and derive all
# the remaining rules by tuning this one? I mean, the endless parenthesis and
# enforcing the tag name presence.


Use two level grammars.


(Anyone want to subsidise my work on this?)


--
SM Ryan http://www.rawbw.com/~wyrmwif/


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.