A terminal in a CFG

An variable in a CFG Parameters ----------- value : any The value of the variable

A symbol in a finite automaton Parameters ---------- value : any The value of the symbol Examples ---------- >>> fr

A production or rule of a CFG Parameters ---------- head : :class:`~pyformlang.cfg.Variable` The head of the production body

A state in a finite automaton Parameters ---------- value : any The value of the state Examples ---------- >>> from

The feature structure containing constraints Parameters ---------- value : Any, optional The value of the feature, if defined

Represents a regular expression. Pyformlang implements the operators of textbooks, which deviate slightly \ from the operators in Pytho

Contains a representation of a consumption rule, i.e. a rule of the \ form: C[ r sigma] -> B[sigma] Parameters ----------

A class representing a context free grammar Parameters ---------- variables : set of :class:`~pyformlang.cfg.Variable`, optional

Represents a duplication rule, i.e. a rule of the form: A[sigma] -> B[sigma] C[sigma] Parameters ---------- left_term : any

An epsilon terminal

Represents an end rule, i.e. a rule of the form: A[sigma] -> a Parameters ----------- left : any The non-terminal on the

An epsilon transition Examples -------- >>> epsilon = Epsilon()

Represents a production rule, i.e. a rule of the form: A[sigma] -> B[r sigma] Parameters ---------- left : any The non-te

Represents a regular expression as used in Python. It adds the following features to the basic regex: * Set of characters with [] * Inv

Represents an epsilon NFA Parameters ---------- states : set of :class:`~pyformlang.finite_automaton.State`, optional A finite

Represents a deterministic finite automaton This class represents a deterministic finite automaton. Parameters ---------- states :

An epsilon symbol

Describes an indexed grammar. Parameters ---------- rules : :class:`~pyformlang.indexed_grammar.Rules` The rules of the grammar,

Store a set of rules and manipulate them Parameters ---------- rules : iterable of :class:`~pyformlang.indexed_grammar.ReducedRule`

A StackSymbol in a pushdown automaton Parameters ---------- value : any The value of the state

A Symbol in a pushdown automaton Parameters ---------- value : any The value of the state

A State in a pushdown automaton Parameters ---------- value : any The value of the state

Representation of a pushdown automaton Parameters ---------- states : set of :class:`~pyformlang.pda.State`, optional A finite s

A feature production or rule of a FCFG Parameters ---------- head : :class:`~pyformlang.cfg.Variable` The head of the production

Representation of a Finite State Transducer

A LL(1) parser Parameters ---------- cfg : :class:`~pyformlang.cfg.CFG` A context-free Grammar

Represents a nondeterministic finite automaton This class represents a nondeterministic finite automaton, where epsilon \ transition are for

A parse tree

A transition function in a finite automaton. This is a deterministic transition function. Attributes ---------- _transitions : dict

Represents a box for recursive automaton This class represents a box for recursive automaton Parameters ---------- enfa : :class:`~

A nondeterministic transition function in a finite automaton. The difference with a deterministic transition is that the return value is a s

For internal usage

A node in the CYK table

Error for misformed regex

Represents a recursive automaton This class represents a recursive automaton. Parameters ---------- start_box : :class:`~pyformlang

A CYK table Parameters ---------- cfg : A context-free grammar word : iterable of Terminals The word from which we const

Represents a concatenation

Represents doubly linked list of nodes from a doubly linked list

A class representing a feature context-free grammar Parameters ---------- variables : set of :class:`~pyformlang.cfg.Variable`, optional

Class for remaining the states in FST

Creates Objects for a PDA

A Object in a PDA

When there is a problem during parsing.

A recursive Top-Down parser Parameters ---------- cfg : :class:`~pyformlang.cfg.CFG` A context-free Gram

A queue with non duplicate elements

For internal usage

Represents a symbol Parameters ---------- value : str The value of the symbol

A transition function in a pushdown automaton

A CFG Variable Converter

Exception raised when we want to add a content that already exists

A doubly linked list

Signals a duplicated transition Parameters ---------- s_from : :class:`~pyformlang.finite_automaton.State` The source state

Represents an empty symbol

Represents an epsilon symbol

Raised when trying to unify uncompatible structures

A representation for Hopcroft minimization algorithm For internal usage

Exception raised when an epsilon transition is created in deterministic automaton

Represents an epsilon symbol

When the grammar cannot be parsed (parser not powerful enough)

Class to manage partitions used in Hopcroft minimization algorithm

Raised when looking for a path that does not exist

For internal usage

A class to parse regular expressions

An abstract class to represent something which are be transformed into a regex

A class to order rules in an indexed grammar Parameters ---------- rules : iterable of :class:`~pyformlang.indexed_grammar.ReducedRule`

Represents a union

An object in a CFG Parameters ----------- value : any The value of the object

Exception raised when the word cannot be derived

Represents a general finite automaton Attributes ---------- _states : set of :class:`~pyformlang.finite_automaton.State`, optional

Represents an object in a finite state automaton Parameters ---------- value: any The value of the object

Represents a node in the tree representation of a regex Parameters ---------- value : str The value of the node

Represents an operator Parameters ---------- value : str The value of the operator

Representation of all possible reduced forms. They can be of four types : * Consumption * Production * End * Dupli

Tests the context free grammar

Tests for deterministic finite automata

Tests for epsilon transitions

Tests epsilon NFA

Test a FCFG

Tests FST

Testing of the feature structure

Tests the indexed grammar

Tests things related to rules

Tests the LL(1) Parser

Tests for nondeterministic finite automata

Tests the nondeterministic transitions functions

Tests the pushdown automata

Tests the production

Tests for python regex

Test class for RSA

Tests for regex

Test the states

Tests for the symbols

Tests the terminal

Tests the transitions functions

Tests the variable