Re: [Query] Tree-based parsing?

Scott Stanchfield <scotts@metaware.com>
8 May 1997 21:25:01 -0400

          From comp.compilers
Related articles
[Query] Tree-based parsing? jlilley@empathy.com (John Lilley) (1997-04-16)
Re: [Query] Tree-based parsing? fjh@mundook.cs.mu.OZ.AU (1997-04-18)
Re: [Query] Tree-based parsing? bear@sonic.net (Ray Dillinger) (1997-04-22)
Re: [Query] Tree-based parsing? geert@sun3.iaf.nl (1997-05-04)
Re: [Query] Tree-based parsing? nkramer@cs.cmu.edu (Nick Kramer) (1997-05-04)
Re: [Query] Tree-based parsing? scotts@metaware.com (Scott Stanchfield) (1997-05-08)
Re: [Query] Tree-based parsing? scotts@metaware.com (Scott Stanchfield) (1997-05-08)
Re: [Query] Tree-based parsing? wilson@cs.utexas.edu (1997-05-08)
| List of all articles for this month |
From: Scott Stanchfield <scotts@metaware.com>
Newsgroups: comp.compilers
Date: 8 May 1997 21:25:01 -0400
Organization: MetaWare Incorporated
References: 97-04-096 97-04-150 97-05-033
Keywords: parse, Ada

Geert Bosch wrote:
> John Liley should have a look at the parser of GNAT, which parses
> the Ada95 language in a top-down fashion. I know this is quite
> different from the Yacc bottom-up method, but it might give a
> refreshing view at parsing.


FYI -- John Lilley is currently working on PCCTS 2.0 with Terence Parr.
(PCCTS is an LL(k) recursive-descent parser generator.) Methinks he's a
bit familiar with top-down parsing...


(For general info -- John's got a C++ grammar for PCCTS 1.33 at his
site, http://www.empathy.com.)


> Of course you should consider that the GNAT parser has been
> generated by one of the finest parser-generators that exist
> at this moment.


Which one?


-- Scott


--
Scott Stanchfield
MetaWare Incorporated
Santa Cruz, CA
--

Post a followup to this message

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