By Topic

YooccLa: a parser generator for L-attributed grammars

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Butler, G. ; Sch. of Comput. Sci., Monash Univ., Clayton, Vic., Australia ; Mingins, C.

Argues that a parser generator can be developed that: (1) can bring parser technology within the reach of more software engineers, (2) requires less knowledge of parser technology than most existing parser generators, and (3) can allow a parser to be used where a designer might otherwise have chosen a fully procedural solution. A parser generator, called YooccLa (Yes! An Object-Oriented Compiler Compiler with left-attributes), has been developed to achieve these goals. It reads a non-left-recursive LL grammar specified in an EBNF-like language, augmented with Eiffel features specifying semantic actions. For each grammar production, YooccLa 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

Published in:

Technology of Object-Oriented Languages and Systems, 2000. TOOLS-Pacific 2000. Proceedings. 37th International Conference on

Date of Conference: