Home > java > Jerly: A Java implementation of Earley’s efficient parsing algorithm

Jerly: A Java implementation of Earley’s efficient parsing algorithm

I found an old project of mine called Jerly. I wrote it in 2004-2005. I tried it in 2017 and it still works fine :) You can find it on GitHub.

Jerly is a Java implementation of Earley’s efficient parsing algorithm for lambda-free context-free grammars. To put it in a nutshell, it tells you if a word can be generated with a set of rules or not.

Advertisements
Categories: java Tags: , , ,
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: