A parser generator for C
-
Updated
Aug 26, 2025 - C
#
left-recursion
Here are 14 public repositories matching this topic...
💡 Build your own programming language! A C++17 PEG parser generator supporting parser combination, memoization, left-recursion and context-dependent grammars.
c-plus-plus calculator parser grammars memoization parse cpp dsl parser-generator filter grammar complexity peg parsercombinator packrat left-recursion ambiguous-grammars calculator-visitor packrat-parser
-
Updated
Jun 1, 2021 - C++
All the weekly lab work of the subject 18CSC304J Compiler Design.
postfix prefix nfa dfa compiler-design lexical-analyzer leading-and-trailing triple directed-acyclic-graph quadruple shift-reduce-parsers left-recursion-elimination left-recursion nfa-to-dfa-conversion first-and-follow left-factoring predictive-parser
-
Updated
May 11, 2022 - C++
Arborist is a PEG parser that supports left-associative left recursion
-
Updated
Apr 5, 2020 - Crystal
c++ ascii not poisonous parsing library
parsing modern-cpp parsing-expression-grammar header-only text-processing text-parser parsing-library single-header-lib left-recursion cpp23 nix-flake single-header-library cpp-reflection
-
Updated
Mar 15, 2025 - C++
Compiler Design experiments including c, flex, bison, scanner, java and other codes
java calculator bison flex mips scanner clr lex yacc lalr lexical-analyzer slr leading-and-trailing shift-reduce-parsers left-recursion nfa-to-dfa-conversion first-and-follow left-factoring predictive-parser
-
Updated
Apr 23, 2024 - C++
-
Updated
May 7, 2017 - C++
LL(1) parser toolkit in C: reads a grammar, performs left factoring and left recursion removal, computes FIRST/FOLLOW, builds an LL(1) table, and parses strings with a custom stack and detailed debug output. Includes Makefile, Windows script, sample grammar, and inputs.
c parsing stack compiler context-free-grammar left-recursion ll1-parser left-factoring first-follow parsing-tabe
-
Updated
Sep 12, 2025 - C
Parsing complex expressions into a tree and getting the answer. Built with C++.
-
Updated
Dec 3, 2020 - C++
C-based toolkit for context-free grammars: reads a grammar, performs left factoring and left recursion removal, computes FIRST/FOLLOW sets, and builds/prints an LL(1) parsing table. Includes sample grammars, Makefile, and a PowerShell build script for Windows.
c parsing compiler algorithms context-free-grammar parsing-table left-recursion ll1-parser left-factoring first-follow
-
Updated
Sep 12, 2025 - C
18CSC304J Compiler Design Lab codes
regular-expression lexical-analysis syntax-analysis nfa dfa semantic-analysis predictive-parsing quadruple left-recursion-elimination left-recursion nfa-implementation nfa-to-dfa-conversion paser first-and-follow left-facto
-
Updated
Feb 24, 2023 - C++
Task 5 for the Compilers lab where the needed deliverable is a class that takes a CFG without unit rules and epsilon closures and outputs the same CFG after eliminating Left Recursion
-
Updated
Apr 7, 2024 - Java
This open-source project is a tool for analyzing context-free grammar (CFG) productions.
-
Updated
Sep 5, 2023 - C
Improve this page
Add a description, image, and links to the left-recursion topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the left-recursion topic, visit your repo's landing page and select "manage topics."