Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of Boolean functions
The complexity of Boolean functions
The design of a language processor generator
Software—Practice & Experience
Complexity characterizations of attribute Grammar languages
Information and Computation
Attribute grammars: definitions, systems and bibliography
Attribute grammars: definitions, systems and bibliography
Syntactic Pattern Recognition of the ECG
IEEE Transactions on Pattern Analysis and Machine Intelligence
A grammatical view of logic programming
A grammatical view of logic programming
Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
Elements of the Theory of Computation
Elements of the Theory of Computation
A brief survey of web data extraction tools
ACM SIGMOD Record
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The Genesis of Attribute Grammars
Proceedings of the International Conference WAGA on Attribute Grammars and their Applications
Attribute Grammar Specification for a Natural Language Understanding Interface
Proceedings of the International Conference WAGA on Attribute Grammars and their Applications
On one-way auxiliary pushdown automata
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
A Comparative Study of Information Extraction Strategies
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
Toolkits for Generating Wrappers
NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
One application of real-valued interpretation of formal power series
Theoretical Computer Science
LINGUIST-86: Yet another translator writing system based on attribute grammars
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
TEG—a hybrid approach to information extraction
Knowledge and Information Systems
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
On the power of multiplication in random access machines
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
SIAM Journal on Computing
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Deterministic context free languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Journal of Computer and System Sciences
A logic-based tool for semantic information extraction
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
The HiLeX system for semantic information extraction
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
Hi-index | 0.01 |
Regular grammars with attributes overcome some limitations of classical regular grammars, sensibly enhancing their expressiveness. However, the addition of attributes increases the complexity of this formalism leading to intractability in the general case. In this paper, we consider regular grammars with attributes ranging over integers, providing an in-depth complexity analysis. We identify relevant fragments of tractable attribute grammars, where complexity and expressiveness are well balanced. In particular, we study the complexity of the classical problem of deciding whether a string belongs to the language generated by any attribute grammar from a given class C (call it parse"["C"]). We consider deterministic and ambiguous regular grammars, attributes specified by arithmetic expressions over {||,+,-,@?,%,@?}, and a possible restriction on the attributes composition (that we call strict composition). Deterministic regular grammars with attributes computed by arithmetic expressions over {||,+,-,@?,%} are P-complete. If the way to compose expressions is strict, they can be parsed in L, and they remain tractable even if multiplication is allowed. Problem parse"["C"] becomes NP-complete for general regular grammars over {||,+,-,@?,%,@?} with strict composition and for grammars over {||,+,-,@?,%} with unrestricted attribute composition. Finally, we show that even in the most general case the problem is in polynomial space.