Updated version of the LaTeX rail package for Syntax specification in EBNF (https://www.ctan.org/pkg/rail)
-
Updated
May 21, 2017 - TeX
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.
Updated version of the LaTeX rail package for Syntax specification in EBNF (https://www.ctan.org/pkg/rail)
A notepad++ language for EBNF syntax highlighting.
Haskell server that parses Backus-Naur form expressions (syntax only)
Repeat langage Interpreter
Recursive descent parser for compilers class
Compiles EBNF statements to C# DLLs
Building a simple programming language based on arithmetic expressions using a top-down recursive descent parser written in Python and C.
NeoVim semantic syntax highlighting and completion plugin for BNF grammar
A basic C language compiler from scratch.
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
Kodama is a simple lightweight language implemented in Haskell and designed for statistics.
Recognizes a formatted Backus-Naur form rule-set and solves left-recursions, performs factoring, and finds first sets.
Backus–Naur form analyser implemented in Ada
A parser for nondeterministic context free languages
Programming Language Toolkit
Functional Meaning Representation and Semantic Parsing Framework
Syntax highlighting for ABNF/BNF/EBNF, Yacc, and other language-related languages.
A GNU Emacs major mode for editing BNF grammars
Programming Language Theory
BNF (Backus-Naur Form) LL(k) parser.