#parser #nom

nom-recursive-macros

Helper crate of nom-recursive

4 releases (breaking)

0.4.0 Aug 31, 2021
0.3.0 Nov 26, 2020
0.2.0 Apr 1, 2020
0.1.1 Aug 15, 2019

#22 in #nom

Download history 78/week @ 2021-05-30 80/week @ 2021-06-06 83/week @ 2021-06-13 76/week @ 2021-06-20 78/week @ 2021-06-27 115/week @ 2021-07-04 116/week @ 2021-07-11 118/week @ 2021-07-18 90/week @ 2021-07-25 98/week @ 2021-08-01 143/week @ 2021-08-08 82/week @ 2021-08-15 149/week @ 2021-08-22 156/week @ 2021-08-29 58/week @ 2021-09-05 133/week @ 2021-09-12

451 downloads per month
Used in 8 crates (via nom-recursive)

MIT/Apache

4KB
72 lines

nom-packrat

Extension of nom to apply "Packrat Parsing".

Actions Status Crates.io Docs.rs

Requirement

nom must be 5.0.0 or later. nom-packrat can be applied to function-style parser only.

Usage

[dependencies]
nom-packrat = "0.5.0"

Example

use nom::character::complete::char;
use nom::IResult;
use nom_packrat::{init, packrat_parser, storage};

// Declare storage used by packrat_parser
storage!(String);

// Apply packrat_parser by custom attribute
#[packrat_parser]
pub fn parser(s: &str) -> IResult<&str, String> {
    let (s, x) = char('a')(s)?;
    Ok((s, x.to_string()))
}

fn main() {
    let input = "a";

    // Initialize before parsing
    init!();
    let result = parser(input);

    println!("{:?}", result);
}

Performance

Syntax

<S> ::= <T> + <S> | <T> - <S> | <T>
<T> ::= ( <S> ) | a

Input

The following 8 patterns. The first pattern is named as "pair 0" and the last is "pair 7".

a
(a)
((a))
(((a)))
((((a))))
(((((a)))))
((((((a))))))
(((((((a)))))))

Result

  • original : the original nom parser
  • packrat : all parsers with #[packrat_parser]
  • packrat_opt: only <T> with #[packrat_parser]

This is an edge case. The execution time of the original parser increases exponentially. By packrat pasring, the time becomes linear. Instead packrat parsers consume more memory than the original parser.

speed

memory

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~310–730KB
~18K SLoC