AN INCREMENTAL LL(1) PARSING ALGORITHM

doi:10.1016/0020-0190(93)90179-D

Full metadata record

DC Field	Value	Language
dc.contributor.author	YANG, W	en_US
dc.date.accessioned	2014-12-08T15:04:17Z	-
dc.date.available	2014-12-08T15:04:17Z	-
dc.date.issued	1993-11-08	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/0020-0190(93)90179-D	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2789	-
dc.description.abstract	Given a parse tree for a sentence xzy and a string zBAR, an incremental parser builds the parse tree for the sentence xzyBAR by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.	en_US
dc.language.iso	en_US	en_US
dc.subject	DESIGN OF ALGORITHMS	en_US
dc.subject	INCREMENTAL PARSING	en_US
dc.subject	LANGUAGE-BASED EDITOR	en_US
dc.subject	LANGUAGE PROCESSORS	en_US
dc.subject	PARSING	en_US
dc.title	AN INCREMENTAL LL(1) PARSING ALGORITHM	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/0020-0190(93)90179-D	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	48	en_US
dc.citation.issue	2	en_US
dc.citation.spage	67	en_US
dc.citation.epage	72	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1993MH81800003	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

A1993MH81800003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.