Search Results for "rules"
Sort By:
Showing 30 open source projects for "rules"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
1
parcel/css
A CSS parser, transformer, and minifier written in Rust
...Built on the cssparser and selectors crates created by Mozilla and used by Firefox and Servo. These provide a solid general-purpose CSS-parsing foundation on top of which @parcel/css implements support for all specific CSS rules and properties. One of the main purposes of @parcel/css is to minify CSS to make it smaller. This includes many optimizations. -
2
Glslang
Khronos-reference front end for GLSL/ESSL, partial front end for HLSL
To use the standalone binary form, execute glslangValidator, and it will print a usage statement. Basic operation is to give it a file containing a shader, and it will print out warnings/errors and optionally an AST. Instead of building manually, you can also download the binaries for your platform directly from the master-tot release on GitHub. Those binaries are automatically uploaded by the build bots after successful testing and they always reflect the current top of the tree of the... -
3
Lebab
Turn your ES5 code into readable ES6
...The recommended way of using Lebab is to apply one transform at a time, read what exactly the transform does and what are its limitations, apply it to your code and inspect the diff carefully. Transforms can be applied with relatively high confidence. They use pretty straightforward and strict rules for changing the code. The resulting code should be almost 100% equivalent to the original code. Transforms should be applied with caution. They either use heuristics that can't guarantee that the resulting code is equivalent of the original code, or they have significant bugs which can result in breaking your code. -
4
The Tengo Language
A fast script language for Go
...Tengo is fast and secure because it's compiled/executed as bytecode on stack-based VM that's written in native Go. Securely Embeddable and Extensible. Compiler/runtime written in native Go (no external deps or cgo). Executable as a standalone language / REPL. Use cases, rules engine, state machine, data pipeline, transpiler. If you need to evaluate a simple expression, you can use Eval function instead. -
Paessler: Easy to Use With Enterprise Power. Free TrialYou shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
-
5
BSC
Bluespec Compiler (BSC)
...It translates Bluespec descriptions into synthesizable Verilog, letting developers bring typed, modular abstractions into mainstream FPGA/ASIC flows. The compiler performs scheduling of atomic rules, elaborates parameterized modules, and enforces interface contracts, producing predictable RTL that integrates with existing EDA tools. A companion simulator enables fast functional execution and debugging before handing designs to traditional verification and synthesis stages. The ecosystem includes standard libraries, FIFOs, interfaces, and utilities that encourage reuse and clean separation of datapaths and control. ... -
6
Vanga
Structure-routed visual compiler: recognize and automate GUIs in YAML
...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. -
7
AL-IV
ALFOUR Programming language. Simple, safe, power, multi-platform.
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. -
8
RE/flex lexical analyzer generator
The regex-centric, fast lexical analyzer generator for C++
A C++ high-performance regex library and Flex-compatible lexical analyzer generator with full Unicode support, new indentation anchors, lazy quantifiers, and many other modern features. Accepts Flex lexer specification syntax and is compatible with Bison/Yacc parsers. Generates reusable source code that is easy to understand. Supports fast scanning of UTF-8/16/32 files, strings, and streams. The reflex scanner generator generates clean C++ lexer class code that is thread-safe. Generates... -
9
XBNF Neurotranslator compiler
(X)BNF simple and clever translation grammar compiler
XBNF Neurotranslator is a powerfull extended BNF grammar language to handle translations easily and many features to handle different kind of situations. This project is for common arch binaries, C++ sources, tests & support tickets. No installation, juste get binary for your architecture : > See [Files] > binary.{version} Library of smart samples of grammars> https://sourceforge.net/projects/xbnf/ Docker image which embeds the Linux/64bits binary and the... -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
10
GroIMP
Growth-grammar related Interactive Modelling Platform
...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 -
11
M2SQL
Replicate your Mumps Globals into Relational Data Base
M2SQL is a handy tool that permits to map your existing Mumps Globals in a relational Vision. The mapping process is simple and intuitive and is done only once. The Mapping process will describe the Mumps Globals data as a complex of Applications, Hierarchies, Relations and fields. Once mapping is completed you will able to replicate all the Mumps data into Target Relation database such as SQLITE or MYSQL. Normally you will do the replication process once a day while system is... -
12
Lexical Analyzer Generator Quex
Generator of lexical analyzers in C and C++. Unicode Supported.
The goal of this project is to provide a generator for lexical analyzers of maximum computational efficiency and maximum range of applications. This includes the support for Unicode (UTF8, UTF16, ...) and a large variety of other encodings directly and via nested converters such as ICU(tm) and IConv. Sophisticated buffer handling allows to operate on plain file streams, on sockets, or manually fed buffer content. 'Ready-to-build' examples explain related concepts and facilitate practical... -
13
Filtrex
A simple, safe, JavaScript Filter Expression compiler for end-users
...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. -
14
Py-backwards
Python to python compiler that allows you to use Python 3.6 features
...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. -
15
Xsemantics
a DSL for type systems, reduction rules, interpreters for Xtext langs
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). -
16
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. ...
-
17
IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.
-
18
qtBisonC++ is a general-purpose parser generator that converts a grammar description for an LALR(1) context-free grammar into a QT C++ program to parse that grammar. qtBisonC++ reads the given input files for a description of a scanner to generate. The description is in the form of grammar in Backus-Naur Form (BNF), called rules. qtBisonC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'. This file is compiled with your code to produce an executable. When the executable is run, it analyses its input to verify that its correspond to the grammar.
-
19
qtFlexC++ is a tool for generating scanners: programs which recognized lexical patterns in text. qtFlexC++ reads the given input files for a description of a scanner to generate. The description is in the form of pairs of regular expressions and C++ code, called rules. qtFlexC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'. This file is compiled with your code to produce an executable. When the executable is run, it analyzes its input for occurrences of the regular expressions. Whenever it finds one, it executes the corresponding C++ code.
-
20
Kayacc
A Compiler Development Toolkit
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,... -
21
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.
-
22
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.
-
23
JavaScriptFlash: Compiling JavaScript to SWF JavaScriptFlash is a web-based platform to support the JavaScript web programmers to develop Flash applications in JavaScript. It compiles the JavaScript code following certain rules into a Flash SWF file
-
24
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!
-
25
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
