Abstract
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages.
Cite
CITATION STYLE
Csuhaj-Varjú, E., Kántor, K., & Vaszil, G. (2018). Deterministic parsing with P colony automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11270 LNCS, pp. 88–98). Springer Verlag. https://doi.org/10.1007/978-3-030-00265-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
