That's likely easier.
Ok, thank you. I am looking for a DER object with der-parser. For now I am trying the parser on each increasing offset of the input, it is indeed pretty inefficent. But maybe I could first search for a pattern in my data and then parse only from here.
If you know it, you're probably safe from the "noise" prefix accidentally containing a matching structure, but, on the other hand, this sounds like a security vulnerability if the attacker could somehow control the "noise" part and inject the bad version of the structure.
However I am in fact scanning for all such structures in the input, so even if the attacker can insert bad cases, I think I should be able to still find the good ones, which is what matters in my case.
Returning to the original question, I'd take the specification, the expected data structure and find some sequence of 4+ bytes that's known ahead of time so that I could seek to it with
take_until
is there any way to have alt((a, b)) not return (&str, &str)
this is what i have
45 | pub fn alt<I: Clone, O, E: ParseError<I>, List: Alt<I, O, E>>(l: List) -> impl Fn(I) -> IResult<I, O, E> {
| ------------ required by this bound in `nom::branch::alt`
|
= note: expected enum `std::result::Result<(&str, &str), nom::internal::Err<(&str, nom::error::ErrorKind)>>`
found enum `std::result::Result<(&str, screen::settings::administration::parse_search::Criteria<'_>), nom::internal::Err<(&str, nom::error::ErrorKind)>>`
i think the issue is the two combinators return diff types, do they each need to return Either or something
Hello, I'm trying to write a parser that needs to parse Python-style variable names ([A-Za-z0-9_] characters, except the first character cannot be a number). I thought I would start by writing a custom version of nom::character::complete::alphanumeric1 that also accepts underscores, but when I tried copying it to my code and modifying it, I found that nom::traits is private. Any suggestions on the idiomatic way to do this with Nom?
/
tuple that returns a single slice
oo,
recognize looks like it'll help
I want to simplify this
fn ident(s: &[u8]) -> IResult<&[u8], &[u8]> {
recognize(preceded(
|i| if let Some(&l) = s.get(0) {
if letter(l) {
Ok((&s[1..], ()))
} else {
Err(Err::Error(ParseError::from_error_kind(s, ErrorKind::OneOf)))
}
} else {
Err(Err::Incomplete(Needed::Size(1)))
},
take_while(|b| matches!(b, b'A'..=b'Z' | b'a'..=b'z' | b'_' | b'0'..=b'9'))
))(s)
}
Hello! I'm having a problem with creating a custom errorkind and parser completness, in the docs for
alt it says "with a custom error type, it is possible to have alt return the error of the parser that went the farthest in the input data" but there seems to not be any documentation on how to do this
When all of my alt cases fail, then I'm getting an
Incomplete, not an error. How would I get my desired behaivior?
Here is the exact code I care about:
let (input, defs) = complete(many1(annotated_terminal(alt((
p_fn_named,
p_prim,
p_struct,
p_enum,
)))))(input)?;
I'm trying to parse many top-level definitions, and if the whole file is not parsed, then I want the error from why it wasn't able to parse
Thank you for any help!
and btw! I've been using nom to make a mixfix parser library, is there any interest in building tokenstream functionality into nom?
my idea is that we'd have nom::tokens just like nom::bytes with some combinators to do with taking tokens from a tokenstream
I also could just build it out into its own library which might be a better idea
Hi, I need to parse an expression which can be either an int literal or a float literal
So far I've been using
alt((float_literal, int_literal)).So far I've been using
number::complete::double to parse the float literal, but this caused trouble because double also accepts integers double("1") == 1.0. Is there an easy way to fix this?
does that make a diff
fn parse_date(input: &str) -> IResult<&str, DateTime<Utc>> {
DateTime::parse_from_str(input, "%F")
.map_err(|_| nom::Err::Error((input, /* here */)))
}