Search Results for "dfa"
Sort By:
Showing 28 open source projects for "dfa"
View related business solutions-
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
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 projects. ...
-
2
LR Parser and Lexer Generators: Fortran
LR parser generator and lexer generator for use in Fortran
...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 that represent the DFA. A third program generates declarations that connect the parser and lexer. The LR parser generator and lexer generator both use parsers and lexers generated by themselves. An infrastructure to use a generated lexer and parser is therefore included as part of these programs. -
3
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... -
4
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 -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
RegexToNFA
Compiles regular expressions into modular NFA
...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; and compilation of a DFA to hash-based data structures for a simulator. -
6
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
-
7
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. -
8
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. -
9
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.
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
Producer Buddy
Timer utility to aid the Producer of a live broadcast
...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 is a testament to the endurance of technology. Computers that are over a decade old can still be used to operate Producer Buddy Legacy, and it can restore use to computers that are collecting dust to functionality. ... -
11
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. -
12
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.
-
13
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. -
14
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 to the parser method associated with that event. ... -
15
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.
-
16
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. -
17
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
-
18
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.
-
19
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.
-
20
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 :)
-
21
Finite automation，developed by java and it's open source.input the RE,can produce RG,NFA,DFA,MinDFA,Draw the corresponding transition diagram and show the details of transition.
-
22
The project implements Dana Angluin's learning algorithm with intent to look into the possibility of computational learning of changing (shifting) information.
-
23
A lightweight toolkit for efficient processing of XML data. The tools are analagous to the UNIX command-line text processing tools sort, grep, etc. The infrastructure includes an efficient DFA-based engine for streaming evaluation of XPath expressions.
-
24
A C library, providing comfortable APIs for a wide range of Finite State Abstract Machines (NFA, DFA, FST, Bimachines, etc). Implements most of the classical algorithms in the field.
-
25
Pure Python implementation of GOLD Parser Engine. GOLD Parser Engine is a LALR(1) parser with DFA tokenizer. It uses compiled grammar table generated by GOLD Parser Builder (not included - available on http://www.devincook.com/goldparser)
