ilonachan
/ nom-pratt-parser.rs
Last active
July 14, 2024 17:37
I followed the tutorial at https://matklad.github.io/2020/04/13/simple-but-powerful-pratt-parsing.html as closely as possible,while using nom at every step and creating the result to be a nom-compatible parser.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| use std::{borrow::BorrowMut, cell::RefCell, rc::Rc}; | |
| use nom::{combinator::map_res, error::FromExternalError, IResult, Parser}; | |
| pub trait BinaryDefFn<'a, I, O, E, Op>: FnMut(I, Op, O, O) -> IResult<I, O, E> + 'a {} | |
| impl<'a, T, I, O, E, Op> BinaryDefFn<'a, I, O, E, Op> for T where | |
| T: FnMut(I, Op, O, O) -> IResult<I, O, E> + 'a | |
| { | |
| } | |
| pub struct BinaryDef<'a, I, O, E, Op>( |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #! /usr/bin/python3 | |
| import subprocess | |
| import os | |
| import re | |
| # adapt this to fit whatever pattern you need | |
| pattern = re.compile(r"^skript-[^\.]*.pdf$") | |
| infiles = sorted([name for name in os.listdir(".") if os.path.isfile(name) and pattern.fullmatch(name)]) |