Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site sjuvax.UUCP
Path: utzoo!watmath!clyde!akgua!psuvax!burdvax!sjuvax!bbanerje
From: bbanerje@sjuvax.UUCP (B. Banerjee)
Newsgroups: net.micro.apple
Subject: Re: C compiler
Message-ID: <288@sjuvax.UUCP>
Date: Mon, 7-May-84 01:46:09 EDT
Article-I.D.: sjuvax.288
Posted: Mon May  7 01:46:09 1984
Date-Received: Wed, 9-May-84 02:46:59 EDT
References: <1207@sdccs7.UUCP>
Organization: Saint Josephs Univ. Phila., Pa.
Lines: 24


>> Also, does anyone know of any parsing techniques suitable for
>> micro-computer implementation besides recursive descent, and operator
>> precedence. 
>> 
>> 					Nick Flor

Why anyone would use recursive descent is beyond me.  Try an LL(1)
predictive parser.  You might want to keep the operator precedence
grammar for expressions.  This is just as powerful as the recursive
descent parser (recognises the same grammar(s) ) but avoids recursive
overhead.

This brings me to... has anyone written a parser generator for LL(1)
grammars, sort of like YACC?  I'm planning to do it myself when I find
the time, but would be overjoyed if someone had beaten me to it
(and was willing to make it available).

Regards,
-- 


				Binayak Banerjee
		{allegra | astrovax | bpa | burdvax}!sjuvax!bbanerje