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.
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).
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
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
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
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
Implements the C++ parser class usable for finding the matches in the input using regular expression. The regular expression pattern is a parameter in parsers constructor. Also allows to retrieve subexpressions matches in few steps. Supports wide chars.
Linear time, dynamic API for lexical analysis and parser generation. Allows for a text-based specification of formal languages with the well-known regular-expressions approach, and using Parsing Expression Grammars as the underlying engine.