Search Results for "rules"

A programming language AL-IV (ALFOUR) is a high-level imperative object oriented programming language with minimal introduction level, easy porting to any platform claiming a very high level of safety and stability, with a controllable level of code protection, high efficiency of an executable code, full independence from a target platform, minimal enter level.

...The expression language supports numbers, strings, external variables, arithmetic, comparisons, regular expression matching, and logical operations. Overall, it gives applications a safer way to let users define dynamic rules and filters.

...For example, if you want to use f-strings, type annotations, or other Python 3.x niceties but have to deploy on a machine that only has an older interpreter, py-backwards rewrites your code to an equivalent, earlier syntax. It does this by parsing the source into an abstract syntax tree (AST), applying transformation rules, and emitting compatible code. This allows teams to write forward-looking Python without immediately upgrading all their runtime environments. The project is particularly handy for packaging, CI, or on-prem situations where upgrading Python is slow or impossible. It aims to preserve behavior, keep the diff small, and support multiple modern features as they appear.

Xsemantics is a DSL (implemented in Xtext itself) for writing type systems, reduction rules, interpreters (and in general relation rules) for languages implemented in Xtext. It then generates Java code that can be used in your language implemented in Xtext for scoping and validation (it can also generate a validator in Java).

The Open Fortran Project (OFP) provides a Fortran 2008 compliant parser and associated tools. These tools provide a Java and C API for actions called when parser rules are completed. It also provides Fortran interfaces to the OpenCL runtime (new). IMPORTANT NOTICE: The Open Fortran Project has switched to using a parser based on SDF (Syntax Definition Formalism). Please consider using our new work at https://github.com/OpenFortranProject/ofp-sdf. While the SDF parser is not as advanced as the ANTLR-based parser, it provides much more capabilities, including a term rewriting system for creating a Fortran AST (Abstract Syntax Tree) using Stratego/XT (see http://strategoxt.org) and other custom program transformations. ...

PackCC is a packrat parser generator for C, which can handle PEGs (Parsing Expression Grammars) very efficiently, and can support direct and indirect left-recursive grammar rules.

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,...

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.

Try Scheme is a Scheme interpreter that runs in your web browser. No installation. Just click and go. Full support for continuations and syntax-rules macros!

HiLexed 2 is a dynamic hierarchical LL-parser system with integrated lexing. It features a powerful unlimited look-ahead, look-ahead compression*, dynamic rules and left-recursion*. * = Under development

... visualizes EBNF (Extended Backus Naur Form). Therefore an .ebnf File is required, which contains rules written in EBNF. The program parses the rules, visualizes them as syntax diagrams and is able to generate .gif and .emf files for further use.

C++ STL-based parser toolkit that allows the specification of EBNF-like grammars (using operator overloading) and the conversion of arbitrary input (text, tokens or other) to user-defined structures through events attached to grammatic rules.

RuleWorks is a rules-based application development tool providing the convenience of cross-platform development combined with one of the most powerful high level rules-based languages and fastest inference engine.

Tools for enforcing projects architecture specifications. Identification of "patterns" based on nomenclature rules. Validation of conformance to architecture rules. Query-based investigation. Statistics. Metrics.

Description language based on XSD and rules stored in a centralized directory intend to allow development of applications from static descriptions.