Search Results for "expression parser"
Sort By:
Showing 95 open source projects for "expression parser"
View related business solutions-
Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.
-
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
-
1
sh
A shell parser, formatter, and interpreter with bash support
.... If a given path is a directory, all shell scripts found under that directory will be used. When indexing Bash associative arrays, always use quotes. The static parser will otherwise have to assume that the index is an arithmetic expression. Some builtins like export and let are parsed as keywords. A subset of the Go packages are available as an npm package called mvdan-sh. -
2
x64dbg
An open-source x64/x32 debugger for windows
An open-source binary debugger for Windows, aimed at malware analysis and reverse engineering of executables you do not have the source code for. There are many features available and a comprehensive plugin system to add your own. Fully customizable color scheme. Dynamically recognize modules and strings. Import reconstructor integrated (Scylla). Fast disassembler (Zydis). User database (JSON) for comments, labels, bookmarks, etc. Plugin support with growing API. Extendable, debuggable... -
3
ngx-markdown
Angular markdown component/directive/pipe/service to parse static
Angular markdown component/directive/pipe/service to parse static, dynamic or remote content to HTML with syntax highlight and more. As the library is using Marked parser you will need to add node_modules/marked/marked.min.js to your application. To use the line numbers plugin that shows line numbers in code blocks, in addition to Prism.js configuration files, you will need to include the following files from prismjs/plugins/line-numbers directory to your application. Using markdown component... -
4
find-my-way
A crazy fast HTTP router
A crazy fast HTTP router, internally uses a highly performant Radix Tree (aka compact Prefix Tree), supports route params, wildcards, and it's framework is independent. You can set a custom length for parameters in parametric (standard, regex and multi) routes by using maxParamLength option, the default value is 100 characters. If you are using a regex-based route, find-my-way will throw an error if detects potentially catastrophic exponential-time regular expressions (internally uses... -
Vertex AI offers everything you need to build and use generative AI—from AI solutions, to Search and Conversation, to 130+ foundation models, to a unified AI platform.
-
5
System Verilog Parser IEEE 1800 LRM
IEEE LRM compliant System Verilog Parser in Java with Python, Tcl API
This parser has been developed to help users to implement their Verilog tool/utility on the top this library. It reads RTL and populates its internal data structures. There are APIs to extract the design information from the database, there are APIs to elaborate every element of the design along with basic expression evaluation capabilities. It has been bundled as an executable JAR file along with a sample application which reads a RTL file(s), elaborates and dumps it back to show the users... -
6
Free VHDL Parser with Java, Python and T
IEEE VHDL-93 LRM supported parser implemented in Java, APIs Python/Tcl
This parser has been developed for those who wants to develop his/her own tool around VHDL RTL. Only synthesizable subset of VHDL is supported and it may not work for machine/tool generated VHDL files. This parser has been developed in Java in order to make it platform independent. It reads RTL and populates its internal object model. There are APIs to extract the design information from the database, APIs to elaborate the design along with expression evaluation capabilities. This tool has been... -
7
x64dbg
An open-source x64/x32 debugger for windows.
An open-source x64/x32 debugger for windows. Development is done on GitHub (https://github.com/x64dbg/x64dbg). Daily snapshots are uploaded here, snapshots for every commit can be found on http://releases.x64dbg.com -
8
xpressionparser
parser of string expressions
Expression parser of strings like sin(pi/4) is written in c++, javascript, java and php. It is also possible to create functions x0+2*sin(pi*x1) for further calculations. -
9
Foreval
Foreval is parser & compiler of mathematical expressions
... & finding roots F(x), Fourier series. Old version (v.8.4.17.250): Examples for Delphi, FPC, Builder, MSVC , GCC (Codeblock) , VB6, FreeBasic. Download files: Foreval_all.7z (Foreval v9 + Foreval v8 + ForevalZ + all examples + doc) - recommend ForevalG9.7z (Foreval v9 + examples v9+ doc) (math parser, math expression parser, evaluate formula, evaluator, symbolic, differentiation, derivative , complex) -
Drive your organization forward with the right solution at the right price. AI-powered continuous accounting and ERP to support your growth now and into the future.
-
10
Simple components for Ada
A software components library
The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix expression parsing tools. Implementations... -
11
ARTCOMParser
Parser library that uses an EBNF like grammar to generate a parse tree
Parser library that uses an EBNF like grammar to generate a parse tree You can use it to create a quick parser It uses backtracking so it may be slow for some grammar rules -
12
commonlib-java
common java utility library
useful library for repetitive java stuff -
13
forevalz
ForevalZ - compiler of mathematical expressions with complex numbers
ForevalZ - compiler of mathematical expressions(formulas) with support of complex numbers (directly to CPU/FPU x86-32 comand) given as string at 'run-time'. (dll library and delphi component). Can be compiled in FPC (Lazarus). Examples for Delphi (2009), FPC , C++(Builder(2009), MSVC(2010), GCC (Codeblock)), VB.NET, VB6, FreeBasic. Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring . (math parser, math expression parser, evaluate formula... -
14
Java multiprecision calculator
Multiprecision calculator
Multipresicion calculator, based on Bigdecimal Java class . It has a library (BigMath) that makes calculations with Bigdecimal. It has also an expression parser to parse the user input. It allows you to store user defined variables and functions . You can operate with them to be used for calculations or for creating new functions with composition. With the new version, you can also calculate the derivative of a function. JDK-17 compatibility -
15
syntalyser
langage parser - syntax analyser.
This is about language code syntax analyser. It could parse C/C++, python, lua ... Given a 'language template' (a language description based on regular expression), it could decompose actual code to a table, or tree organization. -
16
From PEG to a practical parser
Transcribe Parsing Expression Grammar into a parser written in Java.
Tool to transcribe Parsing Expression Grammar into a parser written in Java. Parsing Expression Grammar (PEG) is a way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can define parsers with integrated lexing. Unlike some existing parser generators for PEG, the tool does not produce a complex and storage-hungry "packrat parser", but a collection of transparent... -
17
JavaBoolCompiler
Boolean expression compiler written in Java
Parses and evaluates boolean expressions. Usage: BoolCompiler compiler = new BoolCompiler(); BoolProgram program = compiler.compile("a == b && a != c"); HashMap<String, Boolean> context = new HashMap<String, Boolean>(); context.put("a", true); context.put("b", true); context.put("c", false); boolean result = program.eval(context); System.out.println("result = "+result); -
18
C++ Math Expression Parser
C++ Math Expression Parser Library
The C++ Mathematical Expression Toolkit Library (ExprTk) is a simple to use, easy to integrate and extremely efficient run-time mathematical expression parser and evaluation engine. ExprTk supports numerous forms of functional, logical and vector processing semantics and is very easily extendible. Download http://partow.net/programming/exprtk/index.html -
19
Calcex Math Parser
Mathematical expression parser and evaluator for .NET
Moved to https://github.com/alxnull/calcex Calcex is a simple math parser for .NET to evaluate mathematical expressions which is developed in C#. It supports many common mathematical operations and functions and allows the user to add custom functions and variables. It is possible to evaluate double or decimal values for high precision. Calcex also includes functions for converting numbers from decimal to binary or other bases. The project includes a simple calculator and decimal-binary... -
20
NppGTags
GTags plugin for Notepad++
This Notepad++ plugin is simply a front-end to GTags (GNU Global source code tagging system): http://www.gnu.org/software/global/global.html It provides tools for easy code navigation. GTags binaries (Win32 ports) are needed by the plugin. Those are supplied with it for convenience. -
21
High speed math parser
Expression evaluator for Delphi developers
Version 2.5 is available! The latest changes are in TFastList class. It is the secondary class intended for fast string managment. The newest TGraph component is available as well. The new ParseUtils.FindFormula method allows searching any of possible formulas within some text. Parse components are intended for Delphi developers and perform high-speed (about 10 million evaluations per second) mathematics and boolean calculations. All components are available for Delphi 6, Delphi 7,... -
22
FastRoute
Fast request router for PHP
This library provides a fast implementation of a regular expression-based router. Firstly, while writing a PHP extension is obviously a lot of fun, it is unlikely to be particularly beneficial in terms of performance unless the code involves computations in tight loops. Porting “normal” components like routers to C is usually a big waste of time. You can get much better results by doing a few small improvements on the algorithmic side. For the same reason I’m not a big fan of things like... -
23
mep4j
Math Expression Parser 4 Java
Math Expression Parser 4 Java MEP4J is a high performance math expression strings parser for Java (J2SE >= 5). Compare its performance against similiar libraries and let me know your experince. The library manages the 5 operators (+, -, /, %, *) together with the following functions: - "abs" - "cos" - "sin" - "acos" - "asin" - "cosh" - "sinh" - "tan", - "tanh" - "atan" - "sqrt" - "cbrt" - "root" - "log" - "log10" - "log1p" - "exp" - "expm1" - "atan2" - "pow... -
24
pegplusplus
A PEG parser library for C++
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. C++11 or later is required. -
25
PHP Cron Expression Parser
CRON for PHP
Calculate the next or previous run date and determine if a CRON expression is due. The PHP cron expression parser can parse a CRON expression, determine if it is due to run, calculate the next run date of the expression, and calculate the previous run date of the expression. You can calculate dates far into the future or past by skipping n number of matching dates. The parser can handle increments of ranges (e.g. */12, 2-59/3), intervals (e.g. 0-9), lists (e.g. 1,2,3), W to find the nearest...