[GSoC 2026] Lark-Based Parser to Parse Set-Builder Notation Of Regular Language

[Suraj Channappanavar]

Hello,

I am Suraj, Junior majoring in Computer Science at Arizona State University. My Proposal is on Theory of Computation, from DFA to Turning Machine. A part of it is a method that takes a set-builder notation description of a regular language as input and returns a DFA object that recognizes that language.

I wanted to know if my proposal idea is within Sympy's scope. My goal is to implement all the major topics of DFA, NFA, PDA and Turning Machine. I am using Micheal Sipser's Theory of Computation as my reference.

I have built a Parser that takes a Regex, validates it and creates NFA using REG nodes. This was an academic project originally written in C++, I rewrote it in Python so that I can use it for Sympy. Here is the link: regex-engine-core

I will be submitting my proposal soon with PR consisting of DFA module that lets you create a DFA Object manually, run string inputs on the machine and export in Graphviz Dot format. 

Thanks.