Journal ArticleDOI
The complexity of languages generated by attribute grammars
Reads0
Chats0
TLDR
It is shown that the output language (i.e., the range of the translation) of a SAG is log-space reducible to a context-free language.Abstract:
A string-valued attribute grammar (SAG) has a semantic domain of strings over some alphabet, with concatenation as basic operation. It is shown that the output language (i.e., the range of the translation) of a SAG is log-space reducible to a context-free language.read more
Citations
More filters
Journal ArticleDOI
Properties that characterize LOGCFL
TL;DR: The semi-unboundedness property leads to the definition of semi- unbounded fan-in circuit families and suggests new characterizations of LOGCFL on the following models: alternating Turing machines, nondeterministic auxiliary pushdown automata, and bounded fan- in Boolean circuits.
Book ChapterDOI
Context-free graph grammars
TL;DR: Graph languages are sets of labeled graphs that can be generated by graph grammars, and in particular by context-free graph gramMars, which can be used to generate string languages and tree languages.
Proceedings ArticleDOI
Properties that characterize LOGCFL
TL;DR: The semi-unboundedness property leads to the definition of new models of computation based on unbounded fan-in circuits and suggests new characterizations of LOGCFL on the following models: alternating Turing machines, nondeterministic auxiliary pushdown automata, and bounded fan- in Boolean circuits.
Journal ArticleDOI
Independent parallelism in finite copying parallel rewriting systems
Owen Rambow,Giorgio Satta +1 more
TL;DR: It is shown that, when the degree of synchronized parallelism is bounded by some constant greater than one, thedegree of independent parallelism induces an infinite non-collapsing hierarchy within the family of generated languages.
Proceedings Article
Parsing and Generation as Datalog Queries
TL;DR: It is shown that the problems of parsing and surface realization for grammar formalisms with “context-free” derivations, coupled with Montague semantics, can be reduced in a uniform way to Datalog query evaluation.