Search Results for "binary code generator" - Page 2

NLT is free, open-source C# lexer and GLR parser suite -- which translates to ability to parse ambiguous grammars. Grammar can be defined directly in code or (preferably) in separate file (lex/yacc-like) for included generator. If you understand/guess the meaning of grammar in C#: // scanning lexer.AddStringRule(")", match => SymbolEnum.RPAREN); // parsing prod_builder.AddProduction(SymbolEnum.exp, SymbolEnum.LPAREN, SymbolEnum.exp, SymbolEnum.RPAREN, (_1, e, _3) => (AstNode)e); or grammar in NLT format: // scanning /[A-Za-z_][A-Za-z_0-9]*/ -> IDENTIFIER, IdentifierSymbol.Create($text); // parsing program -> list:namespace_list { new Program(currCoords(), (Namespaces)list) }; you should be able to use it :-). ...

Java-based BURG (code emitter generator), used by Adobe ASC 2.0 and Apache Falcon ActionScript compilers.

JFlex is a flex-like lexer generator for Java with emphasis on speed and full Unicode support. It has some not so usual features like negation in regexps and nested input streams. Also reads JLex specifications unchanged.

JS/CC is a parser generator for JavaScript/ECMAScript, which is entirely written in ECMAScript itself. It produces LALR(1) parsers with integrated lexical analyzers. JS/CC can run as a website or be invoked from a console, and runs on several platforms.

Coco/S is a compiler generator that takes plain EBNF grammar files and features a SAX style call back API. It is written in Java and produces a Java Scanner (Lexer) and Parser for the language described by the input grammar. Coco/S is a branch of the 2010/11 release of Coco/R for Java. While Coco/R takes an attributed grammar file, Coco/S has a callback API. This has the advantage of a clean separation between grammar (EBNF) and Compiler/Interpreter.

A parser generator for PEG grammars, built using Java, currently producing code for Java.

After a program has been thrown into the world in binary form, it can boomerang back as source code. The Boomerang reverse engineering framework is the first general native executable decompiler available to the public.

JTools provides some useful tools and utilities for Java 5.0 development. Beneath some smaller utilities we have: a (Ant like) DAO framework (also including XML Repository) and a (JSP like) general purpose template generator and execution framework.

Waxeye is a parser generator based on parsing expression grammars (PEGs). It supports C, Java, Javascript, Python, Ruby and Scheme.

Reblok build an Abstract Syntax Tree (AST) from a python bytecode (typically found in .pyc files).

This project will help you to expose C++ libraries to Python. pygccxml package is an object oriented framework for reading C++ declarations. pyplusplus package is an object-oriented framework for creating a code generator for boost.python library.

ZASM is a 2 pass assembler for Zilog's 8-bit CPU Z80. Supported platforms: Unix-style OS, e.g. MacOS X, Linux, BSD. Special support for ZX Spectrum emulator file formats. Binary or intel hex file output.

MUgen is an emulator generator which works in a way similar to yacc. It takes an input machine description and outputs a source file which is a fully implemented emulator of that system. This is the open-source system.

A parser generator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.

Generate a parser at runtime from a collection of C++ objects. Concisely state a parser specification in ordinary C++ code. Learn from a parser generator with an object-oriented design.

lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.

ParGeL is an LALR(k) parser generator, which allows creation of inheritable parsers in runtime and compile time environments. ParGeL is written 100% in Java.

Complete LALR(1) parser generator and engine (like BISON or YACC) but it's all done in PHP, and the input grammar is easier and more maintainable. Write your actions in PHP. Generate PHP output code. Drive your parser with PHP. Wanna make a language?

re2clexer is a wrapper around the scanner generator re2c. It simplifies the creation of re2c based lexers by performing the task of buffer management.

CSP Canonical LR(1) Parser Generator. Includes lexer and parser generator. Supports all OS. Produces code as standard ANSI C++ w/ minimal STL and usable in commercial or non-commercial purposes.

More Than Parsing is a parser generator for context free grammars defined in a BNF-like format. It generates scanners, parsers, ASTs, etc. This sf project is no longer active, development will continue in a different place.

Covra is a project to help design compilers. C3 is a tool specialized on the easy design and construction of ASTs, it is independent of the compiler compilers or parser generator that is used. It generates Java and C# code. Require JRE 1.6.0.

JetPAG is a recursive-descent parser and lexical analyzer generator focused on high efficiency, usability and readability of generated code. JetPAG generates fast recognizers and aids developers with useful tools for simplifying input interpretation.

BNF for Java is a BNF Compiler-Compiler, or Parser-Generator. It implements ISO Standard Backus-Naur Format, using Java. BNF allows you to create a syntax, or a complete language, to parse your data source. Your custom Java extensions generate output.

{sets} is a lightweight constraint programming language. The uniqueness of {sets}, is that it uses ROBDD ( Reduced Ordered Binary Decision Diagrams ) to represent and solve constraints.