Attribute grammars and automatic complexity analysis

Marni Mishna 1
1 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars have enhanced the study of context-free grammars by giving meaning to constructions. Delest and Fédou \citeDeFe92 showed that attribute grammars extend to combinatorial structures, with applications to random generation. In a similar way, we show attribute grammars can be defined for the family of decomposable structures and yield multivariate generating function equations. From there, averages and higher moments are easily accessible. This idea unifies previous approaches to the analysis of parameters of data-structures.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072620
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:24:49 AM
Last modification on : Friday, May 25, 2018 - 12:02:02 PM
Long-term archiving on : Sunday, April 4, 2010 - 11:15:39 PM

Identifiers

  • HAL Id : inria-00072620, version 1

Collections

Citation

Marni Mishna. Attribute grammars and automatic complexity analysis. [Research Report] RR-4021, INRIA. 2000. ⟨inria-00072620⟩

Share

Metrics

Record views

84

Files downloads

214