The complexity of languages generated by attribute grammars
SIAM Journal on Computing
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Computational Complexity and Natural Language
Computational Complexity and Natural Language
On the mathematical properties of linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Subgrammars, rule classes and control in the Rosetta translation system
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Non-deterministic recursive ascent parsing
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A generalization of the offline parsable grammars
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The computational complexity of sentence derivation in functional unification grammar
COLING '86 Proceedings of the 11th coference on Computational linguistics
Machine translation based on logically isomorphic Montague grammars
COLING '82 Proceedings of the 9th conference on Computational linguistics - Volume 1
Reversible unification based machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
In this paper M-grammars that are used in the Rosetta translation system will be looked at as the specification of attribute grammars. We will show that the attribute evaluation order is such that instead of the special-purpose parsing and generation algorithms introduced for M-grammars in Appelo et al.(1987), also Earley-like context-free parsing and ordinary generation strategies can be used. Furthermore, it is illustrated that the attribute grammar approach gives an insight into the weak generative capacity of M-grammars and into the computational complexity of the parsing and generation process. Finally, the attribute grammar approach will be used to reformulate the concept of isomorphic grammars.