Jerly (J-Earley)
a Java implementation of Earley's algorithm
|
[ Self ref. 1 ]
|
[ Self ref. 2 ]
|
|
[ S I T E M A P ]
|
|
|
[ F o r u m ]
|
|
|
Jerly (J-Earley)a Java implementation of Earley's algorithm |
|
||||||
 |
Version 0.1 is out. |
Description ( Top
)
With Earley's syntactic parser algorithm you can decide if a word can be generated
by a given grammar.
I made a longer description of the algorithm that can be read here:
jerly.pdf. Attention! If it looks ugly on screen, then
try to magnify it or simply print it (only 6 pages).
Remark: Jerly is a standalone console application (on Hotscripts it is registered
under "JSP and Servlets" because the registration form didn't allow me
to put it under "Java Applications". Eh, whatever...).
Download / View ( Top )
Download the project (Eclipse) here.
Version history ( Top )
| Version | Date | Remark |
|---|---|---|
| v0.1 | 2005 May 2 | first public release |
Ideas / To do ( Top )
Tell me if you have some ideas...
Credits ( Top )
This place is reserved for you...
How to contact me ( Top )
If you have any ideas how to improve this project, then send me your suggestions/patches
to szathml@delfin.unideb.hu.
|
|
||||||||
