article

Free access

Regular right-part attribute grammars

Authors:

Richard K. Jullig,

Frank DeRemerAuthors Info & Claims

ACM SIGPLAN Notices, Volume 19, Issue 6

Pages 171 - 178

https://doi.org/10.1145/502949.502891

Published: 01 June 1984 Publication History

PDF eReader

References

[1]

G. Bochmann: Semantic Attributes for Grammars with Regular Expresslons. Publication #195, Universit de Montreal (1976).

Google Scholar

[2]

F. DeRemer, R. Jullig: Tree-affix dendrogrammars for languages and compilers. Horkshop on Semantics-directed compilatlon. Aarhus, Denmark (1988).

Digital Library

Google Scholar

[3]

R. Jullig: Contextual Constraint Grammars. Ph.D. Tneszs, Unlverslty of California at Santa Cruz (1983).

Digital Library

Google Scholar

[4]

U. Kastens: ALADIN - Elne Deflnltionssprache fuer attributierte Grammatiken. Interner Bericht Nr. 7/79, Universitaet Karlsruhe (July 1979).

Google Scholar

[5]

D. Natt, O. Madsen: Extended attrlbute grammars. DAIMI PB-Ie5 (November 1979).

Google Scholar

[6]

R. Wilhelm: LL- and LR-attributed grammars. Universitaet des Saarlandes, Saarbruecken, Germany; Personal communication (1981).

Google Scholar

Cited By

View all

(2015)NeverlangComputer Languages, Systems and Structures10.1016/j.cl.2015.02.00143:C(1-40)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.cl.2015.02.001
Murata MNakatsuyama H(1997)A theoretical foundation of the DSSSL location modelMathematical and Computer Modelling: An International Journal10.1016/S0895-7177(97)00027-725:4(95-107)Online publication date: 1-Feb-1997
https://dl.acm.org/doi/10.1016/S0895-7177%2897%2900027-7
Chapman N(1990)Defining, analysing and implementing communication protocols using attribute grammarsFormal Aspects of Computing10.1007/BF018882352:1(359-392)Online publication date: Mar-1990
https://doi.org/10.1007/BF01888235
Show More Cited By

Regular right-part attribute grammars
1. Theory of computation
  1. Formal languages and automata theory

Recommendations

Regular right part grammars and their parsers

This paper introduces an alternative to context-free grammars called regular right part (RRP) grammars, which resemble PASCAL syntax diagrams. Formally, RRP grammars have production right parts, which are nondeterministic finite state machines (FSMs), ...
Constructing LR parsers for regular right part grammars

Regular right part (RRP) grammars differ from context free (CF) grammars by virtue of the fact that the production right parts are nondeterministic finite automatons (FAs). LR(k) parsers for RRP grammars are linear time parsers which can determine the ...
The formal power of one-visit attribute grammars

An attribute grammar is one-visit if the attributes can be evaluated by walking through the derivation tree in such a way that each subtree is visited at most once. One-visit (1V) attribute grammars are compared with one-pass left-to-right (L) attribute ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 19, Issue 6

Proceedings of the SIGPLAN '84 symposium on compiler construction

June 1984

318 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/502949

Issue’s Table of Contents

SIGPLAN '84: Proceedings of the 1984 SIGPLAN symposium on Compiler construction
June 1984
328 pages
ISBN:0897911393
DOI:10.1145/502874
General Chair:
Mary Van Deusen
IBM
,
Program Chair:
Susan L. Graham
University of California, Berkeley

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1984

Published in SIGPLAN Volume 19, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
372
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)14

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

(2015)NeverlangComputer Languages, Systems and Structures10.1016/j.cl.2015.02.00143:C(1-40)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.cl.2015.02.001
Murata MNakatsuyama H(1997)A theoretical foundation of the DSSSL location modelMathematical and Computer Modelling: An International Journal10.1016/S0895-7177(97)00027-725:4(95-107)Online publication date: 1-Feb-1997
https://dl.acm.org/doi/10.1016/S0895-7177%2897%2900027-7
Chapman N(1990)Defining, analysing and implementing communication protocols using attribute grammarsFormal Aspects of Computing10.1007/BF018882352:1(359-392)Online publication date: Mar-1990
https://doi.org/10.1007/BF01888235
Mahn UMahn U(1988)AnhangAttributierte Grammatiken und Attributierungsalgorithmen10.1007/978-3-642-51709-9_5(239-272)Online publication date: 1988
https://doi.org/10.1007/978-3-642-51709-9_5
Koskimies KNurmi OPakki J(1988)The design of a language processor generatorSoftware—Practice & Experience10.1002/spe.438018020218:2(107-135)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1002/spe.4380180202
Steimann FFreitag MFischer BBurgueño LCazzola W(2022)The Semantics of PluralsProceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3567512.3567516(36-54)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3567512.3567516
(2015)NeverlangComputer Languages, Systems and Structures10.1016/j.cl.2015.02.00143:C(1-40)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.cl.2015.02.001
Neven F(2005)Attribute grammars for unranked trees as a query language for structured documentsJournal of Computer and System Sciences10.1016/j.jcss.2004.10.00870:2(221-257)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1016/j.jcss.2004.10.008
Mernik MLenic MAvdicausevic EZumer V(1998)The template and multiple inheritance approach into attribute grammarsProceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225)10.1109/ICCL.1998.674161(102-110)Online publication date: 1998
https://doi.org/10.1109/ICCL.1998.674161
Farrow RMarlowe TYellin DSethi R(1992)Composable attribute grammarsProceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/143165.143210(223-234)Online publication date: 1-Feb-1992
https://dl.acm.org/doi/10.1145/143165.143210
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Regular right part grammars and their parsers

Constructing LR parsers for regular right part grammars

The formal power of one-visit attribute grammars

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations