Search Results for "rules"

...You describe the interface in plain YAML: tokens are pictures matched under a discipline, lexemes their spatial arrangements, with OCR for the content that changes. On a match it drives the GUI (click, type, route text); the logic turns a recognized screen into what to do — a watched value with prose rules, or a neighbourhood rule table over a tiled grid. The shipped examples are pure grammar, no Java: a calculator automator and a Minesweeper solver. Java 21, MIT-licensed. See VANGA_DESIGN.md.

C3PO is a software synthesis tool that provides a solution for building maintainable, reliable and robust software infrastructures and/or compiler frontends from a set of attributed grammar rules in EBNF notation.

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.

...It exhibits several features which makes itself suitable for the field of biological or ALife modelling: The “modelling backbone” consists in the language XL. It is fully integrated, e.g., the user can interactively select the rules to be applied. GroIMP provides classes that can be used in modelling: Turtle commands, further geometrical classes like bicubic surfaces, the class Cell which has been used in the Game Of Life implementation, and so on. The outcome of a model is visualised within GroIMP. In the visual representation of the model output, users can i

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

The LALR parser generator (LPG) is a tool for developing scanners and parsers written in Java, C++ or C. Input is specified by BNF rules. LPG supports backtracking (to resolve ambiguity), automatic AST generation and grammar inheritance.

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

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.