article

The complexity of languages generated by attribute grammars

Author:

Joost EnglfrietAuthors Info & Claims

SIAM Journal on Computing, Volume 15, Issue 1

Pages 70 - 86

https://doi.org/10.1137/0215005

Published: 01 February 1986 Publication History

Abstract

No abstract available.

Cited By

View all

Maneth S(2002)The Complexity of Compositions of Deterministic Tree TransducersProceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science10.5555/646840.708801(265-276)Online publication date: 12-Dec-2002
https://dl.acm.org/doi/10.5555/646840.708801
Mandayam RVemuri RDunlop A(1993)Performance specification using attributed grammarsProceedings of the 30th international Design Automation Conference10.1145/157485.165085(661-667)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.165085
Rous JKunze jReimann D(1991)Computational aspects of M-grammarsProceedings of the fifth conference on European chapter of the Association for Computational Linguistics10.3115/977180.977217(210-215)Online publication date: 9-Apr-1991
https://dl.acm.org/doi/10.3115/977180.977217
Show More Cited By

Recommendations

Attribute grammars and data-flow languages

This paper examines the similarity between attribute grammars and data-flow languages. For any attribute grammar there is a data-flow program that is an evaluator for it, and we describe how to build this data-flow program. The design of semantic ...
Inherent Ambiguity of Languages Generated by Spine Grammars

There have been many arguments that the underlying structure of natural languages is beyond the descriptive capacity of context-free languages. A well-known example is tree adjoining grammars; less common are spine grammars, linear indexed grammars, ...
Language classes generated by tree controlled grammars with bounded nonterminal complexity

A tree controlled grammar is specified as a pair (G,G^') where G is a context-free grammar and G^' is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree-except ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 15, Issue 1

Feb. 1986

301 pages

ISSN:0097-5397

Editor:
S Rao Kosaraju

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maneth S(2002)The Complexity of Compositions of Deterministic Tree TransducersProceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science10.5555/646840.708801(265-276)Online publication date: 12-Dec-2002
https://dl.acm.org/doi/10.5555/646840.708801
Mandayam RVemuri RDunlop A(1993)Performance specification using attributed grammarsProceedings of the 30th international Design Automation Conference10.1145/157485.165085(661-667)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/157485.165085
Rous JKunze jReimann D(1991)Computational aspects of M-grammarsProceedings of the fifth conference on European chapter of the Association for Computational Linguistics10.3115/977180.977217(210-215)Online publication date: 9-Apr-1991
https://dl.acm.org/doi/10.3115/977180.977217
Engelfriet J(1989)The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler constructionACM SIGACT News10.1145/70642.7064520:3(57-59)Online publication date: 1-Jul-1989
https://dl.acm.org/doi/10.1145/70642.70645
Venkateswaran H(1987)Properties that characterize LOGCFLProceedings of the nineteenth annual ACM symposium on Theory of computing10.1145/28395.28411(141-150)Online publication date: 1-Jan-1987
https://dl.acm.org/doi/10.1145/28395.28411

Abstract

Cited By

Index Terms

Recommendations

Attribute grammars and data-flow languages

Inherent Ambiguity of Languages Generated by Spine Grammars

Language classes generated by tree controlled grammars with bounded nonterminal complexity

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations