LL(k) Parsing Table Generator

for Automaton with One-Symbol Reading Head

Authors: Radim Kocman and Dušan Kolář, GitHub

Based on:
Kolář, D.: Simulation of LLk Parsers with Wide Context by Automaton with One-Symbol Reading Head.
Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, Volume I: Parsing.

Input Grammar:

Example Grammar:

%token a b
%% /* LL(2) */
S : a A a a
| b A b a ;
A : /*eps*/
| b ;

Configuration:

k (>= 1):
output:

Hints:

This tool uses simplified yacc-like syntax for its input:

rules - can be defined as in yacc but without actions
nonterminals - defined in the form [_a-Z][_a-Z0-9]*
abstract terminals - same as nonterminals but declared
by %token at the beginning
literal terminals - anything inside quotes or apostrophes
(escape sequences are not supported)
comments - C-like single-line // and multi-line /**/

Export (not supported for IE):

XLS - standard Excel file (the best option)
CSV1 - CSV format comma-separated
CSV2 - CSV format semicolon-separated

Performance tips:

try a less verbose ouput for faster results

Status: Insert your grammar