Re: yacc/bison Producing LISP

Article View: comp.lang.clos

Article #200

#200

From: Jeff Dalton
Date: Fri, 28 Aug 1992 16:27

4 lines
637 bytes

I know this is a somewhat heretical suggestion, but for most
reasonable languages, it's pretty easy to write recursive-descent
parsers "by hand".  (It's also not too hard to write some macros
that do most of the work for you.)

Technical Details

Message-ID: <23008.9208281627@subnode.aiai.ed.ac.uk>

Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!aiai.edinburgh.ac.uk!jeff

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.clos
Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!aiai.edinburgh.ac.uk!jeff
From: jeff@aiai.edinburgh.ac.uk (Jeff Dalton)
Subject: Re: yacc/bison Producing LISP
Message-ID: <23008.9208281627@subnode.aiai.ed.ac.uk>
Sender: daemon@cis.ohio-state.edu
Organization: The Ohio State University Department of Computer and Information Science
Date: Fri, 28 Aug 1992 16:27:40 GMT
Lines: 5