Math ExpressionParser using BNF
-
Updated
Feb 7, 2015 - C
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.
Math ExpressionParser using BNF
A small MongoDB Interpreter created with C .
Sublime Text plugin for automatic code alignment.
Simple parser for modified basicDTD LL(1) grammar written in Python
Mujeed (مُجيد) is a development environment for logic programming in Arabic language
A repository of all BNF metadata of publication (before 1900)
Ash - alpha shell.
Recherche Intelligence Musicale. Faire de l'OMR sur Gallica, et jouer les partitions dans Gallica.
My first toy language. Created exclusively for learning purposes.
A notepad++ language for EBNF syntax highlighting.
Parser for treebanks based on Penn Treebank type of encoding that generates Probabilistic Context Free Grammars
A simple Recursive Descent Parser for a simple EBNF.
Recursive descent parser for compilers class
NatLang is an English parser with an extensible grammar