Abstract
LILA (a Language Implementation Laboratory) is a compiler writing system that promotes the modular design and implementation of compilers. The input of LILA is based on an elaborated form of the so-called attribute grammar [KNUT68]. In the LILA input, attribute handling, semantic actions, declarations of objects (constants, types, variables, procedures and functions) and error recovery information are specified local to each syntax rule. The syntax formalism used in the LILA input is an extention of the context-free syntax, called Extended Context - Free (ECF), allowing recursive as well as iterative definitions.For a further description of LILA and the underlying methodology, we refer to "A Programming Methodology in Compiler Construction" [LEWI79] [LEWI82].This article describes part of the results of a dissertation [CRAE82], made at the Katholieke Universiteit Leuven, in order to obtain a universty degree in informatics ('licentiaat informatica').
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
