In this paper a subclass of generalized P colony automata is defined that satisfies a property which resembles the LL(k) property of context-free grammars The possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages, is examined
