Construct Parsers for Structured Text Files
Applying a parser to a split string
Applying a parser to individual symbols of a string
Recognize empty lines
Detect end of input
Testing for parser failure
Test whether the parser has completely consumed the input
Applying alternative parsers
Return a fixed value instead of the result of a parser
Applying parsers in sequence
Applying a function to the result of a parser
Keeping only first or second result from a %then% sequence
Ignore all until the end
Matching parser input with a literal string
Identifying and processing a string and producing custom output
Print method for an object of class marker
Turn a parser into an error reporting parser
Matching input using a logical function
Store and retrieve objects
String parser constructor
The most basic parsers
Repeated application of a parser
Construct parser combinator functions, higher order functions that parse input. Construction of such parsers is transparent and easy. Their main application is the parsing of structured text files like those generated by laboratory instruments. Based on a paper by Hutton (1992) <doi:10.1017/S0956796800000411>.
Useful links