Attribute grammars and automatic complexity analysis

DOI10.1016/S0196-8858(02)00542-0zbMath1028.68073OpenAlexW1993840779MaRDI QIDQ1398296

Marni Mishna

Publication date: 29 July 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-8858(02)00542-0

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

From object grammars to ECO systems ⋮ Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation ⋮ Assessing the quality of multilevel graph clustering ⋮ Randomness Preserving Deletions on Special Binary Search Trees ⋮ \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic analysis of bucket recursive trees
• Automatic average-case analysis of algorithms
• Attribute grammars are useful for combinatorics
• Probabilistic analysis of multiple quick select
• A calculus for the random generation of labelled combinatorial structures
• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
• Semantics of context-free languages