Visual BNF 1.0

Visual BNF 1.0 is a professional parsing tool which is used to generate an LALR / LR (left to right parsing with rightmost derivated syntax tree) tables and DFA (deterministic finite automata) states. This is common parser generator.

This product offers visual coding of BNF (Backus Naur form) syntax, compilation and generation of output parse table dll (dynamic link library), which then can be integrated with Your application. Visual BNF offers also testing of the new language specified in a BNF syntax to see how it works. Syntax tree is also available there as new language is being parsed.

Visual BNF uses LR(1) and LALR(1) (switchable manually) algorithm to analyze syntax and deterministic finite automaton to identify different class of tokens. The LALR and DFA tables are easy to implement since they rely on lookup state tables.

Visual BNF does not require you to compile tables to your friendly language i.e C++, C#. These tables are generated into .NET assembly and is very easy to integrate with your application just by referencing assembly.

Since the parse tables are programming language independent, the parser engine can be, easily implemented in different programming languages so Your application can be written in other languages.

Get Visual BNF and take it for a test run to see what it can actually do for you!

Major Features:

1. BNF standard compiler
2. LALR(1) generator
3. Built-in error recovery
4. Realtime grammar testing
5. IDE that emphasizes simplicity
6. Example grammars
7. Integration with .NET 2.0
8. Free software to use
9. Easy of use, after even 15 minutes you get your own real parser application
10. Online forum to get some support from other Visual BNF users