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.
Parse BNF grammar definitions
Functional Meaning Representation and Semantic Parsing Framework
A parser for nondeterministic context free languages
A GNU Emacs major mode for editing BNF grammars
⌥ Simple Backus–Naur form (BNF) LaTeX package
Syntax highlighting for ABNF/BNF/EBNF, Yacc, and other language-related languages.
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.
Updated version of the LaTeX rail package for Syntax specification in EBNF (https://www.ctan.org/pkg/rail)
Programming Language Toolkit
NeoVim semantic syntax highlighting and completion plugin for BNF grammar
Compiles EBNF statements to C# DLLs
This project parses and evaluates arithmetic expressions using recursive descent parsing based on BNF grammar rules.
Building a simple programming language based on arithmetic expressions using a top-down recursive descent parser written in Python and C.
Haskell server that parses Backus-Naur form expressions (syntax only)
Recursive descent parser for compilers class
BNF (Backus-Naur Form) LL(k) parser.
🧠️🖥️2️⃣️0️⃣️0️⃣️1️⃣️💾️📜️ The sourceCode:Backus-Naur-Form category for AI2001, containing Backus-Naur Form programming language datasets
Recursive Descent Parser for a Programming Language.