2018-01-01 07:05:46 -06:00
|
|
|
use super::parser::Parser;
|
2018-01-06 12:54:55 -06:00
|
|
|
use {SyntaxKind};
|
2018-01-07 12:09:05 -06:00
|
|
|
use tree::EOF;
|
2018-01-01 07:05:46 -06:00
|
|
|
use syntax_kinds::*;
|
|
|
|
|
2018-01-07 12:46:10 -06:00
|
|
|
mod items;
|
|
|
|
mod attributes;
|
|
|
|
mod expressions;
|
2018-01-09 14:32:18 -06:00
|
|
|
mod paths;
|
2018-01-01 09:58:46 -06:00
|
|
|
|
2018-01-07 11:14:26 -06:00
|
|
|
pub(crate) fn file(p: &mut Parser) {
|
2018-01-06 12:54:55 -06:00
|
|
|
node(p, FILE, |p| {
|
2018-01-09 14:32:18 -06:00
|
|
|
p.eat(SHEBANG);
|
2018-01-09 13:35:55 -06:00
|
|
|
items::mod_contents(p);
|
2018-01-06 12:54:55 -06:00
|
|
|
})
|
2018-01-01 09:58:46 -06:00
|
|
|
}
|
|
|
|
|
2018-01-12 13:05:46 -06:00
|
|
|
fn visibility(p: &mut Parser) {
|
|
|
|
node_if(p, PUB_KW, VISIBILITY, |p| {
|
|
|
|
if p.current() != L_PAREN {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
match p.raw_lookahead(1) {
|
|
|
|
CRATE_KW | SELF_KW | SUPER_KW => {
|
|
|
|
p.bump();
|
|
|
|
p.bump();
|
|
|
|
}
|
|
|
|
IN_KW => {
|
|
|
|
p.bump();
|
|
|
|
p.bump();
|
|
|
|
paths::use_path(p);
|
|
|
|
}
|
|
|
|
_ => return
|
|
|
|
}
|
|
|
|
p.expect(R_PAREN);
|
|
|
|
});
|
2018-01-01 09:58:46 -06:00
|
|
|
}
|
|
|
|
|
2018-01-08 15:06:42 -06:00
|
|
|
fn alias(p: &mut Parser) -> bool {
|
|
|
|
node_if(p, AS_KW, ALIAS, |p| {
|
|
|
|
p.expect(IDENT);
|
|
|
|
});
|
|
|
|
true //FIXME: return false if three are errors
|
|
|
|
}
|
|
|
|
|
2018-01-08 13:40:14 -06:00
|
|
|
fn node_if<F: FnOnce(&mut Parser), L: Lookahead>(
|
2018-01-07 12:40:18 -06:00
|
|
|
p: &mut Parser,
|
2018-01-08 13:40:14 -06:00
|
|
|
first: L,
|
2018-01-07 12:40:18 -06:00
|
|
|
node_kind: SyntaxKind,
|
|
|
|
rest: F
|
|
|
|
) -> bool {
|
2018-01-08 13:40:14 -06:00
|
|
|
first.is_ahead(p) && { node(p, node_kind, |p| { L::consume(p); rest(p); }); true }
|
2018-01-01 09:58:46 -06:00
|
|
|
}
|
|
|
|
|
2018-01-06 12:54:55 -06:00
|
|
|
fn node<F: FnOnce(&mut Parser)>(p: &mut Parser, node_kind: SyntaxKind, rest: F) {
|
|
|
|
p.start(node_kind);
|
|
|
|
rest(p);
|
2018-01-01 07:05:46 -06:00
|
|
|
p.finish();
|
2018-01-06 08:16:00 -06:00
|
|
|
}
|
|
|
|
|
2018-01-12 11:59:19 -06:00
|
|
|
fn many<F: FnMut(&mut Parser) -> bool>(p: &mut Parser, mut f: F) {
|
2018-01-11 14:01:12 -06:00
|
|
|
loop {
|
|
|
|
let pos = p.pos();
|
|
|
|
if !f(p) {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
if pos == p.pos() {
|
|
|
|
panic!("Infinite loop in parser")
|
|
|
|
}
|
|
|
|
}
|
2018-01-06 08:16:00 -06:00
|
|
|
}
|
|
|
|
|
2018-01-07 12:40:18 -06:00
|
|
|
fn comma_list<F: Fn(&mut Parser) -> bool>(p: &mut Parser, end: SyntaxKind, f: F) {
|
2018-01-06 12:54:55 -06:00
|
|
|
many(p, |p| {
|
2018-01-07 12:40:18 -06:00
|
|
|
if !f(p) || p.current() == end {
|
2018-01-07 03:32:29 -06:00
|
|
|
false
|
|
|
|
} else {
|
|
|
|
p.expect(COMMA);
|
|
|
|
true
|
|
|
|
}
|
2018-01-06 12:54:55 -06:00
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2018-01-07 05:56:08 -06:00
|
|
|
fn skip_to_first<C, F>(p: &mut Parser, cond: C, f: F, message: &str) -> bool
|
2018-01-06 12:54:55 -06:00
|
|
|
where
|
|
|
|
C: Fn(&Parser) -> bool,
|
|
|
|
F: FnOnce(&mut Parser),
|
|
|
|
{
|
2018-01-07 05:56:08 -06:00
|
|
|
let mut skipped = false;
|
2018-01-06 08:16:00 -06:00
|
|
|
loop {
|
2018-01-06 12:54:55 -06:00
|
|
|
if cond(p) {
|
2018-01-07 05:56:08 -06:00
|
|
|
if skipped {
|
|
|
|
p.finish();
|
|
|
|
}
|
2018-01-06 12:54:55 -06:00
|
|
|
f(p);
|
|
|
|
return true;
|
2018-01-06 08:16:00 -06:00
|
|
|
}
|
2018-01-07 12:09:05 -06:00
|
|
|
if p.current() == EOF {
|
2018-01-07 05:56:08 -06:00
|
|
|
if skipped {
|
|
|
|
p.finish();
|
|
|
|
}
|
2018-01-06 12:54:55 -06:00
|
|
|
return false;
|
2018-01-06 08:16:00 -06:00
|
|
|
}
|
2018-01-07 05:56:08 -06:00
|
|
|
if !skipped {
|
|
|
|
p.start(ERROR);
|
|
|
|
p.error()
|
|
|
|
.message(message)
|
|
|
|
.emit();
|
|
|
|
}
|
2018-01-07 12:09:05 -06:00
|
|
|
p.bump();
|
2018-01-07 05:56:08 -06:00
|
|
|
skipped = true;
|
2018-01-06 08:16:00 -06:00
|
|
|
}
|
2018-01-06 12:54:55 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
impl<'p> Parser<'p> {
|
|
|
|
pub(crate) fn expect(&mut self, kind: SyntaxKind) -> bool {
|
2018-01-07 12:09:05 -06:00
|
|
|
if self.current() == kind {
|
2018-01-07 03:13:01 -06:00
|
|
|
self.bump();
|
|
|
|
true
|
|
|
|
} else {
|
|
|
|
self.error()
|
|
|
|
.message(format!("expected {:?}", kind))
|
|
|
|
.emit();
|
|
|
|
false
|
|
|
|
}
|
2018-01-06 12:54:55 -06:00
|
|
|
}
|
2018-01-07 06:34:11 -06:00
|
|
|
|
2018-01-07 12:40:18 -06:00
|
|
|
fn eat(&mut self, kind: SyntaxKind) -> bool {
|
|
|
|
self.current() == kind && { self.bump(); true }
|
|
|
|
}
|
2018-01-08 13:40:14 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
trait Lookahead: Copy {
|
|
|
|
fn is_ahead(self, p: &Parser) -> bool;
|
|
|
|
fn consume(p: &mut Parser);
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Lookahead for SyntaxKind {
|
|
|
|
fn is_ahead(self, p: &Parser) -> bool {
|
|
|
|
p.current() == self
|
|
|
|
}
|
|
|
|
|
|
|
|
fn consume(p: &mut Parser) {
|
|
|
|
p.bump();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Lookahead for [SyntaxKind; 2] {
|
|
|
|
fn is_ahead(self, p: &Parser) -> bool {
|
|
|
|
p.current() == self[0]
|
|
|
|
&& p.raw_lookahead(1) == self[1]
|
|
|
|
}
|
|
|
|
|
|
|
|
fn consume(p: &mut Parser) {
|
|
|
|
p.bump();
|
|
|
|
p.bump();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Lookahead for [SyntaxKind; 3] {
|
|
|
|
fn is_ahead(self, p: &Parser) -> bool {
|
|
|
|
p.current() == self[0]
|
|
|
|
&& p.raw_lookahead(1) == self[1]
|
|
|
|
&& p.raw_lookahead(2) == self[2]
|
|
|
|
}
|
|
|
|
|
|
|
|
fn consume(p: &mut Parser) {
|
|
|
|
p.bump();
|
|
|
|
p.bump();
|
|
|
|
p.bump();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Clone, Copy)]
|
|
|
|
struct AnyOf<'a>(&'a [SyntaxKind]);
|
|
|
|
|
|
|
|
impl<'a> Lookahead for AnyOf<'a> {
|
|
|
|
fn is_ahead(self, p: &Parser) -> bool {
|
|
|
|
let curr = p.current();
|
|
|
|
self.0.iter().any(|&k| k == curr)
|
|
|
|
}
|
|
|
|
|
|
|
|
fn consume(p: &mut Parser) {
|
|
|
|
p.bump();
|
|
|
|
}
|
|
|
|
|
2018-01-01 07:05:46 -06:00
|
|
|
}
|