Skip to content

An application that renders a Finite Automaton Diagram from an input text real-time.

License

Notifications You must be signed in to change notification settings

sevora/regex-to-fa

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Regular Expression to Finite Automaton · GitHub GitHub repo size

This is an application both accessible on web and mobile. The purpose of this simple application is to render a given regular expression to a finite automaton diagram. This uses the Thompson Construction algorithm for the diagram generation along with the Shunting Yard algorithm to convert the infix input to postfix.

Web

The web application is a Node.js application. This is where the entire application was originally developed using the native HTML5 Canvas API. It is written to be as efficient as possible while rerendering in real-time.

Provided below is a screenshot taken of the working web-application. Screenshot of Web Version

Mobile

The mobile application is a Flutter application. It uses a CustomPainter which s extremely similar to the HTML5 Canvas API.

Contributing

This is open to improvements particularly in rendering union operations denoted by "+". The mobile application is also open to interface and interaction imporovements.

About

An application that renders a Finite Automaton Diagram from an input text real-time.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published