Skip Navigation

The Computer Journal 1983 26(2):142-153; doi:10.1093/comjnl/26.2.142
© 1983 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (19)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Watt, D. A.
Right arrow Articles by Madsen, O. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Extended Attribute Grammars

D. A. Watt1 * and O. L. Madsen2 §

1 Computing Science Department, University of Glasgow, Glasgow, UK, 2 Computer Science Department, Aarhus University, Ny Munkegade, Aarhus, Denmark

Two new formalisms are introduced: extended attribute grammars, which are capable of defining completely the syntax of programming languages, and extended attributed translation grammars, which are additionally capable of defining their semantics by translation. These grammars are concise and readable, and their suitability for language definition is demonstrated by a realistic example. The suitability of a large class of these grammars for compiler construction is also established, by borrowing the techniques already developed for attributable grammars and affix grammars.

Received June 1982.

* Computing Science Department, University of Glasgow, Glasgow G12 8QQ, UK

§ Computer Science Department, Aarhus University, Ny Munkegade, DK 8000 Aarhus C, Denmark


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.