About
When you find a structure in a text, there is a language.
It can be:
- a loosely language such as natural language
Schema
The schema of text is expressed via one or many regular Expressions.
A regular expression is implemented as finite automata that's why when parsing any type of text (xml, json,..) with a library you are going from state to state.
Text Parser
A text parser is implemented:
- or manually where the rules are written at hand in the code for more grain control.
Document
When the string describes a computer format, the string/text is called a document