Search Results for "dfa"
Sort By:
Showing 38 open source projects for "dfa"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Simplify IT and security with a single endpoint management platformNinjaOne automates the hardest parts of IT, delivering visibility, security, and control over all endpoints for more than 20,000 customers. The NinjaOne automated endpoint management platform is proven to increase productivity, reduce security risk, and lower costs for IT teams and managed service providers. The company seamlessly integrates with a wide range of IT and security technologies. NinjaOne is obsessed with customer success and provides free and unlimited onboarding, training, and support.
-
1
An LALR(1) and LALR(*) parser generator. Generates parsers up to 140 times the speed of ANTLR parsers, and 1/10th of the size or smaller. Contains the DFA lexer generator, 80% faster than flex lexers. Works with Visual Studio C++. Contains 27 grammars. Parsers build a symbol table. Parsers construct an abstract-syntax tree (AST). Parser are very fast and small. Reads ANTLR and YACC grammars, after making some changes. Accepts advanced EBNF grammar notation. Includes 4 sample...
-
2
DIANNA
software for DFA method
DIANNA (Diffraction Analysis of Nanopowders) is a free software developed to simulate atomic models of structures from an ensemble of nanoparticles and to calculate their whole X-ray powder diffraction patterns and the radial distribution function. The main objects of investigation are the particles whose coherent scattering domains do not exceed several nm. DIANNA is based on the ab initio method using the Debye scattering equation. This method makes it possible to obtain information on... -
3
LR Parser and Lexer Generators: Fortran
LR parser generator and lexer generator for use in Fortran
The generator for LR parsers uses Pager's method, augmented with Tom Pennello's Forward Move Algorithm for error recovery. The grammar specifies identifiers for nodes in the abstract syntax tree, and the identifiers for tokens. It generates Fortran declarations for tree node identifiers and named constants that represent the PDA. The lexer generator accepts regular expressions and generates a DFA. It generates Fortran declarations for character classes, recognized objects, named constants... -
4
Xmaldi
Viewing collections of MALDI spectra and perform PCA and DFA analyses
Xmaldi is an application for viewing collections of MALDI spectra and perform PCA and DFA analyses on them (Python 3 version). For more information, you can have a look at the README.md file in the source code tree: https://sourceforge.net/p/lp-csic-uab/xmaldi3/code/ci/default/tree/README.md -
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
5
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... -
6
raptor_waf
Raptor - Web application firewall [ Stable version ]
Web application firewall in C using DFA to block attacks. read Docs ! http://funguscodes.blogspot.com.br/2016/08/steps-to-create-your-wafweb-application.html -
7
RegexToNFA
Compiles regular expressions into modular NFA
This program compiles regular expressions (regexes) written in the modified ECMAScript regex grammar into modular nondeterministic finite automata suitable for hardware acceleration. This was originally an extended re-implementation of the "front-end" part in the following paper: https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for simulation... -
8
A Suite of Programs implementing a fast approach to the Debye Function Analysis (DFA) of powder diffraction data from nanocrystalline and/or non-ordered materials. See J. Appl. Cryst. 2015, 48, 2026-2032
-
9
CodeConics
CodeConics is a C# lexer/parser/syntax tree generatior
CodeConics is simple, intuitive, easy to use and debug code-manipulation solution, that is grammar independent and recursion based, as opposed to other DFA(Deterministic Finite-state Automata) based solutions. -
Cloud SQL for MySQL, PostgreSQL, and SQL ServerFully managed, cost-effective relational database service for PostgreSQL, MySQL, and SQL Server. Try Enterprise Plus edition for a 99.99% availability SLA and category-leading performance.
-
10
AutoSim
A free automata simulator that simulates DFA/NFA/DPDA/NPDA/STM
AutoSim is a free automata simulator for students and educators. Written in Java, it is a command-line based utility that runs on any OS that supports Java. With AutoSim, you can not only determine the final state or stack/tape contents, you can also trace through the execution states as well, from the initial to the final states. The latest version of AutoSim is 1.0, and it currently supports DFAs, NFAs, DPDAs, NPDAs, as well as Standard Turing Machines. -
11
Finite-Automata
convert finite automata
This software can convert epsilon-NFA to NFA to DFA or NFA to DFA and minimization of DFA It works in the windows linux and mac. -
12
DatedFileAppender is an "appender" object designed for use with the Apache Log4j logging system. It provides an Apache Tomcat style FileLogger implementation that differs from the file loggers provided with Log4j.
-
13
Producer Buddy
Timer utility to aid the Producer of a live broadcast
Timer utility to aid producer of televised broadcasts. Calculates show time and back time and presents in in an easy to use package. Producer Buddy was developed for use in the Broadcasting and Film Department of Davidson Fine Arts (DFA), a 6-12 Magnet School in Augusta, GA. DFA has a live, daily, eight-minute broadcast produced by and for students. It is the job of the Producer to keep track of time and Producer Buddy is a utility designed to make this job easier. Producer Buddy Legacy... -
14
Tautomaton is a C++11 -template library for deterministic (DFA) and non-deterministic finite automata (NFA). It supports regular expressions and efficient input matching of multiple regexps simultaneously. The library comes with a somewhat grep-like command-line tool for showcasing these features.
-
15
Sofia Regex
Java Regex API
This API provides an easy way of dealing with regular expressions. It provides DFA and NFA implementations, so if you need performance or group captures and analysis, both solutions are available. -
16
Automaton Lexer
A Java library for creating DFA-powered lexical analyzers
This project is derived from the dk.brics.automaton DFA library, version 1.11-8. The most significant change is the addition of a 'info' field to automaton states, allowing them to be associated with a token type. A few automaton operations were modified to preserve the value of this field. I have not given much thought to whether it would even make sense to preserve the 'info' field through some of the other operations. This project also includes an extension of RunAutomaton, called... -
17
JPlex
Java lexical analyzer generator
JPlex is an unconventional lexical analyzer generator for Java. JPlex lexers are NIO-based, DFA-powered, push-driven, and fully decoupled and reusable. Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token... -
18
visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.
-
19
DFA library is a regular expression library capable of the classic RE syntax (i.e. - without any perl extension). Unlike many other libraries with similar functionality, a deterministic finite automata (DFA) is used. DFA was formerly called npcre, wh
-
20
Automata editor
automata editor
Automata editor is a vector editor for drawing finite automata according to VauCanSon-G format with tools for working with finite automata such as basic algorithms, exporting transition table to LaTeX format and automata work simulation. -
21
GUI application that can be used for generate graph representation for any given DFA or NFA table and check weather strings are accepted or rejected by finite automata.
-
22
SIP.NET is SIP stack .NET library written in C#. SIP message parser realized on Deterministic Finite-state Machine (DFA parse all SIP message for one pass). DFA generates automatically from Augmented Backus–Naur Form from RFC3261.
-
23
A Python function library to extract EEG feature from EEG time series in standard Python and numpy data structure. Features include classical spectral analysis, entropies, fractal dimensions, DFA, inter-channel synchrony and order, etc.
-
24
This is testing engine. It allows to test java application using data flow analysis (DFA) of the byte code
-
25
RexRex is a Regexp matching engine based on Automata Theory Principles (so-called DFA Engine) Implemented in ANSI C . currently it supports (,),*,+,?,Character classes ([],w,s,..etc) and escaping FWIW Rex is king in Latin;so it's RexKing :)
