Trabajo relacionado a la segunda unidad en la materia de Lenguajes y Autómatas en la Universidad Politécnica de Victoria
-
Updated
Apr 7, 2024 - Python
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
Trabajo relacionado a la segunda unidad en la materia de Lenguajes y Autómatas en la Universidad Politécnica de Victoria
(beta version) Something like extended Backus-Naur form in C++ & the sample json parser using cebnf.
🧠️🖥️2️⃣️0️⃣️0️⃣️1️⃣️💾️📜️ The sourceCode:Backus-Naur-Form category for AI2001, containing Backus-Naur Form programming language datasets
⚡C-based lexical analyzer using Backus-Naur form. Matches lexemes to tokens, handles delimiters, and identifies unknown lexemes from a source file.
Parse BNF grammar definitions
⌥ Simple Backus–Naur form (BNF) LaTeX package
Basic calculator program demonstrating the use of a parser generator for reading user input.
BNF (Backus-Naur Form) LL(k) parser.
Programming Language Theory
A GNU Emacs major mode for editing BNF grammars
Syntax highlighting for ABNF/BNF/EBNF, Yacc, and other language-related languages.
Functional Meaning Representation and Semantic Parsing Framework
Programming Language Toolkit
A parser for nondeterministic context free languages
Backus–Naur form analyser implemented in Ada
Recognizes a formatted Backus-Naur form rule-set and solves left-recursions, performs factoring, and finds first sets.
Kodama is a simple lightweight language implemented in Haskell and designed for statistics.
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
A basic C language compiler from scratch.