grimlok@hubcap.clemson.edu (Mike Percy) (01/19/90)
I am looking for source to a recursive-descent parser generator. These use an extended LL(1) grammar to build a tree, and from the tree generate a parser (I'd rather not use YACC, for various reasons, but mainly this is for non-UNIX environment). One that lets you mark where sematics are to be inserted would be nice, but I will take what I can get. I understand that the LILA system (Lewi, DeVlaminck, Heuns, and Huybrecht) has such a mechanism {this from a compiler text}. Thanks. -- 'I just couldn't convince the voters that Dukakis was Greek for "Bubba".' -- Lloyd Benson explaining why the Democrats didn't carry Texas