LL Leftmost k‐Linear Scattered Context Grammars

The present paper introduces a new variant of a scattered context grammar, called an LL leftmost k‐linear scattered context grammar. It is an ordinary scattered context grammar without erasing rules, where (1) every scattered context rule is composed of k‐linear rules, (2) if we take the first components of every rule, the resulting context‐free grammar is an LL grammar, and (3) every rule is applied in a leftmost way. We study the generative power of this variant and its parsing properties, including time and space complexity. In the conclusion, several remarks regarding the achieved results are made.