a simple formatter that convert the infix notation into postfix notation then parse it to get the value
-
Updated
May 26, 2018 - 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.
a simple formatter that convert the infix notation into postfix notation then parse it to get the value
In this project, I tried to parse and report the streaming data made with ADTF (Automotive Data and Time-Triggered Framework) DAT, and to notify according to TimeStamp. Additionally, we are trying to support outputting an image whether a normal notification has been reached.
Lexemn is a high level programming language for interpreting and evaluating mathematical expressions. It will also feature the capability to plot functions and solve basic equations.
C++ implementation of parsers for the Grammars on succinct lipid nomenclature (Goslin).
As of 2018-06-04, this repository can be found here: https://gitlab.com/publishing-systems/CppStAX
A simple program to convert text representations of math expressions between different formats, such as Mathcad and LaTeX.
simple python compiler by using flex\bison
Compiler for FlatB language
R implementation of parsers for the Grammars on succinct lipid nomenclature (Goslin).
[univeristy project - year 1] Json Parser
Command line calculator capable of calculating simple arithmetic expressions and working with variables
Modern C++ PNG encoder/decoder