Search Results for "parse tree" - Page 4

RFC Reader is a GTK2+ based application for RFC browsing. It can parse the original RFC document and generate a directory tree for content browsing. Multiple documents viewing is also included.

gfortran2xml is a tool to create an XML representation of a GNU Fortran parse tree.

ActiveLink PHP XML Package provides means to parse, read, modify and output XML and XML documents without using any PHP XML libraries. Included classes are: XML, XMLDocument, XMLBranch, XMLLeaf, RSS, Tag, Tree, Branch, Leaf, File, Socket, HTTPClient.

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 use of this module is to 1)load XML data POSTed by Flash Movie; 2)parse it into tree structure; 3)provide functionality similar to ActionScript; 4)send XML data back to a Flash Movie.

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.

Text-Query-SQL is derived from the Text-Query module. Text-Query is a general purpose query parser and resolver. It is able to parse the AltaVista 'simple query' and 'advanced query' syntax. The syntax tree is then used to build a search query.

...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.

...In non-deterministic parsing, more than one syntactic interpretation is valid. This is where this project comes in. The many different possible interpretations, called parses, each of which produces a parse tree, are computed in parallel using the CUDA environment. Report on Stage 1 PDF http://tiny.cc/yp5qs HTML https://docs.google.com/document/pub?id=1iHpUBOPMwvJrWQHLHhUPHmU2t5KVieq25KItU-UbMpM&pli=1