Tells is the current grammar is in Chomsky Normal Form or not Returns ------- is_normal_form : bool If t

Minimize the current DFA Returns ---------- dfa : :class:`~pyformlang.deterministic_finite_automaton\ .Deterministi

Remove a final state Parameters ----------- state : :class:`~pyformlang.finite_automaton.State` A final state to

Removes useless symbols in a CFG Returns ---------- new_cfg : :class:`~pyformlang.cfg.CFG` The CFG without usele

Substitutes CFG to terminals in the current CFG Parameters ----------- substitution : dict of :class:`~pyformlang.cfg.Termin

Transforms a given value into a node

Get the state index

Tests for DFA from example 0

Adds a final state to the automaton Parameters ---------- state : :class:`~pyformlang.pda.State` The state to ad

Combine two states

Construct a feature structure from a text. Parameters ----------- text : str The text to parse structure

Used in LL(1)

Get the leftmost derivation Returns ------- derivation : list of list of :class:`~pyformlang.cfg.CFGObject`

Get the LL(1) parsing table From: https://www.slideshare.net/MahbuburRahman273/ll1-parser-in-compilers

Get the leftmost derivation Returns ------- derivation : list of list of :class:`~pyformlang.cfg.CFGObject`

Gets the intersection of the language L generated by the \ current PDA when accepting by final state with something else Currently,

Checks if the automaton is acyclic Returns ------- is_acyclic : bool Whether the automaton is acyclic or

Checks if the current automaton is equivalent to a given one. Parameters ---------- other : An other fin

Whether a word is parsable or not Parameters ---------- word : list The word to parse left

Check if the input is given an explicit type

The reverser ordering, simply reverse the order. Returns ---------- new_rules : iterable of \ :class:`~pyformlang.ind

To PDA state in the intersection function

Merge a list of states Parameters ---------- l_states : list of :class:`~pyformlang.finite_automaton.State` A list of states

Get the graph of the non-terminals in the rules. If there there is a link between A and B (oriented), it means that modifying A may m

Gives the end of the first group

Adds a new class

Add states Parameters ---------- states : list of str The states to add idx : int The

Box by nonterminal Parameters ---------- nonterminal: :class:`~pyformlang.finite_automaton.Symbol` | str

Get the complement of the current Epsilon NFA Equivalent to: >>> -automaton Returns ---------- enfa : :c

Gives a dfa

Get follow set

Get the generating symbols Returns ---------- generating : set of any The generating symbols from the start stat

Give the parse tree associated with this CYK Table Returns ------- parse_tree : :class:`~pyformlang.cfg.ParseTree`

Get productions as a dictionary

Get the reachable symbols Returns ---------- reachables : set of any The reachable symbols from the start state

Gives the objects which are reachable in the CFG Returns ---------- reachable_symbols : set of :class:`~pyformlang.cfg.CFGOb

Get a symbol

Gets transitions from the given state

Finds all the unit pairs Returns ---------- unit_pairs : set of tuple of :class:`~pyformlang.cfg.Variable` The u

Checks whether an automaton is deterministic Returns ---------- is_deterministic : bool Whether the automaton is

Tests if the grammar is finite or not Returns ---------- is_finite : bool Whether the grammar is finite or not

Removes a transition to the function Parameters ---------- s_from : :class:`~pyformlang.finite_automaton.State`

Reverse the current CFG Equivalent to: >> ~cfg Returns ---------- new_cfg : :class:`~pyformlang.cfg.CFG

Transform the current pda into a networkx graph Returns ------- graph : networkx.MultiDiGraph A network

Transform the current automaton into a networkx graph Returns ------- graph : networkx.MultiDiGraph A n

Tries to add a given element to the given set. Returns True if element was added, otherwise False.

Creates a OR transition instead of several connections CAREFUL: This method modifies the automaton and is designed for \ internal us

Merge of nullable and generating

Gets a set of states that are next to the given one

Gives the set of next states, starting from a set of states Parameters ---------- current_states : iterable of \ :cl

Get the regex of an automaton when it only composed of a start and a final state CAUTION: For internal use only! Returns

Get the symbol index

Internal function to add a regex to a given epsilon NFA. Parameters ---------- s_from : :class:`~pyformlang.finite_a

Remove all states which are not the start state or a final state CAREFUL: This method modifies the current automaton, for internal usage

Transforms the epsilon-nfa into a dfa Parameters ---------- eclose : bool Whether to use the epsilon closure or

Add content to the current feature structure at a specific path Parameters ---------- content_name : str The nam

Adds a starting node to a given graph

Adds several transitions to the FST Parameters ---------- transitions_list : list of tuples The tuples h

Makes the concatenation of two CFGs Equivalent to: >> cfg0 + cfg1 Parameters ---------- other : :class:`~

Eliminate all the unit production in the CFG Returns ---------- new_cfg : :class:`~pyformlang.cfg.CFG` A new CFG

exists Check whether at least an element x of l is True for f(x) :param list_elements: A list of elements to test :param check_function: T

Create a recursive automaton from ebnf (ebnf = Extended Backus-Naur Form) Parameters ----------- text : str The

Checks is the word is generated Returns ------- is_generated : bool

Generates a collection of all the states at a given position

Get the list of all path in the feature structure Returns -------- paths : Iterable of :class:`~pyformlang.fcfg.FeatureStruc

ENFA example with a cycle on the path to the final state

An example of DFA

Compute the difference with another Epsilon NFA Equivalent to: >>> automaton0 - automaton1 Parameters ----------