1992•Acta InformaticaRequires access

Context-free hypergraph grammars have the same term-generating power as attribute grammars

Joost Engelfriet, Linda Heyker

Open publisher page 35 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 35 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Tree-adjoining grammar, L-attributed grammar, Context-sensitive grammar, Indexed grammar, Context-free grammar, Embedded pushdown automaton, Computer science, Deterministic context-free grammar

Back to paper search Browse research topics Original source

Context-free hypergraph grammars have the same term-generating power as attribute grammars — Research Paper | ScholarLens