NTS languages are deterministic and congruential
Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Estimating the Speedup in Parallel Parsing
IEEE Transactions on Software Engineering
Recognizing substrings of LR(k) languages in linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounded context syntactic analysis
Communications of the ACM
On parsing and condensing substrings of LR languages in linear time
Theoretical Computer Science
Parallel Compilation In A Multiprocessor Environment (Extended Abstract)
ACM '78 Proceedings of the 1978 annual conference
Parsing Techniques: A Practical Guide
Parsing Techniques: A Practical Guide
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
| Hi-index | 0.89 |
Operator precedence grammars, introduced by Floyd several decades ago, enjoy properties that make them very attractive to face problems and to exploit technologies highly relevant in these days. In this paper we focus on their local parsability property, i.e., the fact that any substring s of a longer one x.s.y can be parsed independently of its context without the risk of invalidating the partial parsing when analyzing another portion of the whole string. We exploit this distinguishing property by developing parallel algorithms and suggest its further application to error recovery and incremental analysis. Great savings in terms of computational complexity are theoretically proved and have been reached in practice by first prototype tools.