Computation sequences: A way to characterize subclasses of attribute grammars. | Zendy

Hanne Riis Nielson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computation sequences: A way to characterize subclasses of attribute grammars.

Author(s) -

Hanne Riis Nielson

Publication year - 1981

Publication title -

daimi report series

Language(s) - English

Resource type - Journals

eISSN - 2245-9316

pISSN - 0105-8517

DOI - 10.7146/dpb.v10i138.7946

Subject(s) - rule based machine translation , l attributed grammar , tree adjoining grammar , tree (set theory) , computation , sequence (biology) , property (philosophy) , computer science , theoretical computer science , simple (philosophy) , definite clause grammar , mathematics , attribute domain , embedded pushdown automaton , context free grammar , algorithm , combinatorics , artificial intelligence , rough set , philosophy , epistemology , biology , genetics

A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely well-defined attribute grammars are considered.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research