Search Results for "syntax tree model"

UniCC (UNIversal Compiler-Compiler) compiles an augmented grammar definition into a program source code that parses the described grammar. Because UniCC is intended to be target-language independent, it can be configured via template definition files to emit parsers in almost any programming language. UniCC comes with out of the box support for the programming languages C, C++, Python (both 2.x and 3.x) and JavaScript. Parsers can also be generated into JSON and XML.

Front provides a compiler front end generator that can generate a parser, pretty printer, symbol table handling, and Abstract Syntax Tree data structures and traversals. It also provides a C preprocessor library, and an AST rewriter generator.

The goal of this project is to create a simple and easy to use parser generator that will accept a textual grammar file as an input and output modularized classes representing a limited parser interface. Long term goals include a robust grammar file syntax, output suitable for multiple programming languages, and tools for better integrating compiler functionality, parse tree manipulation, and FSM based scanner generation.

Application simplifies the development and management of VHDL projects. The project is displayed in a well-arranged tree structure depending on the hierarchy of entities. It also helps to maintain projects in a consistent state. Other features include automatic generation of VHDL testbenches and structures based on user-defined templates. The NetBeans platform is used as a basis for the implementation.

Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing environments, it supports unicode, reentrancy and offers thread-safeness.

Application defines templates of VHDL structures, which allows us comfortly generate most used VHDL structures. It can also work with VHDL testbench templates from which can be created VHDL testbenches of existing projects.

metaDSL provides a framework which eases creation of BNF grammars, parser generators and code generators. Executes as a Maven plugin or from the command line via a lightweight launcher powered by Maven runtime. See also: http://www.metadsl.com/

Extension of the CUP parser generator for working with abstract syntax trees (ast). Implements support for class hierarchy generation and automatic tree building from CUP grammar specification files. Version 10k of CUP is used.

Javast is a Java API for creating an Abstract Syntax Tree of java source code (the equivalent of an XML DOM) in memory and then writing this to a file or bytestream as formatted source code. It is mainly useful for java code generation.

MeMo (stands for Meta-Model) is planned as Generic Programming Language & IDE, as flexible & smart as it is possible for computer application, including adjustable syntax, algorithm reduction. Ideally, it has to contain AI for interacting with the user.

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.

AST Reproduce is a plugin for the Eclipse IDE. The purpose of this plugin is to generate code, that creates an Abstract Syntax Tree (AST) node. AST Reproduce expects as input an example AST node.

The Abstract Syntax Description Lanuguage (ASDL) is a language designed to describe the tree-like data structures in compilers. Its main goal is to provide a method for compiler components written in different languages to interoperate.

ebnf2yacc is a tool to help write yacc parsers/compilers. It takes as input a grammar written in bnf (ebnf support is planned), and outputs a c++ abstract syntax tree that supports the visitor pattern, along with a yacc parser that builds the tree.