rust/src/parser/grammar/mod.rs

131 lines
2.9 KiB
Rust
Raw Normal View History

2018-01-20 15:31:29 -06:00
use super::parser::{Parser, TokenSet};
2018-01-27 17:31:23 -06:00
use SyntaxKind;
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;
mod type_params;
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);
2018-01-28 03:57:03 -06:00
items::mod_contents(p, false);
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) {
2018-01-28 05:33:10 -06:00
match p.nth(1) {
2018-01-28 05:58:01 -06:00
CRATE_KW | SELF_KW | SUPER_KW => {
2018-01-20 08:21:13 -06:00
p.bump();
2018-01-28 05:58:01 -06:00
p.bump();
p.expect(R_PAREN);
}
IN_KW => {
p.bump();
p.bump();
paths::use_path(p);
2018-01-20 08:21:13 -06:00
p.expect(R_PAREN);
}
2018-01-27 17:31:23 -06:00
_ => (),
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-28 11:48:37 -06:00
fn error_block(p: &mut Parser, message: &str) {
assert!(p.at(L_CURLY));
let err = p.start();
p.error().message(message).emit();
p.bump();
let mut level: u32 = 1;
while level > 0 && !p.at(EOF) {
match p.current() {
L_CURLY => level += 1,
R_CURLY => level -= 1,
_ => (),
}
p.bump();
}
err.complete(p, ERROR);
}
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
2018-01-27 15:05:31 -06:00
fn err_and_bump(&mut self, message: &str) {
let err = self.start();
2018-01-27 17:31:23 -06:00
self.error().message(message).emit();
2018-01-27 15:05:31 -06:00
self.bump();
err.complete(self, ERROR);
}
2018-01-28 05:30:59 -06:00
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 {
2018-01-27 17:31:23 -06:00
self.error().message(format!("expected {:?}", kind)).emit();
2018-01-07 03:13:01 -06:00
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 {
2018-01-27 17:31:23 -06:00
self.current() == kind && {
self.bump();
true
}
2018-01-07 12:40:18 -06:00
}
2018-01-08 13:40:14 -06:00
}
trait Lookahead: Copy {
fn is_ahead(self, p: &Parser) -> bool;
}
impl Lookahead for SyntaxKind {
fn is_ahead(self, p: &Parser) -> bool {
p.current() == self
}
}
impl Lookahead for [SyntaxKind; 2] {
fn is_ahead(self, p: &Parser) -> bool {
2018-01-28 05:33:10 -06:00
p.current() == self[0] && p.nth(1) == self[1]
2018-01-08 13:40:14 -06:00
}
}
impl Lookahead for [SyntaxKind; 3] {
fn is_ahead(self, p: &Parser) -> bool {
2018-01-28 05:33:10 -06:00
p.current() == self[0] && p.nth(1) == self[1] && p.nth(2) == self[2]
2018-01-08 13:40:14 -06:00
}
}
#[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)
}
2018-01-20 08:21:13 -06:00
}