Generate a sublime-syntax file from a non-left-recursive, follow-determined, context-free grammar
-
Updated
Dec 6, 2021 - 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.
Generate a sublime-syntax file from a non-left-recursive, follow-determined, context-free grammar
🔯 A tiny parser for a dynamic strong typing programming language based on PL0.
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
Small little context-free expression generator and parser using user provided EBNF-like source.
Programmes développés (à titre personnel) pour l'utilisation du SRU (web service) du catalogue BnF
convert bnf files, to LaTex notations, supporting multiple LaTex BNF packages as back ends
BNF parsing, formal grammar conversion, and string generation utilities in Python
Recognizes a formatted Backus-Naur form rule-set and solves left-recursions, performs factoring, and finds first sets.
Simple SAT solver implementation using python. It also includes a BNF to CNF converter
Principles of Programming Languages Autumn 2019 Course Exercises.
Lecture notes, assignments, and other materials for a one-semester course on programming language concepts and theory, interpretation and compilation, and programming paradigms.
Automatically generate VIM and emacs coloring from BNF grammars (Automatically exported from https://code.google.com/p/autohighlight)