Related articles |
---|
Want to get started - would like to write a simple interpreter ravenpub@southwind.net (1996-11-01) |
Re: Want to get started - would like to write a simple interpreter adrian@dcs.rhbnc.ac.uk (1996-11-03) |
Re: Want to get started - would like to write a simple interpreter norman@kbss.bt.co.uk (Norman Hilton) (1996-11-05) |
Re: Want to get started - would like to write a simple interpreter ravenpub@southwind.net (1996-11-06) |
Re: Want to get started - would like to write a simple interpreter fburton@nyx10.cs.du.edu (1996-11-10) |
Re: Want to get started - would like to write a simple interpreter john@dwaf-hri.pwv.gov.za (John Carter) (1996-11-19) |
Re: Want to get started - would like to write a simple interpreter kimf@avs.uniras.dk (Kim G. Frei) (1996-11-24) |
Re: Want to get started - would like to write a simple interpreter jlilley@empathy.com (1996-12-01) |
Re: Want to get started - would like to write a simple interpreter ikellenb@iiic.ethz.ch (Ivan Kellenberger) (1996-12-07) |
From: | jlilley@empathy.com (John Lilley) |
Newsgroups: | comp.compilers |
Date: | 1 Dec 1996 22:56:33 -0500 |
Organization: | Empathy Software |
References: | 96-11-049 96-11-117 |
Keywords: | interpreter, design |
>On Fri, 1 Nov 1996, Carl D. Cravens wrote:
> I want to write an interpreter for a very simple language. (A personal
> project that you might find silly if I actually told you what it was
> for.) If I wanted to write just a compiler, I'd buy the dragon book ...
While you're at it, check out PCCTS, which generates LL(k)
recursive-descent parsers. In theory it is not as powerful as LALR(k)
generators, but in practice it *usually* makes up for it with
predicates. Plus, recursive-descent is SOOOO easy to debug. You can
start at http://www.empathy.com/pccts, which will piont you back to
the Parr Research PCCTS page and other places.
john lilley
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.