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.
Sager, Thomas J.
Metzner, John R.
Dawson, Darrow Finch, 1931-2007
M.S. in Computer Science
University of Missouri--Rolla
viii, 140 pages
Note about bibliography
Includes bibliographical references (pages 54-55).
© 1987 Timothy Topper Taylor, All rights reserved.
Thesis - Open Access
Print OCLC #
Link to Catalog Record
Taylor, Timothy Topper, "Lily: A parser generator for LL(1) languages" (1987). Masters Theses. 507.