Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Confluent string rewriting
Parsing theory volume 2: LR(K) and LL(K) parsing
Parsing theory volume 2: LR(K) and LL(K) parsing
String-rewriting systems
Modern compiler implementation in Java
Modern compiler implementation in Java
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
A Normal Form for Church-Rosser Language Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
Church-Rosser languages are mainly based on confluent length reducing string rewriting systems. In general, the prefix language of a Church-Rosser language may not be describable by such a system, too. In this paper it is shown that under certain conditions it is possible to give a construction for a system defining the prefix language and to prove its correctness. The construction also gives a completion of prefixes to full words in the original language. This is an interesting property for practical applications, as it shows potential for error recovery strategies in parsers.