home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!cs.utexas.edu!sun-barr!ames!agate!peoplesparc.Berkeley.EDU!fateman
- From: fateman@peoplesparc.Berkeley.EDU (Richard Fateman)
- Newsgroups: comp.lang.lisp
- Subject: Re: Lisp Parsers
- Date: 5 Jan 1993 16:41:30 GMT
- Organization: University of California, Berkeley
- Lines: 23
- Message-ID: <1icdnqINN68m@agate.berkeley.edu>
- References: <11586@uqcspe.cs.uq.oz.au> <WELCH.93Jan5112512@sacral.cis.ohio-state.edu>
- NNTP-Posting-Host: peoplesparc.berkeley.edu
-
- CGOL, a language that looks Algolish but is translated into Lisp
- for its semantics, was developed by Vaughn Pratt, some years ago.
- It was initially implemented for Maclisp, but was also useful in
- Franz Lisp. I have just recently gotten (for a term project) a
- translation of CGOL into Common Lisp. The semantics of CL are
- in a variety of ways more complicated than Maclisp, and there are
- some Maclisp features (e.g. LEXPR, FEXPR, ...) that have disappeared.
-
- If anyone is sufficiently interested in seeing this translation
- to try it out (it was developed on Allegro CL), send me a note.
-
- My intention is to post the relevant documents and code at some
- ftp site, after I look at it and try it out more, myself.
-
- The extensible "top-down operator precedence" parsing scheme
- devised by Pratt is quite useful, and highly extensible. The
- Macsyma computer algebra language uses a Pratt-like parser, and
- I suspect that several other systems do, as well.
-
-
- --
- Richard J. Fateman
- fateman@cs.berkeley.edu 510 642-1879
-