LR Parsing of CFGs with restrictions

Simple item page
dc.contributor.authorMcKenzie, B.
dc.date.accessioned2009-11-02T23:14:02Z
dc.date.available2009-11-02T23:14:02Z
dc.date.issued1989en
dc.descriptionTR-COSC 03/89en
dc.description.abstractA method for extending the LR parsing method to enable it to deal with context free grammars containing imbedded restrictions is presented. Such restrictions are usually dealt with in LR based parsers by executing semantic code outside the context of the LR method. By including such restrictions within the LR method itself, potential shift-reduce and reduce-reduce conflicts can be resolved and provide greater control over the language accepted. The proposed method can be easily incorporated into existing LR based parser generating systems.en
dc.identifier.citationMcKenzie, B. (1989) LR Parsing of CFGs with restrictions..en
dc.identifier.urihttp://hdl.handle.net/10092/3066
dc.language.isoen
dc.publisherUniversity of Canterbury. Computer Science and Software Engineeringen
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subjectLR parsingen
dc.subjectsemantic restrictionsen
dc.subjectcompilersen
dc.subject.marsdenFields of Research::280000 Information, Computing and Communication Sciences::280300 Computer Software::280303 Programming languagesen
dc.titleLR Parsing of CFGs with restrictionsen
dc.typeReports
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
12619162_McKenzie.pdf
Size:
108.09 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Reports