SLK Parser Generator - LL(k) Parsers, C C++ C# Java parser generator, SQL parser, Verilog parser, JavaScript parser

Home FAQ Documentation Download Contact

The Only True LL(k) Parser Generator

*** This website has moved to this new address. ***
SLK does a full strong LL(k) analysis of the grammar. The SLK algorithm is the only known near-solution to this NP-complete problem. Other deterministic algorithms must either limit k to a very small value, usually two, or use approximate lookahead methods that are considerably weaker than the strong LL(k) method.

SLK implements two new strong LL(k) algorithms that are not available in any other parser generator.

The SLK parser generator produces parsers that are nearly the fastest and most compact that is possible.

The SLK parser generator produces fully modular parsers.

The SLK parser generator currently supports the C, C++, Java, and C# languages.

The SLK parser generator specification language, the grammar, is completely programming language independent.

The SLK parser generator introduced a new and more precise action placement syntax for EBNF notation.

The SLK parser generator supports a new white space delimited syntax that accepts grammars in the forms commonly found in published reference grammars.

The SLK parsers have no library dependencies, so they are well-suited to embedded applications.

The SLK parser generator includes automated grammar transformation options that convert reference grammars to top-down format.

Predictive backtracking can be enabled under programmer control as part of the syntax of the SLK parser generator.

The SLK parsers are reentrant and thread-safe.

Any number of SLK parsers for different grammars can be contained in a single program.

Compiling SLK parsers is never a problem. All C, C++, Java and C# compilers are fully supported.