Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| State of the Art peter.deussen@fokus.fraunhofer.de (Peter) (2008-07-18) |
| Re: State of the Art jaluber@gmail.com (Johannes) (2008-07-20) |
| Re: State of the Art DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-07-21) |
| Re: State of the Art peter.deussen@fokus.fraunhofer.de (Peter) (2008-07-21) |
| Re: State of the Art parrt@cs.usfca.edu (Terence Parr) (2008-07-21) |
| Re: State of the Art ademakov@gmail.com (Aleksey Demakov) (2008-07-23) |
| Re: State of the Art cfc@shell01.TheWorld.com (Chris F Clark) (2008-07-22) |
| Re: State of the Art torbenm@pc-003.diku.dk (2008-07-23) |
| Re: State of the Art ang.usenet@gmail.com (Aaron Gray) (2008-07-24) |
| Re: State of the Art dot@dotat.at (Tony Finch) (2008-07-25) |
| Re: State of the Art johnhull2008@gmail.com (johnhull2008) (2008-07-28) |
| Re: State of the Art kamalpr@hp.com (kamal) (2008-07-28) |
| Re: State of the Art lucky@htsoft.com (Matt Luckman) (2008-07-29) |
| [1 later articles] |
| From: | Chris F Clark <cfc@shell01.TheWorld.com> |
| Newsgroups: | comp.compilers |
| Date: | Tue, 22 Jul 2008 14:11:13 -0400 |
| Organization: | The World Public Access UNIX, Brookline, MA |
| References: | 08-07-033 08-07-037 08-07-039 |
| Keywords: | practice |
| Posted-Date: | 25 Jul 2008 07:47:18 EDT |
Hans-Peter Diettrich <DrDiettrich1@aol.com> writes:
> Johannes schrieb:
>
>> From my limited experience I'd say that one advancement is the LL(*)
>> algorithm which allows arbitrary scan ahead of tokens (compared to
>> e.g. LL(5) which allows only to check the next 5).
>
> I'd prefer PEG, which also establishes a defined order for ambiguous cases.
The most recent versions for ANTLR can use the PEG ordering for
ambiguous cases if I read the documentation correctly. This should
give the best of both worlds, warnings when you have an ambiguous (or
atleast a non-LL) grammar, and well-defined PEG rules for resolving
those ambiguities, so that you can still write grammars for those
cases.
In either case, the PEG work builds on Terence's LL(k) and predicated
grammar work, so those have to be considered fundamental to it. One
can argue that there would be no PEG grammars if we hadn't had
predicated LL(k) grammars first.
Just my opinions,
-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)
Return to the
comp.compilers page.
Search the
comp.compilers archives again.