Re: Recursive-descent parser generator wanted

blia.UUCP!irving@cgl.ucsf.edu (Irving Reid)
Thu, 25 Feb 88 14:16:29 PST

          From comp.compilers
Related articles
Recursive-descent parser generator wanted abakus%uklirb@unido.uucp (AG Hartenstein-UNI KL-FRG) (1988-02-11)
Re: Recursive-descent parser generator wanted blia.UUCP!irving@cgl.ucsf.edu (1988-02-25)
Re: Recursive-descent parser generator wanted harvard!rutgers!cs.rochester.edu!scott@BBN.COM (Michael Scott) (1988-03-15)
| List of all articles for this month |
Date: Thu, 25 Feb 88 14:16:29 PST
From: blia.UUCP!irving@cgl.ucsf.edu (Irving Reid)
Newsgroups: comp.compilers
Summary: Actually, why one might want recursive descent
References: <887@ima.ISC.COM>
Organization: Britton Lee

In article <887@ima.ISC.COM> the moderator remarks:
>[At the risk of much flamage, I'd be interested in comments about why one
>might prefer an R.D. parser generator to an LR one. We've beaten error
>recovery to death, unless someone has something genuinely new. -John]


One of my reasons for choosing R-D parsers is the ease of writing semantics
using full attribute handling. I have some ideas about how a lazy
programming language (like Miranda) might allow inherited attributes in an
LR parser, but until that day I'll stick to R-D for anything that has
relatively tricky semantics (read this as: anything much beyond creating a
parse tree)


  - irving -
[From blia.UUCP!irving@cgl.ucsf.edu (Irving Reid)]
--

Post a followup to this message

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