Author:
Barash Mikhail,Okhotin Alexander
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference36 articles.
1. LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata;Aizikowitz,2011
2. Context-free languages and pushdown automata;Autebert,1997
3. Recursive descent parsing for grammars with contexts;Barash,2013
4. Programming language specification by a grammar with contexts;Barash,2013
5. M. Barash, A. Okhotin, Linear grammars with one-sided contexts and their automaton representation, in: LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 31 March–4 April 2014, in: Lect. Notes Comput. Sci., vol. 8392, pp. 190–201.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The hardest language for grammars with context operators;Theoretical Computer Science;2023-05
2. The Hardest LL(k) Language;International Journal of Foundations of Computer Science;2023-02
3. Derivatives of Context-free Grammars with Lookahead;Journal of Information Processing;2023
4. Context-Free Grammars with Lookahead;Language and Automata Theory and Applications;2021
5. Parsing a markup language that supports overlap and discontinuity;Proceedings of the ACM Symposium on Document Engineering 2020;2020-09-23