A Java implementation of various procedural name generation algorithms, including combinatorial, consonant vowel, context-free grammar, and Markov chain.

LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))

🎲 Efficient Java implementation of the probabilistic Earley algorithm to parse Stochastic Context Free Grammars (SCFGs)

Implementation of a pushdown automaton (PDA) in Java for learning purposes

A simple compiler for parsing java codes and get syntax errors with CYK algorithm for context free grammars (CFG)

A Parsing-as-Deduction system that parses with different parsing algorithms and some related tools for educational purposes.

Procedural Generator. Based on L-Systems (with Context Free Grammar rules).

GLL-based context-free path querying algorithm

Application to calculate the probability of a given hand for a deck defined at runtime. In which what is being calculated is determined by the chosen configuration file. Probability is calculated through simulation.

Responsive and Intuitive Parsing for the Analysis of Language - Regular Expression, LL1, LR0, SLR1 and LR1 parsing

Course Project for CS536 Intro to PLs and Compilers

Sugar for building and running context-free transducers in Java

Implementation of the GLL-based context-free path querying (CFPQ) algorithm as Neo4j Stored Procedure

An implementation of the shunting yard algorithm by Edsger Dijkstra and a postfix stack evaluator.

💬 Implementação do algoritmo CYK para gramáticas livres de contexto. Exercício programa de Introdução à Teoria da Computação

A random poem builder using provided Context Free Grammer!

Generate the first, follow and predict sets of a given context-free grammar

A LL1 algorithm implementation for CFG and string recognition.

An implementation of multiple concepts and techniques related to the theory of computation and compilers like DFA, NFA, Regular Expressions, Fallback DFA, CFG Left-Recursion Elimination, First and Follow, LL(1) Parsing, Lexical Analysis, and SDD

LL (1) Compiler Implementation (2017)