Re: compiler with non-deterministic grammar

Sandeep Dutta <Sandeep.dutta@mpct.com>
15 May 1997 00:00:39 -0400

          From comp.compilers
Related articles
compiler with non-deterministic grammar wlai@mail.utexas.edu (Wei-cheng Lai) (1997-05-03)
Re: compiler with non-deterministic grammar thetick@scruz.net (Scott Stanchfield) (1997-05-08)
Re: compiler with non-deterministic grammar eserra@svmp01.Harris.COM (Efren Serra) (1997-05-13)
Re: compiler with non-deterministic grammar Sandeep.dutta@mpct.com (Sandeep Dutta) (1997-05-15)
Re: compiler with non-deterministic grammar adrian@dcs.rhbnc.ac.uk (1997-05-17)
| List of all articles for this month |
From: Sandeep Dutta <Sandeep.dutta@mpct.com>
Newsgroups: comp.compilers
Date: 15 May 1997 00:00:39 -0400
Organization: Internet Systems Corporation
References: 97-05-014
Keywords: parse

Try PRECCX - the infinite look-ahead compiler compiler .. for this
compiler compiler the grammar needs to be specified in a Prologue like
language (ie goal-proving) the parser generated by this compiler
compiler will try to prove all possible paths (ideal for context
sensitive grammar)


Sandeep


Wei-cheng Lai wrote:
> Does anybody know how to construct a compiler with
> non-deterministic grammar?


--

Post a followup to this message

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