Skip to main content
Article thumbnail
Location of Repository

A graph based parsing algorithm for context-free languages

By Günter Hotz


We present a simple algorithm deciding the word problem of c. f. languages in O(n^{3}). It decides this problem in time O(n^{2}) for unambiguous grammars and in time O(n) in the case of LR(k) grammars

Topics: Data processing Computer science
Publisher: Fakultät 6 - Naturwissenschaftlich-Technische Fakultät I. Fachrichtung 6.2 - Informatik
Year: 1999
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.