https://github.com/mathemage/regex-dfa

tool for conversion of (basic) regular expression to deterministic finite automaton/machine (supporting the simulation of DFA's run)
https://github.com/mathemage/regex-dfa

Last synced: 24 days ago
JSON representation

tool for conversion of (basic) regular expression to deterministic finite automaton/machine (supporting the simulation of DFA's run)

• Host: GitHub
• URL: https://github.com/mathemage/regex-dfa
• Owner: mathemage
• License: mit
• Created: 2014-11-23T11:00:30.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2014-11-23T11:30:56.000Z (about 10 years ago)
• Last Synced: 2023-04-12T18:14:03.123Z (almost 2 years ago)
• Language: Haskell
• Size: 219 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
RegEx-DFA

=========

- Haskell tool for conversion of (basic) regular expression to deterministic finite automaton/machine (supporting the simulation of DFA's run)

- university project for course Non-procedural Programming

- 2nd year of bachelor studies