A RegEx interpreter that matches (partially or fully) a given string against a given regular expression.
- Updated
Nov 13, 2022 - Haskell
#
theory-of-computation
Here are 5 public repositories matching this topic...
Comparison study between various methods of evaluation for untyped lambda expressions, with practical implementations available
- Updated
Jun 30, 2024 - Haskell
A language that allows you to define DFA's and test strings on them
- Updated
Aug 8, 2017 - Haskell
Haskell implementation of Brzozowski derivatives for regular expressions.
haskell functional-programming regex regular-expression theory-of-computation brzozowski-derivative regex-matcher
- Updated
Jan 22, 2023 - Haskell
FIB-LP 2022-23 Q1 Programming Languages subject + Funx interpreter
kotlin python language flask haskell interpreter functional-programming oop lambda-calculus programming-languages antlr4 compilers type-inference theory-of-computation jinja
- Updated
Aug 8, 2024 - Haskell
Improve this page
Add a description, image, and links to the theory-of-computation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the theory-of-computation topic, visit your repo's landing page and select "manage topics."