Incremental evaluation for attribute grammars with unrestricted movement between tree modifications

DOI10.1007/BF02737101zbMath0645.68089OpenAlexW4252107805MaRDI QIDQ1103412

Thomas W. Reps

Publication date: 1988

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

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

zbMATH Keywords

denotational semanticscompiler generatorsediting cursorediting modelincremental evaluationnoncircular attribute grammarsprogram editorstree modifications

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

On the computational complexity of dynamic graph problems

Cites Work

• On incremental evaluation of ordered attributed grammars
• Sublinear-space evaluation algorithms for attribute grammars
• Semantics of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Incremental evaluation for attribute grammars with unrestricted movement between tree modifications