2019-01-31 13:46:40 +03:00
|
|
|
use crate::{tt, mbe};
|
2019-01-31 15:26:01 +03:00
|
|
|
use crate::tt_cursor::TtCursor;
|
2019-01-31 13:46:40 +03:00
|
|
|
|
|
|
|
/// This module parses a raw `tt::TokenStream` into macro-by-example token
|
|
|
|
/// stream. This is a *mostly* identify function, expect for handling of
|
|
|
|
/// `$var:tt_kind` and `$(repeat),*` constructs.
|
|
|
|
|
|
|
|
pub fn parse(tt: &tt::Subtree) -> Option<mbe::MacroRules> {
|
2019-01-31 15:26:01 +03:00
|
|
|
let mut parser = TtCursor::new(tt);
|
2019-01-31 13:46:40 +03:00
|
|
|
let mut rules = Vec::new();
|
|
|
|
while !parser.is_eof() {
|
|
|
|
rules.push(parse_rule(&mut parser)?)
|
|
|
|
}
|
|
|
|
Some(mbe::MacroRules { rules })
|
|
|
|
}
|
|
|
|
|
2019-01-31 15:26:01 +03:00
|
|
|
fn parse_rule(p: &mut TtCursor) -> Option<mbe::Rule> {
|
2019-01-31 13:46:40 +03:00
|
|
|
let lhs = parse_subtree(p.eat_subtree()?)?;
|
|
|
|
p.expect_char('=')?;
|
|
|
|
p.expect_char('>')?;
|
|
|
|
let rhs = parse_subtree(p.eat_subtree()?)?;
|
|
|
|
Some(mbe::Rule { lhs, rhs })
|
|
|
|
}
|
|
|
|
|
|
|
|
fn parse_subtree(tt: &tt::Subtree) -> Option<mbe::Subtree> {
|
|
|
|
let mut token_trees = Vec::new();
|
2019-01-31 15:26:01 +03:00
|
|
|
let mut p = TtCursor::new(tt);
|
2019-01-31 13:46:40 +03:00
|
|
|
while let Some(tt) = p.eat() {
|
|
|
|
let child: mbe::TokenTree = match tt {
|
|
|
|
tt::TokenTree::Leaf(leaf) => match leaf {
|
2019-01-31 18:51:17 +03:00
|
|
|
tt::Leaf::Punct(tt::Punct { char: '$', .. }) => {
|
2019-01-31 13:46:40 +03:00
|
|
|
if p.at_ident().is_some() {
|
|
|
|
mbe::Leaf::from(parse_var(&mut p)?).into()
|
|
|
|
} else {
|
|
|
|
parse_repeat(&mut p)?.into()
|
|
|
|
}
|
|
|
|
}
|
2019-01-31 18:51:17 +03:00
|
|
|
tt::Leaf::Punct(punct) => mbe::Leaf::from(*punct).into(),
|
2019-01-31 13:46:40 +03:00
|
|
|
tt::Leaf::Ident(tt::Ident { text }) => {
|
|
|
|
mbe::Leaf::from(mbe::Ident { text: text.clone() }).into()
|
|
|
|
}
|
|
|
|
tt::Leaf::Literal(tt::Literal { text }) => {
|
|
|
|
mbe::Leaf::from(mbe::Literal { text: text.clone() }).into()
|
|
|
|
}
|
|
|
|
},
|
|
|
|
tt::TokenTree::Subtree(subtree) => parse_subtree(subtree)?.into(),
|
|
|
|
};
|
|
|
|
token_trees.push(child);
|
|
|
|
}
|
|
|
|
Some(mbe::Subtree {
|
|
|
|
token_trees,
|
|
|
|
delimiter: tt.delimiter,
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2019-01-31 15:26:01 +03:00
|
|
|
fn parse_var(p: &mut TtCursor) -> Option<mbe::Var> {
|
2019-01-31 13:46:40 +03:00
|
|
|
let ident = p.eat_ident().unwrap();
|
|
|
|
let text = ident.text.clone();
|
|
|
|
let kind = if p.at_char(':') {
|
|
|
|
p.bump();
|
|
|
|
if let Some(ident) = p.eat_ident() {
|
|
|
|
Some(ident.text.clone())
|
|
|
|
} else {
|
2019-01-31 15:26:01 +03:00
|
|
|
p.rev_bump();
|
2019-01-31 13:46:40 +03:00
|
|
|
None
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
None
|
|
|
|
};
|
|
|
|
Some(mbe::Var { text, kind })
|
|
|
|
}
|
|
|
|
|
2019-01-31 15:26:01 +03:00
|
|
|
fn parse_repeat(p: &mut TtCursor) -> Option<mbe::Repeat> {
|
2019-01-31 13:46:40 +03:00
|
|
|
let subtree = p.eat_subtree().unwrap();
|
|
|
|
let subtree = parse_subtree(subtree)?;
|
|
|
|
let sep = p.eat_punct()?;
|
|
|
|
let (separator, rep) = match sep.char {
|
|
|
|
'*' | '+' | '?' => (None, sep.char),
|
2019-01-31 18:51:17 +03:00
|
|
|
char => (Some(char), p.eat_punct()?.char),
|
2019-01-31 13:46:40 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
let kind = match rep {
|
|
|
|
'*' => mbe::RepeatKind::ZeroOrMore,
|
|
|
|
'+' => mbe::RepeatKind::OneOrMore,
|
2019-01-31 17:16:02 +03:00
|
|
|
'?' => mbe::RepeatKind::ZeroOrOne,
|
2019-01-31 13:46:40 +03:00
|
|
|
_ => return None,
|
|
|
|
};
|
|
|
|
p.bump();
|
|
|
|
Some(mbe::Repeat {
|
|
|
|
subtree,
|
|
|
|
kind,
|
|
|
|
separator,
|
|
|
|
})
|
|
|
|
}
|