Evaluates infix mathematical expressions by converting to postfix (reverse polish) expressions
-
Updated
Mar 6, 2021 - Java
Evaluates infix mathematical expressions by converting to postfix (reverse polish) expressions
A procedural programming language, interpreted in C, influenced over hindi-based scriptures, with informal linguistic patterns roughly translating into computer readable grammar.
A xml/wikipedia dump parser and processor written in C
A general plain text templating, parsing and processing engine
ML modeling for house price prediction in Belarus
Parsing and text editing utilities for TypeScript.
Bash replica done in pure C (42 common core)
🛑 [DEPRECATED] Quik was a LaTeX-like parsing engine.
Packages for creating, analyzing, and manipulating context-free grammars, and parsing context-free languages in Go.
Parsing library for fast prototyping
Simple, fast, powerful parser toolkit for JavaScript.
A simple library for language and compilers building
Unicode Parser generator. Ordered grammar choices, similar to PEG parsing. Top-down, table-driven, arbitrary lookahead, right-recursive. (Plus demo full algol 60 parser)
Squirrel Execution Engine Server
Mirror of marpa @ core.tcl.tk/akupries -- Tcl binding for Marpa
FileUtil - C# File Parser for fixed width or delimiter separated files.
Parser for YAML, JSON and NEON templates.
A PHP-based OPML Parser Class. Extracts the properties of content from OPML files
Add a description, image, and links to the parsing-engine topic page so that developers can more easily learn about it.
To associate your repository with the parsing-engine topic, visit your repo's landing page and select "manage topics."