Append an element

Check if a word matches (completely) the regex. Parameters ---------- word : iterable of str The word to

Checks whether the epsilon nfa accepts a given word Parameters ---------- word : iterable of :class:`~pyformlang.finite_auto

Adds a transition to the nfa Parameters ---------- s_from : :class:`~pyformlang.finite_automaton.State` The sour

Gives the membership of a word to the grammar Parameters ---------- word : iterable of :class:`~pyformlang.cfg.Terminal`

Add a state to the processed states. Returns if the insertion was successful or not.

Adds a new final state Parameters ----------- state : :class:`~pyformlang.finite_automaton.State` A new final st

Add content to the current feature structure. Parameters ---------- content_name : str The name of the new featu

Appends an element

Internal

Add a transition to the PDA Parameters ---------- s_from : :class:`~pyformlang.pda.State` The starting symbol

Transforms the regular expression into an epsilon NFA. Returns ---------- enfa : :class:`~pyformlang.finite_automato

Set an initial state Parameters ----------- state : :class:`~pyformlang.finite_automaton.State` The new initial

Internal

Read a context free grammar from a text. The text contains one rule per line. The structure of a production is: head

Get a feature at a given path. Parameters ----------- path : Iterable of str, optional The path to the new featu

Check whether the current feature structure subsumes another one. Parameters ---------- other : :class:`~pyformlang.fcfg.Feat

Translate a string into another using the FST Parameters ---------- input_word : iterable of any The word to tra

Says whether the CFG is empty or not Returns ---------- is_empty : bool Whether the CFG is empty or not

Add a transition to the FST Parameters ----------- s_from : any The source state input_symbol : any

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

Set an initial state Parameters ----------- state : :class:`~pyformlang.finite_automaton.State` The new initial

Checks whether the grammar generates a word or not Returns ---------- is_empty : bool Whether the grammar is empt

Transforms the input into a state Parameters ---------- given : any What we want to transform

Transforms the input into a symbol Parameters ---------- given : any What we want to transform

Makes the union of two CFGs Equivalent to: >> cfg0 or cfg1 Parameters ---------- other : :class:`~pyforml

