Lily: A parser generator for LL(1) languages

This paper discusses the design and implementation of Lily, a language for generating LL(1) language parsers, originally designed by Dr. Thomas J. Sager of the University of Missouri--Rolla. A method for the automatic generation of parser tables is described which creates small, highly optimized tables, suitable for conversion to minimal perfect hash functions. An implementation of Lily is discussed with attention to design goals, implementation of parser table generation, and table optimization techniques. Proposals are made detailing possibilities for further augmentation of the system. Examples of Lily programs are given as well as a manual for the system

Technology 2003: The Fourth National Technology Transfer Conference and Exposition, volume 2

Proceedings from symposia of the Technology 2003 Conference and Exposition, Dec. 7-9, 1993, Anaheim, CA, are presented. Volume 2 features papers on artificial intelligence, CAD&E, computer hardware, computer software, information management, photonics, robotics, test and measurement, video and imaging, and virtual reality/simulation

Preliminary proceedings of the 2001 ACM SIGPLAN Haskell workshop

This volume contains the preliminary proceedings of the 2001 ACM SIGPLAN Haskell Workshop, which was held on 2nd September 2001 in Firenze, Italy. The final proceedings will published by Elsevier Science as an issue of Electronic Notes in Theoretical Computer Science (Volume 59). The HaskellWorkshop was sponsored by ACM SIGPLAN and formed part of the PLI 2001 colloquium on Principles, Logics, and Implementations of high-level programming languages, which comprised the ICFP/PPDP conferences and associated workshops. Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), and Montr´eal (2000). The purpose of the Haskell Workshop was to discuss experience with Haskell, and possible future developments for the language. The scope of the workshop included all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Submissions that discussed limitations of Haskell at present and/or proposed new ideas for future versions of Haskell were particularly encouraged. Adopting an idea from ICFP 2000, the workshop also solicited two special classes of submissions, application letters and functional pearls, described below

An OPTRAN-generated front-end for Ada

Ada is a high-level imperative programming language with complex static semantics. In this paper we present a compiler front-end that translates Ada programs into DIANA trees - a standard intermediate form for Ada. In order to avoid the difficulties that arise from the ambiguous Ada syntax we designed a transformation system that maps the initial program tree into a more specific one. Semantic checks like overload resolution, type checking etc. are then performed on that tree. The OPTRAN system developed at the Universitaet des Saarlandes was used to specify and implement the Ada front-end. Both the analysis of static semantics and the transformation of the initial program tree are described using the OPTRAN language which combines attributed tree grammars with sets of so-called transformation rules. The Ada project was a test case for the OPTRAN generator. In this paper we give a detailed view on the Ada front-end and summarize the experience gained in specifying and implementing it