Dividing patterns into deterministic regions

摘要

The LR(k) parsing provides a deterministic table driven algorithm for pattern recognition. An LR parser scans the text from left to right while reducing handles. The process is sequential in nature. This paper describes a parsing method based on SLR(1) parse table. A pre-parsing phase is used to divide an input pattern into deterministic regions. Each region reduces to a minimal sub-phrase. The regions can be parsed simultaneously using portions of the SLR(1) parse table for the whole grammar.