Andrew R. Haas
Abstract
The parsing problem for arbitrary unification grammars is unsolvable We present a class of unification grammars for whcih the parsing problem is solvable and a parallel parsing algorithm for this class of grammars.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The parsing problem for arbitrary unification grammars is unsolvable We present a class of unification grammars for whcih the parsing problem is solvable and a parallel parsing algorithm for this class of grammars.
Key concepts: Parsing expression grammar, Unification, L-attributed grammar, Indexed grammar, Parsing, S-attributed grammar, Computer science, Tree-adjoining grammar