Skip to content

cable729/automata2

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Readme

The purpose of this project is to write a program to determine whether a string can be derived by a context-free grammar (CFG).

Use

To compile:

javac -d out -sourcepath src src/Main.java

To run the program:

java -cp out Main

Design

This implementation uses the Earley Parser algorithm. The ContextFreeGrammar class hosts the production rules and the terminals/variables/start state. A chart holds information on the parse so far in terms of StateSets.

About

Project 2 for CSCE 428 Automata at UNL

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages