Search Results for "simple decision tree"

...The read-write head itself is a state engine, which is affected by the input from the track, and which decides what to write on the track, and where to read the next input, by "moving" the head back or forth. In 5050, the part of the track left of the head is represented not by a line or stack of information, but by a binary tree. The part right of the head is represented by a binary tree, too. The head itself sort of sits between the two trees, but will often change its state according to information from the right side of the left side. In 5050, the state of the head itself is again represented as a tree of commands, although for simple programs, a linear representation can be sufficient.

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.

Initially a simple C# EBNF file parser that construct the expression tree.

A simple XML taglib processor. It reads in an XML document and, based on XML namespaces, chooses a library to handle the part of the XML tree within that namespace. The result is a new XML document.

This is a cross-platform C++ library that provides an intuitive and quick way to deal with tree structured configuration text files. It is also very small, making it easy and comfortable to include in any project.