TY  - RPRT
T1  - A graph based parsing algorithm for context-free languages
T3  - Saarbrücken, 1999
A1  - Hotz,Günter
Y1  - 2011/09/07
N2  - 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.

CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4209
ER  -