Parsing Key Word Grammars

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5865

Full metadata record

DC Field	Value	Language
dc.creator	Martin, William	-
dc.date	2004-10-01T20:50:10Z	-
dc.date	2004-10-01T20:50:10Z	-
dc.date	1969-03-01	-
dc.date.accessioned	2013-10-09T02:41:40Z	-
dc.date.available	2013-10-09T02:41:40Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-184	-
dc.identifier	http://hdl.handle.net/1721.1/5865	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Key word grammars are defined to be the same as context free grammars, except that a production may specify a string of arbitrary symbols. These grammars define languages similar to those used in the programs CARPS and ELIZA. We show a method of implementing the LR9k) parsing algorithm for context free grammars which can be modified slightly in order to parse key word grammars. When this is done algorithm can use many of the techniques used in ELIZA parse. Therefore, the algorithm helps to show the relation between the classical parsers and key word parsers.	-
dc.format	15 p.	-
dc.format	5622471 bytes	-
dc.format	386528 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-184	-
dc.title	Parsing Key Word Grammars	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI