Optimization of directly executable LR parsers

Simple item page
dc.contributor.authorWhitney, Michael Jamesen_US
dc.date.accessioned2024-08-15T20:15:23Z
dc.date.available2024-08-15T20:15:23Z
dc.date.copyright1988en_US
dc.date.issued1988
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractDirectly-executable parsers enable compilers and other parse-intensive applications to run significantly faster than those which use table-driven parsers. The cost for increased speed is a larger parser. It is possible to further increase parsing speed by applying various optimization algorithms at parser generation time. Some existing optimizations used with table-driven parsers are applicable, while others apply only to directly-executable parsers. It is also possible to reduce the size of hard-coded parsers substantially. Several optimization algorithms for directly-executable LR parsers are presented. They are designed to be implementable at the parser construction phase, within an LR parser generator. The algorithms are "adaptive" in the sense that the complexity of each part of the generated parsing automaton reflects the complexity of the grammatical construct to be parsed, independently of the rest of the parser.
dc.format.extent105 pages
dc.identifier.urihttps://hdl.handle.net/1828/20098
dc.rightsAvailable to the World Wide Weben_US
dc.titleOptimization of directly executable LR parsersen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
WHITNEY_MICHAEL_James_MSc_1988_500947.pdf
Size:
2.9 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.