Re: State of the Art

Peter <peter.deussen@fokus.fraunhofer.de>
Mon, 21 Jul 2008 05:46:32 -0700 (PDT)

          From comp.compilers
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 quinn_jackson2004@yahoo.ca (Quinn Tyler Jackson) (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]
| List of all articles for this month |
From: Peter <peter.deussen@fokus.fraunhofer.de>
Newsgroups: comp.compilers
Date: Mon, 21 Jul 2008 05:46:32 -0700 (PDT)
Organization: Compilers Central
References: 08-07-033 08-07-037 08-07-039
Keywords: practice, parse
Posted-Date: 21 Jul 2008 11:24:36 EDT

On 21 Jul., 08:31, Hans-Peter Diettrich <DrDiettri...@aol.com> wrote:
> 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


Hi all,


thanks for the answers so far. To keep track, here's a nice list of
compiler generator tools: http://en.wikipedia.org/wiki/Comparison_of_parser_generators.


PEG is classified as a "recursive decent" parser generator. A quick
scan of the reference http://pdos.csail.mit.edu/~baford/packrat/popl04/
has given me the info that this type of parsers is capable of
accepting non-contextfree languages.


Cheers, Peter


Post a followup to this message

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