Rie, a compiler generator based on a one‐pass‐type attribute grammar | Zendy

Sassa Masataka | Zendy; Ishizuka Harushi | Zendy; Nakata Ikuo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Rie, a compiler generator based on a one‐pass‐type attribute grammar

Author(s) -

Sassa Masataka,

Ishizuka Harushi,

Nakata Ikuo

Publication year - 1995

Publication title -

software: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.437

H-Index - 70

eISSN - 1097-024X

pISSN - 0038-0644

DOI - 10.1002/spe.4380250302

Subject(s) - computer science , programming language , attribute grammar , compiler , compiler construction , parsing , grammar , compiler correctness , regular tree grammar , adaptive grammar , operator precedence grammar , mildly context sensitive grammar formalism , affix grammar , natural language processing , generative grammar , artificial intelligence , emergent grammar , linguistics , philosophy

We herein describe a compiler generator, Rie, which is based on a one‐pass‐type attribute grammar. LR‐attributed grammars are one class of attribute grammars in which attribute evaluation can be performed in one pass during LR parsing without creating a parse tree. Rie was developed based on a variant of an LR‐attributed grammar called ECLR‐attributed grammar (equivalence class LR‐attributed grammar), in which equivalence relations are introduced into the LR‐attributed grammar. Rie generates a one‐pass compiler from a compiler description given in attribute grammar form. Many language processors have been developed using Rie. The generated compiler is only about 1.8 times slower than a handwritten compiler, which is fairly efficient for a compiler generated from formal descriptions.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research