An epsilon NFA to recognize digits

ENFA example for the word generation test

Duplicate example of rules

Computes the intersection of two Epsilon NFAs Equivalent to: >>> automaton0 and automaton1 Parameters ----------

Size of set of boxes

Gives the parse tree for a sentence, if possible Parameters ---------- word : iterable of :class:`~pyformlang.cfg.Terminal`

Generates the prefix language of the CFL, i.e., the language of all prefixes of valid words Based on https://cs.uwaterloo.ca/~s4benda

Get a string representation of the tree behind the regex. Parameters ---------- depth : int The current

Computes the intersection of the current indexed grammar with the \ other object Equivalent to -------------- >> i

Checks whether the grammar can be parse with the LL(1) parser. Returns ------- is_parsable : bool

Order the rules using the arborescence method. Parameters ---------- reverse : bool Boolean to know if we should

Order the rules using the core numbers Parameters ---------- reverse : bool Boolean to know if we should reverse

Order using the number of edges. Parameters ---------- reverse : bool Boolean to know if we should reverse the or

Removes the epsilon of a cfg Returns ---------- new_cfg : :class:`~pyformlang.cfg.CFG` The CFG without epsilons

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

Remove useless rules in the grammar More precisely, we remove rules which do not contain only generating \ or reachable non termina

Sets the start stack symbol to the automaton Parameters ---------- start_stack_symbol : :class:`~pyformlang.pda.StackSymbol`

Sets the start state to the automaton Parameters ---------- start_state : :class:`~pyformlang.pda.State` The sta

Transforms the nfa into a dfa Returns ---------- dfa : :class:`~pyformlang.deterministic_finite_automaton\ .Determi

Transforms the current automaton into a dfa. Does nothing if the \ automaton is already deterministic. Returns ----------

Get the dictionary representation of the transition function. The \ keys of the dictionary are the source nodes. The items are \

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

Convert to a symbol

Transformation into a variable

Makes the union of two fst Parameters ---------- other_fst : :class:`~pyformlang.fst.FST` The other FST

Write the parse tree in dot format into a file Parameters ---------- filename : str The filename where t

Add parenthesis for the first group in indicate precedence

Decompose productions

Processes a duplication rule Parameters ---------- rule : :class:`~pyformlang.indexed_grammar.DuplicationRule` Th

Generates the rules in the CFG conversion

Internal method to compute the transition in the case of a \ simple automaton Returns start_to_start : str The t

Get the number of out edges of a rule (more exactly, the non \ terminal at its left. Parameters ---------- di_graph :

Remove the terminals involved in a body of length more than 1

Get all states which are reachable

Gets a set of states from which one of the final states can be reached.