{"id":20200199,"url":"https://github.com/superb-man/automaton-solver","last_synced_at":"2025-10-06T17:16:30.616Z","repository":{"id":243701305,"uuid":"802113393","full_name":"Superb-Man/Automaton-Solver","owner":"Superb-Man","description":"regex -\u003e abstract syntax tree -\u003e  nfa -\u003e dfa(minimized) conversion.","archived":false,"fork":false,"pushed_at":"2024-09-05T09:44:26.000Z","size":511,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-13T20:14:27.434Z","etag":null,"topics":["cyk-algorithm","dfa","dfa-minimization","dotfiles","json","moore-minimization","nfa","parser","regular-expression","x-33"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Superb-Man.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-17T14:52:15.000Z","updated_at":"2025-01-11T20:06:43.000Z","dependencies_parsed_at":"2024-08-27T17:07:17.674Z","dependency_job_id":"9b13c2ff-9a1a-474c-a26c-786b8d3867e8","html_url":"https://github.com/Superb-Man/Automaton-Solver","commit_stats":null,"previous_names":["superb-man/toc-solver","superb-man/automaton-solver"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Superb-Man%2FAutomaton-Solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Superb-Man%2FAutomaton-Solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Superb-Man%2FAutomaton-Solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Superb-Man%2FAutomaton-Solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Superb-Man","download_url":"https://codeload.github.com/Superb-Man/Automaton-Solver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241637149,"owners_count":19994925,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cyk-algorithm","dfa","dfa-minimization","dotfiles","json","moore-minimization","nfa","parser","regular-expression","x-33"],"created_at":"2024-11-14T04:42:22.412Z","updated_at":"2025-10-06T17:16:30.611Z","avatar_url":"https://github.com/Superb-Man.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"This is a basic regular expression to DFA converter based on the coursework of theory of computation.Implemented ```*,+,Seq,OR``` as we weren't taught about ```(.,[],-,^,?)``` in that course. \n# Features\n```\n- It takes an input as expression and parse it.\n- Then from the abstract syntax tree it makes NFA and from NFA.\n- it is converted into DFA using the epsilon closure propery....\n- Then moore minimization algorithm is used to minimize the DFA.\n- An additional string check is used also(Whether the input belongs to the expression)\n- worked with OR/UNION,STAR,SEQ/AND,PLUS and literals\n```\n# Screenshots \n```\n- abstract syntax tree for a+b*(c+de)*f\n```\n![parse_tree](https://github.com/user-attachments/assets/9b9c334c-b232-47f7-aafc-0fedce4560c1)\n```\n- nfa and min dfa\n```\n![nfa](https://github.com/user-attachments/assets/7079e41f-bd83-4aea-96c7-7ccbe1e022ad)\n![dfa_moore_minimizedTable](https://github.com/Superb-Man/TOC-Solver/assets/104999005/fa69ec28-4a37-4003-b11d-fdac50c6e1e9)\n![dfa_moore_minimized](https://github.com/Superb-Man/TOC-Solver/assets/104999005/41afb480-46b1-4611-a332-8c00197e0016)\n\n```\n- CYK simulation for the CFG\n- S -\u003e A B | B C\n- A -\u003e B A | a\n- B -\u003e C C | b\n- C -\u003e A B | a\n```\n![cyk_table](https://github.com/Superb-Man/TOC-Solver/assets/104999005/7d0666ad-9aea-4959-b7e5-0fc6f4331df8)\n\n# Will try to implement \n```\n- CFG To CNF\n- CFG to PDA\n- CFG to LL(K)\n- Left factoring and Left recursion elimination\n- Computing first and follow sets\n```\n# Usage\n```\n- To run the NFA-DFA-Regex tests   =  ./regex_test \u003cregex\u003e \u003cinput1\u003e \u003cinput2\u003e ...\n\n- To run the CFG-CYK tests = ./cfg_draw \u003ccfg_file\u003e \u003cstring1\u003e \n\n- To create images for dfa-nfa     = ./dfa_draw\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsuperb-man%2Fautomaton-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsuperb-man%2Fautomaton-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsuperb-man%2Fautomaton-solver/lists"}