Abstract
In this paper, we prove that the set of sentences parsed by M~cus' parser constitutes a context-free language. The proof is carried out by construing a deterministic pushdown automaton that recognizes those smngs of terminals that are parsed successfullyby the Marcus pa~er.
Cite
CITATION STYLE
APA
Nozohoor-Farshj, R. (1987). Context-frkfness of the language accepted by Marcus’ Parser. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1987-July, pp. 117–122). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981175.981192
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free