Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática
Abstract
We investigate the possibility of the deterministic parsing (that is, parsing
without backtracking) of languages characterized by (generalized) P colony automata.
We de ne a class of P colony automata 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
