Speeding up circularity tests for attribute grammars

DOI10.1007/BF00264616zbMath0515.68055OpenAlexW2022802764MaRDI QIDQ1052103

Bernard Lorho, Martin Jourdan, Pierre Deransart

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264616

zbMATH Keywords

complexityalgorithmsgraphsattribute grammarscircularityderivation treescircularity tests

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of graph theory to circuits and networks (94C15) Algorithms in computer science (68W99)

Related Items (3)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming ⋮ Attribute (re)evaluation in OPTRAN

This page was built for publication: Speeding up circularity tests for attribute grammars