Show simple item record

dc.contributor.authorFischer, Charles N.en_US
dc.date.accessioned2007-04-23T17:58:57Z
dc.date.available2007-04-23T17:58:57Z
dc.date.issued1975-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR75-237en_US
dc.identifier.urihttps://hdl.handle.net/1813/7121
dc.description.abstractNon-canonical generalization of several bottom-up parsing methods, including Simple Precedence, LR(k), SLR(k), and LALR(k) are considered. It is seen that these methods can readily be made to generate many concurrent reductions and thus can be used to advantage in parallel environments. it is suggested that such methods could be used to produce practical parsers for such parallel computers as the CDC Star-100. Further, the grammar classes defined by these parallel methods are studied and compared with the grammar classes defined by a number of serial parsing techniques.en_US
dc.format.extent7216712 bytes
dc.format.extent2706285 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn Parsing Context Free Languages in Parallel Environmentsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics