Search Results for "grammar"

This library implements PEG (Parsing Expression Grammar) parsers, which can be embedded in a C++ program. The grammars are built and interpreted at run time, without an intermediate code generation stage. It tries to mimic as closely as possible the functionality and style of Ian Piumarta's LEG compiler. LEG grammars can be translated easily and almost mechanically. Actions and semantic predicates can be written directly in the grammar, using lambdas.

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

Calculators became available in the early 70's, soon after the integrates circuits, and several companies were competing with each other for a share of this market. Texas Instruments was one of the bigger companies producing calculators. With RCL it is possible to recreate the TI calculators, strating with the Ti59e, with 960 program steps and a persistant memory (a combination of the the Ti58C and the Ti59). RCL offers any person interested in the ancient ones in calculators (more...

Kayacc is an alternate name for the TOMBO project. I am in the process of updating the Tombo project page with version 2.1.0. Please download Tombo2.1.0.tar.gz from the Files tab. Tombo is a compiler generation toolkit for constructing compilers and interpreters. It includes a BNF compiler that generates parsers for context free grammars, and a class library to support compiler development. The class library supports symbol tables, Unicode text manipulation, reserved word mappings,...

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.

Kaptain is a universal graphical front-end for command line programs. Grammar scripts describe the possible parameters for command lines and Kaptain brings up a user friendly dialog for that. Package contains front-ends for Enscript, Indent, Procmail

Funky is a tiny, embeddable, functional programming language inspired from lisp. Its grammar is small and unambiguous, which makes it very easy to write a script in Funky, which you could embed in any program.

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.

JScript is Java Interpreter that parse and execute pure java code and share the resource with current JVM. In addition, a java command line console is included. It's easy to create script program in Java grammar by it.

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?

Runtime grammar engine for cross-platform Java-based applications.

JSGold is a GOLD Parser Engine in C++ for generating context-free grammar parsers in javascript.

Pure Python implementation of GOLD Parser Engine. GOLD Parser Engine is a LALR(1) parser with DFA tokenizer. It uses compiled grammar table generated by GOLD Parser Builder (not included - available on http://www.devincook.com/goldparser)

An extensible Java implementation of the W3C XQuery language. The project aims to provide a generic XQuery parser (written with JavaCC), translation to the XQuery core grammar, modularised query optimisation, and an open XMLSchema type system.

OpenZz is a dynamic parser which allows its grammar to be extended by commands written in its own Zz language. Due to the interpreted and dynamic nature of the parser OpenZz can be used to develop both fast language prototypes and full compilers.

C-smile OOL is a scripting language with C++-like grammar. It has compiler, VM running bytecodes and C++ extendible runtime. Intended to run in standlone and embedded mode.

The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.