Basic calculator program demonstrating the use of a parser generator for reading user input.
-
Updated
Sep 24, 2023 - 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.
Basic calculator program demonstrating the use of a parser generator for reading user input.
Simple parser for modified basicDTD LL(1) grammar written in Python
Homeworks for 'formal languages and grammars' discipline
Scala port of Haskell GF library
Developed a parser/lexical analyzer in java to assess string entered for a particular grammar.
Generates a random string from a given grammar.
Lindenmayer system interpreter using turtle graphics in Python
Tree-sitter grammar for JavaScript regular expressions with the Unicode flag set
Python implementation of the famous Coco/R LL(k) compiler generator
A QML-bindings for a library for building parsers
HGVS variant description parser