Search Results for "parse tree" - Page 2

Traditionally, XML is parsed either by an event-based parser or by a tree-based parser. Event-based parsers are fast and have minimal memory consumption, but implementing the event handlers is cumbersome. Tree-based parsers result in code that is easier to develop, to understand and to maintain, but have high memory consumption as the whole parse tree needs to be kept in memory at the same time. JavaXMLFrag is a partial parse tree based parser, where only parts of the parse tree need to be kept in memory at the same time. ...

Plinko was originally an experiment with Prefix Trees and log parsing. The general concept is to have a single end point you can send any data to, in a "fire and forget" fashion. Plinko should identify and parse the data completely without the sending system caring what it sent. The latest version supports named fields in the STL files for tagging data parsed in the Prefix Tree and anonymous functions for parsing dynamic message payloads. We now output JSON objects and I'm working on HBase integration. By outputting to JSON it also leaves open the possibility for on the fly in memory correlation between events. ...

...Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token to the parser method associated with that event. A lexer can dispatch token events to any number of parsers. JPlex is steadily being improved, and the Subversion repo will almost always be newer and better than the binary download.

htmldom parses the HTML file and provides methods for iterating and searching the parse tree in a similar way as Jquery. To report bugs please mail me at bhimsen.pes@gmail.com

PTFS - is a file system allowing to navigate through parse tree. It uses parsing expressions grammar to construct file system structure (parse tree) for the given text.

BlockIt provides a Python framework to scan and parse a program file into constituent nested blocks, however defined, forming a block tree of your code and can be used as a mechanism to "extend" in some sense, the underlying programming language.

CLI Parser provides a framework for quickly development of Cisco-like CLI commands. It provides a simple syntax to define CLI commands, a compiler to automatically convert these commands into a C parse tree and a run-time library to create CLI.

Simple library to parse C++ header files and retrieve a list with the description of the elements defined. The initial purpose of the project was the creation of a tool to check the syntax of header belonging to a given project.

Small footprint C++ library to extract an XPath 1.0 expression from an XML tree. Uses the TinyXML project to parse XML trees and store intermediate results. Runs on any platform. Optional use of STL. Overhead less than 100KB, including TinyXML.

HappyDoc is a tool for extracting documentation from Python source code. It differs from other such applications by the fact that it uses the parse tree for a module to derive the information and does not import the module.

cTool is a library to scan and parse C code, building a tree data structure that can be accessed by other programs to assist in analyzing the code.

The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.

...A simple BNF style language is used to describe scanner and parser in a UTF-8 source file. The output is described with a template language that is used to add formatting to the parse tree. Code is generated that automatically traverses the parse tree and calls a method on a transformer object to modify the parse tree. Each node is visited in document order, and a method is called at the beginning and end of each node visit. This transformer class is subclassed for customization. SimpleCompiler has many built-in feature for supporting a variety of text based language.