home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!munnari.oz.au!bunyip.cc.uq.oz.au!uqcspe!cs.uq.oz.au!berglas
- From: berglas@cs.uq.oz.au (Anthony Berglas)
- Newsgroups: comp.lang.lisp
- Subject: Lisp Parsers
- Message-ID: <11586@uqcspe.cs.uq.oz.au>
- Date: 5 Jan 93 07:18:15 GMT
- Sender: news@cs.uq.oz.au
- Reply-To: berglas@cs.uq.oz.au
- Lines: 20
-
- I am trying to introduce Lisp to the UQ CS Dept, in which everybody
- knows that real men use C++. I will put on a demo of Garnet etc. shortly
- but most important decisions are made on first impressions, and the
- first impressions are the (())()()s. God said that f(a, b); is easier
- to read than (f a b), it requires less characters.
-
- Seriously, (> (+ x 1) (* y 2)) is ugly, and it would be pretty easy
- to add a parser to Lisp that could be used instead of the normal Reader.
- (At least for demonstration purposes). Such a parser would idealy be
- table driven and dynamically extendible -- new macro, new grammar rule.
-
- If anyone has heard of such a thing I would be interested to know.
-
- Thanks,
-
-
- --
- Anthony Berglas
- Rm 503, Computer Science, Uni of Qld
- Ph 07 365 2812, Australia.
-