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.
Type de document :
[Research Report] RR-4021, INRIA. 2000
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:24:49
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:15:39



  • HAL Id : inria-00072620, version 1



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



Consultations de la notice


Téléchargements de fichiers