Python module (C extension and plain python) implementing Aho-Corasick algorithm
-
Updated
Mar 21, 2024 - C
An automaton is a relatively self-operating machine designed to automatically follow a sequence of operations.
The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.
Python module (C extension and plain python) implementing Aho-Corasick algorithm
C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie
this project aims at facilitating the use of automats
This project is a Lexical Analyzer (Scanner) implemented in C, designed to tokenize a simple programming language. It processes an input string (source code) and identifies valid tokens such as keywords, identifiers, numbers, operators, and punctuation marks. The analyzer is based on a Deterministic Finite Automaton (DFA).
Coleção com vários programas que utilizam expressões regulares.
PASCAL subset compiler. The grammar is included. a sample txt source file are also included.
An abstract deterministic finite automaton implementation in C.
Terminal simulation of cellular automata
A simulator for Deterministic Pushdown Automaton (configurable from plain txt file).
Simulador de Autômato Finito Determinístico
[PT] Analisadores léxicos para disciplina de Compiladores.
A fast C implementation of ECAs
Tiny Conway's Game of Life implementation