Re: Help with Grammar Specification

Chris F Clark <cfc@shell01.TheWorld.com>
Mon, 08 Dec 2008 17:41:09 -0500

          From comp.compilers
Related articles
Help with Grammar Specification brplummer@gmail.com (2008-12-04)
Re: Help with Grammar Specification brplummer@gmail.com (2008-12-04)
Re: Help with Grammar Specification bear@sonic.net (Ray Dillinger) (2008-12-05)
Re: Help with Grammar Specification cfc@shell01.TheWorld.com (Chris F Clark) (2008-12-08)
| List of all articles for this month |
From: Chris F Clark <cfc@shell01.TheWorld.com>
Newsgroups: comp.compilers
Date: Mon, 08 Dec 2008 17:41:09 -0500
Organization: The World Public Access UNIX, Brookline, MA
References: 08-12-013 08-12-023
Keywords: parse
Posted-Date: 08 Dec 2008 18:15:36 EST

On Dec 4, 7:09 pm, brplum...@gmail.com wrote:
>
> What I want is to not require any particular ordering of the parts of
> this production.


what you are looking for is a "permutation grammar". There was some
discussion on this previously. However, most parser generators do not
have built in support for permutation operators. Your variation on
John's suggestion is a valid implementation in that case.


Hope this helps,
-Chris


******************************************************************************
Chris Clark Internet: christopher.f.clark@compiler-resources.com
Compiler Resources, Inc. or: compres@world.std.com
23 Bailey Rd Web Site: http://world.std.com/~compres
Berlin, MA 01503 voice: (508) 435-5016
USA fax: (978) 838-0263 (24 hours)
------------------------------------------------------------------------------


Post a followup to this message

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