A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
-
Updated
May 27, 2019 - 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.
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
Trabajo relacionado a la segunda unidad en la materia de Lenguajes y Autómatas en la Universidad Politécnica de Victoria
Recognizes a formatted Backus-Naur form rule-set and solves left-recursions, performs factoring, and finds first sets.
Repeat langage Interpreter