Search Results for "tree"

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

TCUI is a Graphical User Interface for mobile devices, running on Java 2 Microedition. So, this lighweight (only 47 KiB) library provides you automatic GUI. Components: Window, Pane, Tree, List, Menu, Text, Label, Combo, Check, Soft bar, Popup menu.

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.

Annotate your POJOs to create a fully-functional application, with table support, collection filters, and persistence hooks.

XML Tree Object Model (XTOM) is a java 1.4 based XML parser. It is designed to be easy and simple to use for parsing XML configuration files. It uses the notion of a Tree to hold XML Elements and implements a path based element navigation system.

NQXML is a pure Ruby implementation of a non-validating XML processor. It includes an XML tokenizer, a SAX-style streaming XML parser, a DOM-style tree parser, an XML writer, and a context-sensitive callback mechanism.

This is very simple not validating XML parser that was ported for Palm OS. It was written purely on STL. This parser can not build DOM but there is template tree class to perform this task.