software

This project implements a generator of LL(k) parsing tables for such formal languages, where k is greater than 1. Usually, in such cases, parser has k-tuple of symbols under the reading head. Implemented innovation requires just single one symbol under the reading head. Even if the implementation is devoted to k greater than 1, it accepts grammars where k is equal to 1.

formal languages, parser generator, parsing table, LL(k) grammars

20. 9. 2015

http://www.fit.vutbr.cz/~kolar/public/LLk-Parsing-Table-Generator.zip

K využití výsledku jiným subjektem je vždy nutné nabytí licence

Poskytovatel licence na výsledek nepožaduje licenční poplatek

http://www.fit.vutbr.cz/~kolar/public/LLk-Parsing-Table-Generator.zip