Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings
Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
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

Packages

Contributors

Languages

Morty Proxy This is a proxified and sanitized view of the page, visit original site.