Module rustla::parser::state_machine [−][src]
This module contains the State type and the different transition functions corresponding to each state
in its submodules.
Copyright © 2020 Santtu Söderholm
Modules
| aplus | A submodule that contains transition methods specific to creating A+ nodes. |
| aplus_questionnaire | A submodule dedicated to parsing functions of the |
| block_quote | Contains the transition function for parsing attributions inside block quotes. |
| body | This module contains the transition functions related to |
| bullet_list | A submodule that contains |
| common | A submodule for transition functions common to all states, such as blank line detection. |
| definition_list | A submodule with transition functions related to parsing definition list items. Every other transition function is redefined to focus on tree parent and pop from the parser state stack. |
| enumerated_list | A submodule for |
| field_list | A submodule that contains transition functions responsible for creating FieldListItem nodes. |
| inline | A submodule related to parsing blocks of text for inline elements. |
| literal_block | A submodule that contains the functions related to parsing literal blocks of text. |
| transitions | This Module contains lists of transition tuples related to different states and common patterns as &str constants. |
| unknown_transitions | A submodule whose only function’s purpose is to replace other transition methods and make the document tree focus on its parent and make the parser pop from its state stack. This is useful in making the transitions from each state complete, as in defined for each possible input, where it is needed. |
Structs
| COMPILED_INLINE_TRANSITIONS | Inline text has different parsing requirements than (nested)
|
| TRANSITION_MAP | A static map of transititions for each |
Enums
| State | An enum of states.
The variants are used as keys to the static |