php-rule-parser - PHP Rule Engine - Parses & Evaluates JavaScript-like expressions

  •        207

If you're using PHP 5, you might want to look at version 0.4.0. You're looking at a standalone PHP library to parse and evaluate text based rules with a Javascript-like syntax. This project was born out of the necessity to evaluate hundreds of rules that were originally written and evaluated in JavaScript, and now needed to be evaluated on the server-side, using PHP.

https://github.com/nicoSWD/php-rule-parser

Tags
Implementation
License
Platform

   




Related Projects

MSM Rule Editor

  •    Java

Graphical rule editor for JBoss Drools rules. Can be easily extended to parse rules for any other rule engine. Also includes parser for HQL/SQL for rule testing on a database. Aditional plugins for rule deploy can also be obtained

dockerfile_lint

  •    Javascript

A rule based 'linter' for Dockerfiles. The linter rules can be used to check file syntax as well as arbitrary semantic and best practice attributes determined by the rule file writer. The linter can also be used to check LABEL rules against docker images. Rule files are written in yaml. See the example rule file sample_rules.yaml in the root folder of the project. The rules are implememented using regular expressions, run on one instruction of the dockerfile at a time. The rule file has 4 sections, a profile section, a general section, a line rule section and a required instruction section.

atomspace - The OpenCog hypergraph database, query system and rule engine

  •    C++

The OpenCog AtomSpace is a knowledge representation (KR) database and the associated query/reasoning engine to fetch and manipulate that data, and perform reasoning on it. Data is represented in the form of graphs, and more generally, as hypergraphs; thus the AtomSpace is a kind of graph database, the query engine is a general graph re-writing system, and the rule-engine is a generalized rule-driven inferencing system. The vertices and edges of a graph, known as "Atoms", are used to represent not only "data", but also "procedures"; thus, many graphs are executable programs as well as data structures. The AtomSpace is a platform for building Artificial General Intelligence (AGI) systems. It provides the central knowledge representation component for OpenCog. As such, it is a fairly mature component, on which a lot of other systems are built, and which depend on it for stable, correct operation in a day-to-day production environment.

ResumeParser - Resume Parser using rule based approach. Developed using framework provided by GATE

  •    HTML

Parser that extracts information from any resume and converts into a structured .json format to be used by internal systems. The parser uses a rule-based approach that focuses on semantic rather than syntactic parsing. The parser can handle document types in .pdf, .txt, .doc and .docx (Microsoft word). In its current form, this application is a console based application. Parse uses the Engligh grammar engine provided by GATE through its ANNIE framework. The output is then transduced using the grammar rules and lists specifically written for resume parsing. The JAPE grammar defines a generic set of rules that complies with popular ways of resume writing. It takes Proper nouns from lists and applies them to rules to identify entities. Explore the source code and read about GATE for more details. Also, feel free to pose questions.

duckling - Probabilistic parser

  •    Clojure

Duckling is a Clojure library that parses text into structured data: “the first Tuesday of October” => {:value "2014-10-07T00:00:00.000-07:00" :grain :day}<div class="doc-website-link"> <p>You can try it out at <a href="http://duckling-lib.org">http://duckling-lib.org</a></p></div>See our [blog post announcement](https://wit.ai/blog/2014/10/01/open-source-parser-duckling) for more context.Duckling is shipped with modules that parse temporal expressions i


parboiled2 - A macro-based PEG parser generator for Scala 2.10+

  •    Scala

parboiled2 is a Scala 2.11+ library enabling lightweight and easy-to-use, yet powerful, fast and elegant parsing of arbitrary input text. It implements a macro-based parser generator for Parsing Expression Grammars (PEGs), which runs at compile time and translates a grammar rule definition (written in an internal Scala DSL) into corresponding JVM bytecode.PEGs are an alternative to Context-Free Grammars (CFGs) for formally specifying syntax, they make a good replacement for regular expressions and have some advantages over the "traditional" way of building parsers via CFGs (like not needing a separate lexer/scanner phase).

drools - Drools is a rule engine, DMN engine and complex event processing (CEP) engine for Java.

  •    Java

