K-automaton Code
Status: Alpha
Brought to you by:
dimaster
File | Date | Author | Commit |
---|---|---|---|
data | 2007-03-19 | dimaster | [r47] |
src | 2007-08-27 | dimaster | [r59] "" |
build.properties | 2007-03-19 | dimaster | [r46] |
build.xml | 2007-03-27 | dimaster | [r57] |
manifest.mf | 2007-03-13 | dimaster | [r1] |
readme.txt | 2007-03-15 | dimaster | [r6] |
K-Automaton 1.0a ---------------- Project home: http://sourceforge.net/projects/k-automaton/ Platform: Java SE 1.5 License: Apache License V2.0 Date: 2007-03-15 Abstract -------- K-Automaton is a new parsing (syntactic analysis) machine isomorphous to language. Can generate Java code from grammars described in EBNF To generate code run: java -cp k-automaton.jar ebnf2grammar <ebnf-file> <dest-dir> <ebnf-file> is source file in EBNF (see src/ebnf/* for examples) <dest-dir> is destination directory (output subdirectory depends on package stated in EBNF file) Also you can run visual representation of K-Automaton (small Swing application): java -cp k-automaton.jar visualka [<grammar-class-name>] <file-path> <grammar-class-name> is java class name for grammar to use (if not specified EbnfGrammar will be used) <file-path> is path to file -- Dmitri Koulakov, dimaster at users.sourceforge.net