Author:
Rosenkrantz D.J.,Stearns R.E.
Reference9 articles.
1. Computability and Unsolvability;Davis,1958
2. Deterministic context-free languages;Ginsburg;Information and Control,1966
3. A new normal-form theorem for context-free phrase structure grammars;Greibach;J. ACM,1965
4. Simple deterministic languages;Korenjak,1966
5. On the translation of languages from left to right;Knuth;Information and Control,1965
Cited by
155 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multi-Derivational Parsing of Vague Languages— The New Paradigm of Syntactic Pattern Recognition;IEEE Transactions on Pattern Analysis and Machine Intelligence;2024-08
2. The Hardest LL(k) Language;International Journal of Foundations of Computer Science;2023-02
3. Context-Bounded Verification of Context-Free Specifications;Proceedings of the ACM on Programming Languages;2023-01-09
4. Bibliography;Engineering a Compiler;2023
5. Parsers;Engineering a Compiler;2023