Adds several transitions to the automaton Parameters ---------- transitions_list : list of triples of (s_from, symb_

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

Copies the current Epsilon NFA Returns ---------- enfa : :class:`~pyformlang.finite_automaton.EpsilonNFA` A copy

Turns the language L generated by this PDA when accepting \ on empty \ stack into a CFG that accepts the same language L Ret

Gives the number of symbols in the regex. Returns ---------- n_symbols : int The number of symbols in th

Pop an element

Checks whether the nfa accepts a given word Parameters ---------- word : iterable of :class:`~pyformlang.finite_automaton.Sy

Add a start state Parameters ---------- start_state : any The start state

Gets words accepted by the finite automaton.

Gives the number of operators in the regex. Returns ---------- n_operators : int The number of operators

Splits

Turns the current PDA that accepts a language L by final state to \ another PDA that accepts the same language L by empty stack Retu

Add a final state Parameters ---------- final_state : any The final state to add

Gives the intersection of the current CFG with an other object Equivalent to: >> cfg and regex Parameters -------

Checks if a state is final Parameters ----------- state : :class:`~pyformlang.finite_automaton.State` The state

Minimize the current epsilon NFA Returns ---------- dfa : :class:`~pyformlang.deterministic_finite_automaton\ .Deter

Pop an element

Transforms the EpsilonNFA to a regular expression Returns ---------- regex : :class:`~pyformlang.regular_expression.Regex`

Get the renaming. Parameters ---------- state : str The state to rename idx : int Th

Gets the number of transitions in the PDA Returns ---------- n_transitions : int The number of transitions

Gives the number of transitions describe by the function Returns ---------- n_transitions : int The number of tr

Gives the number of transitions Returns ---------- n_transitions : int The number of deterministic transitions

Gets the Chomsky Normal Form of a CFG Returns ---------- new_cfg : :class:`~pyformlang.cfg.CFG` A new CFG equiva

Unify the current structure with another one. Modifies the current structure. Parameters ---------- other : :class:`

Copy the current transition function Returns ---------- new_tf : :class:`~pyformlang.pda.TransitionFunction` The

Compute the epsilon closure of a collection of states Parameters ---------- states : iterable of :class:`~pyformlang.finite_

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

Checks whether the dfa accepts a given word Parameters ---------- word : iterable of :class:`~pyformlang.finite_automaton.Sy

Compute the epsilon closure of a state Parameters ---------- state : :class:`~pyformlang.finite_automaton.State`

Duplicate text

Insert new element

Checks if the language represented by the FSM is empty or not Returns ---------- is_empty : bool Whether the lan

remove an initial state Parameters ----------- state : :class:`~pyformlang.finite_automaton.State` The new initi

Transforms the epsilon-nfa into a dfa Returns ---------- dfa : :class:`~pyformlang.finite_automaton\ .Deterministic

Tranforms the EpsilonNFA to a regular expression Returns ---------- regex : :class:`~pyformlang.regular_expression.Regex`

Makes the union of two regexable objects Parameters ---------- other : :class:`~pyformlang.finite_automaton.Regexable`

Copies the current feature structure Parameters ---------- already_copied : dict A dictionary containing the par

Gives an example ENFA Accepts a*b

Gives the number of transitions describe by the deterministic \ function Returns ---------- n_transitions : int

Whether the rule is a production rule or not Returns ---------- is_production : bool Whether the rule is a produc

Turns the regex into a context-free grammar. Parameters ---------- starting_symbol : :class:`~pyformlang.cfg.Variabl

Conversion used in the to_pda method

Turns the current PDA that accepts a language L by empty stack \ to another PDA that accepts the same language L by final state Retu

Converts the CFG to a PDA that generates on empty stack an \ equivalent language Returns ---------- new_pda : :class

Convert to a state

Gives the membership of a word to the grammar Parameters ---------- word : iterable of :class:`~pyformlang.cfg.Terminal`

Gives and example ENFA Accepts c

Get free next state or symbol

Gives the objects which are nullable in the CFG Returns ---------- nullable_symbols : set of :class:`~pyformlang.cfg.CFGObje

Get the number of transitions in the FST Returns ---------- n_transitions : int The number of transitions

Get a stack symbol

Get the words generated by the CFG Parameters ---------- max_length : int The maximum length of the words to ret

Whether the rule is a duplication rule or not Returns ---------- is_duplication : bool Whether the rule is a dupl

Remove a transition of the nfa Parameters ---------- s_from : :class:`~pyformlang.finite_automaton.State` The so

Turns the finite automaton into a finite state transducer The transducers accepts only the words in the language of the \ automaton

Convert to a stack symbol

Transformation into a terminal

Turns the grammar into its string representation. This might lose some\ type information and the start_symbol. Returns

Create a recursive automaton from regular expression Parameters ----------- regex : :class:`~pyformlang.regular_expression.R

Whether the grammar generates epsilon or not Returns ---------- generate_epsilon : bool Whether epsilon is gener

Get a parse tree of the CNF of this grammar Parameters ---------- word : iterable of :class:`~pyformlang.cfg.Termina

Get the dereferences version of the feature structure. For internal usage.

Gets the edges Returns ---------- edges : generator of (:class:`~pyformlang.finite_automaton.State`, \ :class:`~

Gives the objects which are generating in the CFG Returns ---------- generating_symbols : set of :class:`~pyformlang.cfg.CFG

Get LL(1) parse Tree Parameters ---------- word : list The word to parse Returns ------

Compute the intersection with an other object Equivalent to: >> fst and indexed_grammar

Whether the rule is an end rule or not Returns ---------- is_end : bool Whether the rule is an end rule or not

Check if a state is incomplete