Files
rust/src/grammar/expressions/mod.rs

258 lines
5.6 KiB
Rust
Raw Normal View History

2018-08-04 16:58:22 +03:00
mod atom;
use super::*;
pub(super) use self::atom::literal;
const EXPR_FIRST: TokenSet = UNARY_EXPR_FIRST;
pub(super) fn expr(p: &mut Parser) {
2018-08-04 17:12:00 +03:00
let r = Restrictions { forbid_structs: false };
expr_bp(p, r, 1)
}
fn expr_no_struct(p: &mut Parser) {
let r = Restrictions { forbid_structs: true };
expr_bp(p, r, 1)
2018-08-04 16:58:22 +03:00
}
// test block
// fn a() {}
// fn b() { let _ = 1; }
// fn c() { 1; 2; }
// fn d() { 1; 2 }
pub(super) fn block(p: &mut Parser) {
if !p.at(L_CURLY) {
p.error("expected block");
return;
}
atom::block_expr(p);
}
2018-08-04 17:12:00 +03:00
#[derive(Clone, Copy)]
struct Restrictions {
forbid_structs: bool
}
2018-08-04 16:58:22 +03:00
// test expr_binding_power
// fn foo() {
// 1 + 2 * 3 == 1 * 2 + 3
// }
fn bp_of(op: SyntaxKind) -> u8 {
match op {
EQEQ | NEQ => 1,
MINUS | PLUS => 2,
STAR | SLASH => 3,
_ => 0
}
}
// Parses expression with binding power of at least bp.
2018-08-04 17:12:00 +03:00
fn expr_bp(p: &mut Parser, r: Restrictions, bp: u8) {
let mut lhs = match unary_expr(p, r) {
2018-08-04 16:58:22 +03:00
Some(lhs) => lhs,
None => return,
};
loop {
let op_bp = bp_of(p.current());
if op_bp < bp {
break;
}
2018-08-04 17:12:00 +03:00
lhs = bin_expr(p, r, lhs, op_bp);
2018-08-04 16:58:22 +03:00
}
}
const UNARY_EXPR_FIRST: TokenSet =
token_set_union![
token_set![AMPERSAND, STAR, EXCL],
atom::ATOM_EXPR_FIRST,
];
2018-08-04 17:12:00 +03:00
fn unary_expr(p: &mut Parser, r: Restrictions) -> Option<CompletedMarker> {
let m;
let kind = match p.current() {
// test ref_expr
// fn foo() {
// let _ = &1;
// let _ = &mut &f();
// }
AMPERSAND => {
m = p.start();
p.bump();
p.eat(MUT_KW);
REF_EXPR
},
// test deref_expr
// fn foo() {
// **&1;
// }
STAR => {
m = p.start();
p.bump();
DEREF_EXPR
},
// test not_expr
// fn foo() {
// !!true;
// }
EXCL => {
m = p.start();
p.bump();
NOT_EXPR
},
2018-08-04 16:58:22 +03:00
_ => {
2018-08-04 17:12:00 +03:00
let lhs = atom::atom_expr(p, r)?;
return Some(postfix_expr(p, lhs))
2018-08-04 16:58:22 +03:00
}
};
2018-08-04 17:12:00 +03:00
expr(p);
Some(m.complete(p, kind))
2018-08-04 16:58:22 +03:00
}
fn postfix_expr(p: &mut Parser, mut lhs: CompletedMarker) -> CompletedMarker {
loop {
lhs = match p.current() {
L_PAREN => call_expr(p, lhs),
DOT if p.nth(1) == IDENT => if p.nth(2) == L_PAREN {
method_call_expr(p, lhs)
} else {
field_expr(p, lhs)
},
DOT if p.nth(1) == INT_NUMBER => field_expr(p, lhs),
QUESTION => try_expr(p, lhs),
_ => break,
}
}
lhs
}
// test call_expr
// fn foo() {
// let _ = f();
// let _ = f()(1)(1, 2,);
// }
fn call_expr(p: &mut Parser, lhs: CompletedMarker) -> CompletedMarker {
assert!(p.at(L_PAREN));
let m = lhs.precede(p);
arg_list(p);
m.complete(p, CALL_EXPR)
}
// test method_call_expr
// fn foo() {
// x.foo();
// y.bar(1, 2,);
// }
fn method_call_expr(p: &mut Parser, lhs: CompletedMarker) -> CompletedMarker {
assert!(p.at(DOT) && p.nth(1) == IDENT && p.nth(2) == L_PAREN);
let m = lhs.precede(p);
p.bump();
name_ref(p);
arg_list(p);
m.complete(p, METHOD_CALL_EXPR)
}
// test field_expr
// fn foo() {
// x.foo;
// x.0.bar;
// }
fn field_expr(p: &mut Parser, lhs: CompletedMarker) -> CompletedMarker {
assert!(p.at(DOT) && (p.nth(1) == IDENT || p.nth(1) == INT_NUMBER));
let m = lhs.precede(p);
p.bump();
if p.at(IDENT) {
name_ref(p)
} else {
p.bump()
}
m.complete(p, FIELD_EXPR)
}
// test try_expr
// fn foo() {
// x?;
// }
fn try_expr(p: &mut Parser, lhs: CompletedMarker) -> CompletedMarker {
assert!(p.at(QUESTION));
let m = lhs.precede(p);
p.bump();
m.complete(p, TRY_EXPR)
}
fn arg_list(p: &mut Parser) {
assert!(p.at(L_PAREN));
let m = p.start();
p.bump();
while !p.at(R_PAREN) && !p.at(EOF) {
expr(p);
if !p.at(R_PAREN) && !p.expect(COMMA) {
break;
}
}
p.eat(R_PAREN);
m.complete(p, ARG_LIST);
}
// test path_expr
// fn foo() {
// let _ = a;
// let _ = a::b;
// let _ = ::a::<b>;
// }
2018-08-04 17:12:00 +03:00
fn path_expr(p: &mut Parser, r: Restrictions) -> CompletedMarker {
2018-08-04 16:58:22 +03:00
assert!(paths::is_path_start(p));
let m = p.start();
paths::expr_path(p);
2018-08-04 17:12:00 +03:00
if p.at(L_CURLY) && !r.forbid_structs {
2018-08-04 16:58:22 +03:00
struct_lit(p);
m.complete(p, STRUCT_LIT)
} else {
m.complete(p, PATH_EXPR)
}
}
// test struct_lit
// fn foo() {
// S {};
// S { x, y: 32, };
// S { x, y: 32, ..Default::default() };
// }
fn struct_lit(p: &mut Parser) {
assert!(p.at(L_CURLY));
p.bump();
while !p.at(EOF) && !p.at(R_CURLY) {
match p.current() {
IDENT => {
let m = p.start();
name_ref(p);
if p.eat(COLON) {
expr(p);
}
m.complete(p, STRUCT_LIT_FIELD);
}
DOTDOT => {
p.bump();
expr(p);
}
_ => p.err_and_bump("expected identifier"),
}
if !p.at(R_CURLY) {
p.expect(COMMA);
}
}
p.expect(R_CURLY);
}
2018-08-04 17:12:00 +03:00
fn bin_expr(p: &mut Parser, r: Restrictions, lhs: CompletedMarker, bp: u8) -> CompletedMarker {
2018-08-04 16:58:22 +03:00
assert!(match p.current() {
MINUS | PLUS | STAR | SLASH | EQEQ | NEQ => true,
_ => false,
});
let m = lhs.precede(p);
p.bump();
2018-08-04 17:12:00 +03:00
expr_bp(p, r, bp);
2018-08-04 16:58:22 +03:00
m.complete(p, BIN_EXPR)
}