Faster Tomita parsing

Simple item page
dc.contributor.authorAycock, John Danielen_US
dc.date.accessioned2024-08-12T19:31:20Z
dc.date.available2024-08-12T19:31:20Z
dc.date.copyright1998en_US
dc.date.issued1998
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractTomita's parsing method, or generalized LR parsing, was designed to parse ambiguous grammars efficiently. Tomita uses specific linear-time LR parsing techniques as long as possible, falling back on more expensive general techniques when necessary. Much research has addressed speeding up LR parsers, in this thesis, we argue that this previous work is not transferable to Tomita parsers. To speed up LR parsers, we reduce LR parsing overhead two ways: grammar transformations unroll recursion, and larger finite automata in the parser trade space for time. We have devised a variant of Tomita's algorithm which incorporates our low­ overhead LR parsers. Our timings show that our Tomita variant gives an order of magnitude improvement for the worst case ambiguous grammar on most inputs, several orders of magnitude improvement are seen on larger grammars.
dc.format.extent85 pages
dc.identifier.urihttps://hdl.handle.net/1828/17005
dc.rightsAvailable to the World Wide Weben_US
dc.titleFaster Tomita parsingen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
AYCOCK_John_Daniel_MSc_1998_936671.pdf
Size:
6.81 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.