Re: predicate parsing

mauney@csljon.csl.ncsu.edu (Jon Mauney)
Tue, 27 Apr 1993 03:43:47 GMT

          From comp.compilers
Related articles
predicate parsing tamches@wam.umd.edu (Ariel Meir Tamches) (1993-04-21)
Re: predicate parsing dave@cs.arizona.edu (1993-04-22)
predicate parsing bevan@computer-science.manchester.ac.uk (Stephen J Bevan) (1993-04-22)
Re: predicate parsing isckbk@nuscc.nus.sg (1993-04-23)
Re: predicate parsing simonh@swidev.demon.co.uk (1993-04-23)
Re: predicate parsing mauney@csljon.csl.ncsu.edu (1993-04-27)
Re: predicate parsing isckbk@nuscc.nus.sg (1993-04-28)
predicate parsing tfj@apusapus.demon.co.uk (Trevor Jenkins) (1993-04-28)
Re: predicate parsing mauney@csljon.csl.ncsu.edu (1993-04-29)
Re: predicate parsing andrewd@winnie.cs.adelaide.edu.au (1993-04-29)
Re: predicate parsing jourdan@minos.inria.fr (1993-04-30)
| List of all articles for this month |
Newsgroups: comp.compilers
From: mauney@csljon.csl.ncsu.edu (Jon Mauney)
Keywords: parse
Organization: NCSU
References: 93-04-077 93-04-099
Date: Tue, 27 Apr 1993 03:43:47 GMT

simonh@swidev.demon.co.uk (Simon Huntington) writes:
>I'd have liked to use LL since it is much easier to understand but seemed
>to run into so many problems. Firstly, I wanted it to be as fast as
>possible. I can write the parser driver in assembler to read the tables.
>Second, I needed error repair. LL parsers seem to have a hard-time
>repairing errors. Thirdly, I couldn't parse-out those lovely ambiguities
>in C++ :-).


Can't let this go by without comment.
A) LL parsers can be as fast as anything else.
2) LL Parsers are to be *preferred* when repair is an issue.
    The simple structure of the data on the stacks makes life
    much easier.


I'm not going to stick my neck out on III, however.
--
Jon Mauney mauney@csc.ncsu.edu
Mauney Computer Consulting (919)828-8053
--

Post a followup to this message

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