Search Results for "trees"

Gherkin is a domain-specific language used in behavior-driven development (BDD) to describe software behaviors in a human-readable format. It allows stakeholders to write test cases in plain language, bridging the gap between technical and non-technical team members.

The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix expression parsing tools. Implementations of some lock-free shared data structures are provided.

Ox is an attribute grammar compiling system that augments Lex and Yacc specifications with definitions of synthesized and inherited attributes written in a combination of Ox and C/C++ syntax. From these augmented specifications, Ox generates ordinary Lex and Yacc specifications that build and decorate attributed parse trees. The user can specify parse-tree traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development.

The current version provides a full Ada 2022 syntax analyzer library. The analyzer parses the source and creates the syntax tree and cross reference of defining identifiers in the source. Both structures are allocated in an arena pool storage and can be released as a whole. The code source can be file, stream or a user-defined container implementing multi-line source interface. Unicode is fully supported as well as Unicode identifiers normalization checks.

Roslyn provides rich, code analysis APIs to open source C# and Visual Basic compilers. This enables you to access a wealth of information about your code from compilers, which you can then use for code-related tasks in your tools and applications. Roslyn dramatically lowers the barrier to entry for creating code-focused tools and applications, creating many opportunities for innovation.

...The project emphasizes readability and simplicity, with code structured to be easily understood rather than highly optimized. It also demonstrates key compiler design principles such as abstract syntax trees and symbol tables.

Windows desktop software tool - apk android builder, app maker. Reskin tool for developer android no coding (without coding).

DigCC is a simple, easy-to-retarget, C compiler. DigCC handles the main features of the C language, including: - complex data types (arrays, structs, and composition thereof) - dynamic structures (lists, trees, graphs, etc) The current version of DigCC targets the DigMIPS processor, and provides a runtime library with I/O and simplified heap handling (malloc/free).

Framework library with diverse applications. Assembles data components into trees based on the developer's implementation. Adaptable to automatically parse and export documents, markup files, scripts, and source code. Easily integrated with GUIs.

TreeDL (Tree Description Language) is a notation for tree structures used by programs (like syntax trees) and tool for translation of tree descriptions to target programming language, docs generation, etc. Tool's functionality can be extended by plugins.

EuLib is a C library implementing the embeddable language "Calc" and some abstract data types like lists, trees, b-trees and date/time management functions. Initially developed by Eurosoft Informatica Medica for it's own internal use, it's now LGPL.

classgen is a Java class generator. It produces classes for abstract syntax trees in compiler frontends from simple and compact specifications. Generated classes have builtin support for the Visitor design pattern.

TreeScript a next generation Java based language for inserting into and building large (proxy based) XML like object trees. It allows code and diverse data sources to be acted upon is if they were simple atomic and node type values.