Marni Mishna. Attribute grammars and automatic complexity analysis. Advances in Applied Mathematics, 30:189--207, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Attribute Grammars and Automatic Complexity Analysis - Mishna (2000) (1 citation) Self-citation (Marni) (Correct)
....an index indicating the related constructor m . We use the following notations: z = z 1 1 ; z k k ) and z = z 1;1 1 : z 1;k k ; z 1;k 1 : z k;k k . This allows us to state the Attribute Grammars Generating Function theorem. Theorem 1. [6] Given the grammar speci cation B = 1 (B 1 1 ; B 1 k 1 ) j : j n (B n 1 ; B n kn ) where each i is a grammar constructor or a terminal and given the set of attribute productions F i (B) S 1 m n m i P j;k m i;j F j (B m k ) i the ....
Mishna (Marni). { Attribute grammars and automatic complexity analysis. { Research Report n 4021, Institut National de Recherche en Informatique et en Automatique, October 2000. 20 pages.
Trustable Communication Between Mathematics Systems - Carette, Farmer, Wajs (2003) (Correct)
No context found.
Marni Mishna. Attribute grammars and automatic complexity analysis. Advances in Applied Mathematics, 30:189--207, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC