We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Should Lex and Parse have the following blanket impl?:
impl<T, O> Parse for &T where T: Parse<Output = O>, { type Output = O; fn parse<'i>(&self, input: &'i str) -> ParseResult<'i, Self::Output> { (*self).parse(input) } }
Should we have combinators that take references to parsers/lexers?
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Should Lex and Parse have the following blanket impl?:
Should we have combinators that take references to parsers/lexers?
The text was updated successfully, but these errors were encountered: