First and follow set solver in Javascript
Find First and Follow of a Context free grammar
LL(1) parser toolkit in C — left factoring/recursion elimination, FIRST/FOLLOW computation, parse table generation, and stack-based string parsing with debug output.
Compiler Design course lab work in C++ — lexical analysis, identifier/keyword validation, regex matching, FIRST & FOLLOW sets, and intermediate code generation.
A compiler front-end for a custom programming language, implementing lexical analysis using tries and parsing using LL(1) grammar with FIRST and FOLLOW set computation. Includes multiple test cases for validation of syntax and error handling.
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.
A C++ implementation for computing FIRST and FOLLOW sets of a grammar to aid in LL(1) parser construction.
To associate your repository with the first-follow topic, visit your repo's landing page and select "manage topics."