Drools Expert is the rule engine and Drools Fusion does complex event processing (CEP).

JEOPS - Java based Rule Engine

  •    Java

JEOPS is a Java based forward chaining RULE ENGINE. This Rule Engine is used to power up the business process by rules in Java Application Servers, client applications, and Servlets.

TextConv

  •    Delphi

A really simple rule-based text converter. With this program you can manage files of rules and then convert with such a rule file one or more files by applying rule after rule to one or more files.

haskell-language-server - Successor of ghcide & haskell-ide-engine. One IDE to rule them all.

  •    Haskell

Integration point for ghcide and haskell-ide-engine. One IDE to rule them all. Read the project's background.

when - A natural language date/time parser with pluggable rules

  •    Go

Check EN and RU rules and tests for them, for more examples.Needed rule not found? Open an issue with the case and it will be added asap.

HtmlCleaner - HTML parser in Java

  •    Java

HtmlCleaner is HTML parser written in Java. HTML found on Web is usually dirty, ill-formed and unsuitable for further processing. HtmlCleaner reorders individual elements and produces well-formed XML. By default, it follows similar rules that the most of web browsers use in order to create Document Object Model. However, user may provide custom tag and rule set for tag filtering and balancing.

The Language Machine

  •    D

The Language Machine is a toolkit for language and grammar: a library, main program, and self-hosted rule compilers with one frontend. The system is easy to use. It directly implements unrestricted rule-based grammars with actions and external interfaces.

owasp-threat-dragon - An open source, online threat modelling tool from OWASP

  •    Javascript

Threat Dragon is a free, open-source, cross-platform threat modelling application including system diagramming and a threat rule engine to auto-generate threats/mitigations. It is an OWASP Incubator Project. The focus of the project is on great UX, a powerful rule engine and integration with other development lifecycle tools. A web application (this repo): For the web application, models files are stored in GitHub (other storage will become available). We are currently maintaining a working protoype in synch with the master code branch.

owasp-threat-dragon-desktop - An installable desktop variant of OWASP Threat Dragon

  •    CSS

Threat Dragon is a free, open-source, cross-platform threat modeling application including system diagramming and a rule engine to auto-generate threats/mitigations. It is an OWASP Incubator Project. The focus of the project is on great UX, a powerful rule engine and integration with other development lifecycle tools. A web application: For the web application, models files are stored in GitHub (other storage will become available). We are currently maintaining a working protoype in synch with the master code branch.

dna2abc

  •    Perl

dna2abc turns DNA sequences into musical sequences. The key feature is the rule editor; a rule is a regular expression paired with a Tcl script. dna2abc scans a DNA sequence, testing each regular expression: if it matches, the Tcl script is run.

parsimonious - The fastest pure-Python PEG parser I can muster

  •    Python

Parsimonious aims to be the fastest arbitrary-lookahead parser written in pure Python—and the most usable. It's based on parsing expression grammars (PEGs), which means you feed it a simplified sort of EBNF notation. Parsimonious was designed to undergird a MediaWiki parser that wouldn't take 5 seconds or a GB of RAM to do one page, but it's applicable to all sorts of languages. You can have forward references and even right recursion; it's all taken care of by the grammar compiler. The first rule is taken to be the default start symbol, but you can override that.

FOUR - FOUR is a beautiful and lightweight task-recorder app, revolving around the theme of "10000 Hour Rule", encourage user to achieve their goal

  •    Objective-C

FOUR observe The 10000 Hour Rule, and help you record the entirely process of your fantasy work. ##Intro FOUR is a beautiful and lightweight task-recorder app, revolving around the theme of "10000 Hour Rule", encourage user to achieve their goal.

Rules Engine

  •    

Rules Engine is a C# project that makes it easier for developers to define business rules on domain objects without coupling the domain object to the business rule. The rules engine supports cross-field validation and conditional validation. Rules are interface-based and are e...

NxBRE

  •    CSharp

NxBRE is a lightweight Business Rule Engine (aka Rule Based Engine) for the .NET platform, composed of a forward-chaining inference engine and an XML-driven flow control engine. It supports RuleML 0.9 Naf Datalog and Visio 2003 modeling.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.