YooccLa: a parser generator for L-attributed grammars

This paper argues that a parser generator can be developed that requires less knowledge of parser technology than most existing parser generators;that can bring parser technology within the reach of more software engineers;and that can allow a parser to be used where a designer might otherwise have chosen a fully procedural solution. A parser generator, YooccLa, has been developed to achieve these goals. It reads a non-left-recursive LL grammar specified in an EBNFlike language, augmented with Eiffel features specifying semantic actions. For each grammar production YoocLa produces a pair of classes for the Eiffel Parse library: a syntax class specifying the syntax to Eiffel Parse, and a construct class specifying the semantics.