rust/src/parser/event_parser/grammar/mod.rs

159 lines
3.2 KiB
Rust
Raw Normal View History

2018-01-20 15:31:29 -06:00
use super::parser::{Parser, TokenSet};
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-13 13:00:26 -06:00
mod types;
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-20 14:25:34 -06:00
let file = p.start();
2018-01-20 08:21:13 -06:00
p.eat(SHEBANG);
items::mod_contents(p);
2018-01-20 14:25:34 -06:00
file.complete(p, FILE);
2018-01-01 09:58:46 -06:00
}
2018-01-12 13:05:46 -06:00
fn visibility(p: &mut Parser) {
2018-01-20 08:21:13 -06:00
if p.at(PUB_KW) {
2018-01-20 14:25:34 -06:00
let vis = p.start();
2018-01-20 08:21:13 -06:00
p.bump();
if p.at(L_PAREN) {
match p.raw_lookahead(1) {
CRATE_KW | SELF_KW | SUPER_KW | IN_KW => {
p.bump();
if p.bump() == IN_KW {
paths::use_path(p);
}
p.expect(R_PAREN);
}
_ => ()
2018-01-12 13:05:46 -06:00
}
}
2018-01-20 14:25:34 -06:00
vis.complete(p, VISIBILITY);
2018-01-20 08:21:13 -06:00
}
2018-01-01 09:58:46 -06:00
}
2018-01-08 15:06:42 -06:00
fn alias(p: &mut Parser) -> bool {
2018-01-20 08:21:13 -06:00
if p.at(AS_KW) {
2018-01-20 14:25:34 -06:00
let alias = p.start();
2018-01-20 08:21:13 -06:00
p.bump();
2018-01-08 15:06:42 -06:00
p.expect(IDENT);
2018-01-20 14:25:34 -06:00
alias.complete(p, ALIAS);
2018-01-20 08:21:13 -06:00
}
2018-01-08 15:06:42 -06:00
true //FIXME: return false if three are errors
}
2018-01-15 12:44:30 -06:00
fn repeat<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-15 12:44:30 -06:00
repeat(p, |p| {
2018-01-13 13:00:26 -06:00
if p.current() == end {
return false
}
let pos = p.pos();
f(p);
if p.pos() == pos {
return false
}
if p.current() == end {
p.eat(COMMA);
2018-01-07 03:32:29 -06:00
} else {
p.expect(COMMA);
}
2018-01-13 13:00:26 -06:00
true
2018-01-06 12:54:55 -06:00
})
}
2018-01-20 08:21:13 -06:00
impl<'p> Parser<'p> {
2018-01-20 15:31:29 -06:00
fn at<L: Lookahead>(&self, l: L) -> bool {
l.is_ahead(self)
2018-01-06 08:16:00 -06:00
}
2018-01-06 12:54:55 -06:00
pub(crate) fn expect(&mut self, kind: SyntaxKind) -> bool {
2018-01-20 08:21:13 -06:00
if self.at(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-20 08:21:13 -06:00
}