This topic of this thesis is parallel parsing using context-free grammars and attribute grammars. The first parts concentrates on slow and fast parallelism of the parsing and recognition process using double dotted items. The second part describe the maximum derivation length of acyclic grammars, the decoration of parses, and a raking algorithm on binary DAGs.Electrical Engineering, Mathematics and Computer Scienc
No full text
