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) |
[5 later articles] |
From: | Hans-Peter Diettrich <DrDiettrich1@aol.com> |
Newsgroups: | comp.compilers |
Date: | Mon, 21 Jul 2008 08:31:39 +0200 |
Organization: | Compilers Central |
References: | 08-07-033 08-07-037 |
Keywords: | parse |
Posted-Date: | 21 Jul 2008 07:56:48 EDT |
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.
DoDi
Return to the
comp.compilers page.
Search the
comp.compilers archives again.