Lines Matching refs:parsers

11 to build safe parsers without compromising the speed or memory consumption. To
13 fast and correct parsers, and provides functions, macros and traits to abstract most of the
80 … you need any help developing your parsers, please ping `geal` on IRC (freenode, geeknode, oftc), …
86 ### binary format parsers
89 to the usual handwritten C parsers, nom parsers are just as fast, free from
95 - streaming parsers for network formats and huge files
103 ### Text format parsers
111 - regular expressions can be embedded in nom parsers to represent complex character patterns succin…
119 ### Programming language parsers
121 While programming language parsers are usually written manually for more
156 Parser combinators are an approach to parsers that is very different from
168 - the parsers are small and easy to write
169 - the parsers components are easy to reuse (if they're general enough, please add them to nom!)
170 - the parsers components are easy to test separately (unit tests and property-based tests)
172 - you can build partial parsers, specific to the data you need at the moment, and ignore the rest
176 nom parsers are for:
177 - [x] **byte-oriented**: the basic type is `&[u8]` and parsers will work as much as possible on byt…
182 - [x] **descriptive errors**: the parsers can aggregate a list of error codes with pointers to the …
183 - [x] **custom error types**: you can provide a specific type to improve errors returned by parsers
184 - [x] **safe parsing**: nom leverages Rust's safe memory handling and powerful types, and parsers a…
185 …om parsers often outperform many parser combinators library like Parsec and attoparsec, some regul…
219 * `regexp`: enables regular expression parsers with the `regex` crate
220 * `regexp_macros`: enables regular expression parsers with the `regex` and `regex_macros` crates. R…