Parsing of Context-Free Languages [chapter]

Klaas Sikkel, Anton Nijholt
1997 Handbook of Formal Languages  
Parsing is the process of assigning structure to sentences. The structure is obtained from the grammatical description of the language. Both in Computer Science and in Computational Linguistics, context-free grammars and associated parsing algorithms are among the most useful tools. Numerous parsing algorithms have been developed. Special subclasses of the contextfree grammars have been introduced in order to allow and induce e cient parsing algorithms. Special superclasses of the context-free
more » ... rammars have been introduced in order to allow use of variants of e cient parsing methods that had been developed for context-free grammars. At rst sight m a n y parsing algorithms seem to be di erent, but nevertheless related. Some unifying approaches have been attempted in the past, but none survived the changing eld. This report introduces a unifying approach at a level between grammars and algorithms, introducing so-called parsing schemata. In the parsing schemata framework the essentials of di erent parsing algorithms can be compared and it can be shown how to derive an algorithm from another one. The insight that is obtained this way also allows the derivation of new algorithms and it allows less tedious observations about correctness than usual. The framework can also be applied to grammar formalisms beyond the context-free grammars. *
doi:10.1007/978-3-662-07675-0_2 fatcat:rlupjz2uynfavcyr5d7qpbcm3y