Poe is a small, fast, flexible scripting language.
...However, writing the language was a fantastic academic exercise and the source code is available freely as a reference to anyone who may be interested.
The entirety of the source code was written by me, Ricky Stewart, with the exception of the parser which is generated from Flex/Bison.
Common Text Transformation Library of C++ classes and functions to parse and modify STL strings. CTTL substring classes may be compared, inserted, replaced, and parsed with EBNF grammars. Compiled program implements recursive descent LL(INF) parser.
Dapar is a universal parsing library written in C. It will interpret any grammar you give it in a BNF-like format, and constructs a matching expression tree for any given input. This makes developing a new parser for any language simple and reliable.
Includes an ABNF parser, EBNF parser, XML parser and algebraic math parser.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
This is a Data Serialization Language intended to represent a hierarchial data as a text (of ANY charset). ANY "binary" or "textual" data may be represented or marked-up as well. Extremely low redundance. Very fast parser (is similar to SAX).
A Ruby file parser/interpreter/preprocessor that comments lines of code based on conditions at the time the file is required. Very handy to implement debugging logs and code that has to be commented (not just dynamically switched off).
Lightweight XML processor; XML-POJO mapping via Java5 annotations or DTD; Preprocessing of XML documents using expression language; Binary XML; RMI friendly XML; JSON format support; XML marshall/unmarshall; HTML as XML parser; Swing XML Viewer
This is a collection of small to mid-sized tools I wrote, mostly in java. this includes an XML-Parser and a 3d engine. Please see the homepage for a closer description
A universal parsing tool and source code generator for generative programming. It extracts useful information by parsing (BNF parser generator) and generates source code by several techniques, by interpreting a scripting language for flexibility.
The fast, flexible, extensible, and easy to use C++ template class for creating your own customized math expression parser for both built-in and user-defined numerical data types. The parsed tree perform fast and can be used in multi-threaded OpenMP apps
Generate a parser at runtime from a collection of C++ objects. Concisely state a parser specification in ordinary C++ code. Learn from a parser generator with an object-oriented design.
ShaniXmlParser is a small and fast Xml/Html DOM/SAX non validating parser written in java. It can parse invalid xml files. It uses the org.w3c.dom interfaces and the jaxp interfaces. It works also on mono/.net thanks to ikvm.
lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.
ParGeL is an LALR(k) parser generator, which allows creation of inheritable parsers in runtime and compile time environments. ParGeL is written 100% in Java.
Complete LALR(1) parser generator and engine in PHP.
Complete LALR(1) parser generator and engine (like BISON or YACC) but it's all done in PHP, and the input grammar is easier and more maintainable. Write your actions in PHP. Generate PHP output code. Drive your parser with PHP. Wanna make a language?
Fast Java based PostScript parsing engine. Capable of interpreting PostScript expresions often found in PDF's and outputting results in form of a data array.
HiLexed 2 is a dynamic hierarchical LL-parser system with integrated lexing. It features a powerful unlimited look-ahead, look-ahead compression*, dynamic rules and left-recursion*. * = Under development