SLK Parser Generator

The SLK parser-generator is the only tool available that enables table-driven LL(k) parsing. Top-down parsing (LL) is thought to be better suited to syntax directed translation (compilers) than the bottom-up parsing technique (LALR) that is used by most parser-generators. The SLK table-driven parsing method is also superior to the recursive-descent technique that is used by programmers because it automates much of the process. The simple driver treats all symbol types of the grammar the same because the grammar is encoded in a set of tables. In recursive-descent, all of the productions are individually written out in the source code of the program. This is tedious, prone to error, difficult to maintain, and it obscures the grammar in a way that makes it difficult to determine exactly what language is really being recognized by the compiler.

SLK combines the simplicity and efficiency of the LL(1) method with the power and flexibility of Strong LL(k) parsing (SLL(k)). The SLK parser-generator creates parsers that are smaller and faster than others. They also have consistent, easily customizable, automated error recovery. Correctness is easier to demonstrate since the parsing code is separate from the semantic action code. [..] (Excerpt from its home page, see below).

This page is linked from: Parsing