Hi,
I am a C programmer wishing to modify some lisp code to do syntax
sensitive editing. I wish to tie in a parser to some lisp editor code.
Is there a text somewhere that describes a way of implementing a parser
given a CFG (Context Free Grammar).
regards,
-Jim.
--
== James Tsillas Bull HN Information Systems Inc. ==
== (508) 294-2937 300 Concord Road 826A ==
== ········@bubba.ma30.bull.com Billerica, MA 01821 ==
== ==
== The opinions expressed above are solely my own and do not reflect ==
== those of my employer. ==
-== no solicitations please ==-
From: Jan Rekers
Subject: Re: Looking for a CFG -> Lisp example.
Date:
Message-ID: <4138@charon.cwi.nl>
In article <······················@sprite.ma30.bull.com>,
········@sprite.ma30.bull.com (James Tsillas) writes:
|> Is there a text somewhere that describes a way of implementing a parser
|> given a CFG (Context Free Grammar).
I have a parser + parser generator (written in LeLisp, quite close to Common
Lisp) that does what you want. I have implemented the Tomita parsing algorithm
and, as that algorithm needs LR parse tables, an LR(0) parse table generator.
The input of the parser generator is a CF grammar. The input of the parser
is a list of tokens (you will presumably need a scanner as well), and its
output is a structure that describes all possibile parses.
In case the grammar is non-ambiguous, this structure is a parse tree.
Let me know whether you are interested.
Jan Rekers (······@cwi.nl) Centrum voor Wiskunde en Informatica (CWI)
P.O. Box 4079, 1009 AB Amsterdam, The Netherlands
Sorry to post this to the whole group but my mail server gave me an
unknown user message when I sent mail to ······@cwi.nl.
I am interested in your parser generator, Jan.
David Kuznick
·····@ait.com
From: Mark Johnson
Subject: Re: Looking for a CFG -> Lisp example.
Date:
Message-ID: <84885@brunix.UUCP>
I posted an LALR(1) parser-generator to this newsgroup a while
ago. If there's any interest, I will repost.
Mark Johnson
··@cs.brown.edu