Trabajo relacionado a la segunda unidad en la materia de Lenguajes y Autómatas en la Universidad Politécnica de Victoria

Repeat langage Interpreter

Backus–Naur form analyser implemented in Ada

Programming Language Theory

Basic calculator program demonstrating the use of a parser generator for reading user input.

(beta version) Something like extended Backus-Naur form in C++ & the sample json parser using cebnf.

How I'm writing TODOs

A notepad++ language for EBNF syntax highlighting.

Kodama is a simple lightweight language implemented in Haskell and designed for statistics.

🧠️🖥️2️⃣️0️⃣️0️⃣️1️⃣️💾️📜️ The sourceCode:Backus-Naur-Form category for AI2001, containing Backus-Naur Form programming language datasets

Recognizes a formatted Backus-Naur form rule-set and solves left-recursions, performs factoring, and finds first sets.

This project parses and evaluates arithmetic expressions using recursive descent parsing based on BNF grammar rules.

⚡C-based lexical analyzer using Backus-Naur form. Matches lexemes to tokens, handles delimiters, and identifies unknown lexemes from a source file.

Haskell server that parses Backus-Naur form expressions (syntax only)

Backus Naur Format Transform

Building a simple programming language based on arithmetic expressions using a top-down recursive descent parser written in Python and C.

Recursive descent parser for compilers class

BNF (Backus-Naur Form) LL(k) parser.

Compiles EBNF statements to C# DLLs

Programming Language Toolkit