Exploration of conflict situations in deterministic cancellation parser

The deterministic cancellation parser with a recursive descent structure - represented by authors - provides the ability of parsing a broader range of grammars, including those with any kind of left recursion, in linear time. Its modular recursive descent structure resembles the structure of original grammars imitating the steps of derivation sequences for accepting input strings. In addition to its straightforward structure that hides complexities, the hybrid nature of this new parser empowers it to work with a larger extent of grammars. Combining top-down and bottom-up cycles to construct the parse tree has some side effects that have to be taken into account and closely investigated by examining various situations at which the proposed parser may encounter problems and conflicts. In this paper, we will investigate such situations that result in conflicts and try to categorize them. The power of deterministic parsers is always restricted to those grammars that will not result in ambiguous situations at which parsers cannot make a deterministic decision to continue the process of parsing. These situations are often categorized as conflict situations and exploration of them is necessary to determine the acceptance power of the parsers.