2018-08-04 13:58:22 +00:00
|
|
|
use super::*;
|
|
|
|
|
|
|
|
// test expr_literals
|
|
|
|
// fn foo() {
|
|
|
|
// let _ = true;
|
|
|
|
// let _ = false;
|
|
|
|
// let _ = 1;
|
|
|
|
// let _ = 2.0;
|
|
|
|
// let _ = b'a';
|
|
|
|
// let _ = 'b';
|
|
|
|
// let _ = "c";
|
|
|
|
// let _ = r"d";
|
|
|
|
// let _ = b"e";
|
|
|
|
// let _ = br"f";
|
|
|
|
// }
|
|
|
|
const LITERAL_FIRST: TokenSet =
|
|
|
|
token_set![TRUE_KW, FALSE_KW, INT_NUMBER, FLOAT_NUMBER, BYTE, CHAR,
|
|
|
|
STRING, RAW_STRING, BYTE_STRING, RAW_BYTE_STRING];
|
|
|
|
|
|
|
|
pub(crate) fn literal(p: &mut Parser) -> Option<CompletedMarker> {
|
|
|
|
if !LITERAL_FIRST.contains(p.current()) {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
Some(m.complete(p, LITERAL))
|
|
|
|
}
|
|
|
|
|
|
|
|
pub(super) const ATOM_EXPR_FIRST: TokenSet =
|
|
|
|
token_set_union![
|
|
|
|
LITERAL_FIRST,
|
2018-08-04 22:03:22 +00:00
|
|
|
token_set![L_PAREN, PIPE, MOVE_KW, IF_KW, WHILE_KW, MATCH_KW, UNSAFE_KW, L_CURLY, RETURN_KW,
|
2018-08-04 13:58:22 +00:00
|
|
|
IDENT, SELF_KW, SUPER_KW, COLONCOLON ],
|
|
|
|
];
|
|
|
|
|
2018-08-04 14:12:00 +00:00
|
|
|
pub(super) fn atom_expr(p: &mut Parser, r: Restrictions) -> Option<CompletedMarker> {
|
2018-08-04 13:58:22 +00:00
|
|
|
match literal(p) {
|
|
|
|
Some(m) => return Some(m),
|
|
|
|
None => (),
|
|
|
|
}
|
|
|
|
if paths::is_path_start(p) {
|
2018-08-04 14:12:00 +00:00
|
|
|
return Some(path_expr(p, r));
|
2018-08-04 13:58:22 +00:00
|
|
|
}
|
|
|
|
let la = p.nth(1);
|
|
|
|
let done = match p.current() {
|
|
|
|
L_PAREN => tuple_expr(p),
|
2018-08-05 15:24:56 +00:00
|
|
|
L_BRACK => array_expr(p),
|
2018-08-04 13:58:22 +00:00
|
|
|
PIPE => lambda_expr(p),
|
|
|
|
MOVE_KW if la == PIPE => lambda_expr(p),
|
|
|
|
IF_KW => if_expr(p),
|
2018-08-04 22:03:22 +00:00
|
|
|
WHILE_KW => while_expr(p),
|
2018-08-05 15:16:52 +00:00
|
|
|
LOOP_KW => loop_expr(p),
|
2018-08-05 15:24:56 +00:00
|
|
|
FOR_KW => for_expr(p),
|
2018-08-04 13:58:22 +00:00
|
|
|
MATCH_KW => match_expr(p),
|
|
|
|
UNSAFE_KW if la == L_CURLY => block_expr(p),
|
|
|
|
L_CURLY => block_expr(p),
|
|
|
|
RETURN_KW => return_expr(p),
|
|
|
|
_ => {
|
|
|
|
p.err_and_bump("expected expression");
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
Some(done)
|
|
|
|
}
|
|
|
|
|
2018-08-05 14:19:03 +00:00
|
|
|
// test tuple_expr
|
|
|
|
// fn foo() {
|
|
|
|
// ();
|
|
|
|
// (1);
|
|
|
|
// (1,);
|
|
|
|
// }
|
2018-08-04 13:58:22 +00:00
|
|
|
fn tuple_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(L_PAREN));
|
|
|
|
let m = p.start();
|
|
|
|
p.expect(L_PAREN);
|
2018-08-05 14:19:03 +00:00
|
|
|
|
|
|
|
let mut saw_comma = false;
|
|
|
|
let mut saw_expr = false;
|
|
|
|
while !p.at(EOF) && !p.at(R_PAREN) {
|
|
|
|
saw_expr = true;
|
|
|
|
expr(p);
|
|
|
|
if !p.at(R_PAREN) {
|
|
|
|
saw_comma = true;
|
|
|
|
p.expect(COMMA);
|
|
|
|
}
|
|
|
|
}
|
2018-08-04 13:58:22 +00:00
|
|
|
p.expect(R_PAREN);
|
2018-08-05 14:19:03 +00:00
|
|
|
m.complete(p, if saw_expr && !saw_comma { PAREN_EXPR } else { TUPLE_EXPR })
|
2018-08-04 13:58:22 +00:00
|
|
|
}
|
|
|
|
|
2018-08-05 15:24:56 +00:00
|
|
|
// test array_expr
|
|
|
|
// fn foo() {
|
|
|
|
// [];
|
|
|
|
// [1];
|
|
|
|
// [1, 2,];
|
|
|
|
// [1; 2];
|
|
|
|
// }
|
|
|
|
fn array_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(L_BRACK));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
if p.eat(R_BRACK) {
|
|
|
|
return m.complete(p, ARRAY_EXPR);
|
|
|
|
}
|
|
|
|
expr(p);
|
|
|
|
if p.eat(SEMI) {
|
|
|
|
expr(p);
|
|
|
|
p.expect(R_BRACK);
|
|
|
|
return m.complete(p, ARRAY_EXPR);
|
|
|
|
}
|
|
|
|
while !p.at(EOF) && !p.at(R_BRACK) {
|
|
|
|
p.expect(COMMA);
|
|
|
|
if !p.at(R_BRACK) {
|
|
|
|
expr(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
p.expect(R_BRACK);
|
|
|
|
m.complete(p, ARRAY_EXPR)
|
|
|
|
}
|
|
|
|
|
2018-08-04 13:58:22 +00:00
|
|
|
// test lambda_expr
|
|
|
|
// fn foo() {
|
|
|
|
// || ();
|
|
|
|
// || -> i32 { 92 };
|
|
|
|
// |x| x;
|
|
|
|
// move |x: i32,| x;
|
|
|
|
// }
|
|
|
|
fn lambda_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(PIPE) || (p.at(MOVE_KW) && p.nth(1) == PIPE));
|
|
|
|
let m = p.start();
|
|
|
|
p.eat(MOVE_KW);
|
|
|
|
params::param_list_opt_types(p);
|
|
|
|
if fn_ret_type(p) {
|
|
|
|
block(p);
|
|
|
|
} else {
|
2018-08-07 13:32:09 +00:00
|
|
|
expr(p);
|
2018-08-04 13:58:22 +00:00
|
|
|
}
|
|
|
|
m.complete(p, LAMBDA_EXPR)
|
|
|
|
}
|
|
|
|
|
|
|
|
// test if_expr
|
|
|
|
// fn foo() {
|
|
|
|
// if true {};
|
|
|
|
// if true {} else {};
|
2018-08-04 14:12:00 +00:00
|
|
|
// if true {} else if false {} else {};
|
|
|
|
// if S {};
|
2018-08-04 13:58:22 +00:00
|
|
|
// }
|
|
|
|
fn if_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(IF_KW));
|
|
|
|
let m = p.start();
|
2018-08-04 22:03:22 +00:00
|
|
|
p.bump();
|
|
|
|
cond(p);
|
2018-08-04 13:58:22 +00:00
|
|
|
block(p);
|
|
|
|
if p.at(ELSE_KW) {
|
|
|
|
p.bump();
|
|
|
|
if p.at(IF_KW) {
|
|
|
|
if_expr(p);
|
|
|
|
} else {
|
|
|
|
block(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
m.complete(p, IF_EXPR)
|
|
|
|
}
|
|
|
|
|
2018-08-04 22:03:22 +00:00
|
|
|
// test while_expr
|
|
|
|
// fn foo() {
|
|
|
|
// while true {};
|
|
|
|
// while let Some(x) = it.next() {};
|
|
|
|
// }
|
|
|
|
fn while_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(WHILE_KW));
|
|
|
|
let m = p.start();
|
2018-08-04 13:58:22 +00:00
|
|
|
p.bump();
|
2018-08-04 22:03:22 +00:00
|
|
|
cond(p);
|
|
|
|
block(p);
|
|
|
|
m.complete(p, WHILE_EXPR)
|
|
|
|
}
|
|
|
|
|
2018-08-05 15:16:52 +00:00
|
|
|
// test loop_expr
|
|
|
|
// fn foo() {
|
|
|
|
// loop {};
|
|
|
|
// }
|
|
|
|
fn loop_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(LOOP_KW));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
block(p);
|
|
|
|
m.complete(p, LOOP_EXPR)
|
|
|
|
}
|
|
|
|
|
2018-08-05 15:24:56 +00:00
|
|
|
// test for_expr
|
|
|
|
// fn foo() {
|
|
|
|
// for x in [] {};
|
|
|
|
// }
|
|
|
|
fn for_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(FOR_KW));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
patterns::pattern(p);
|
|
|
|
p.expect(IN_KW);
|
|
|
|
expr_no_struct(p);
|
|
|
|
block(p);
|
|
|
|
m.complete(p, FOR_EXPR)
|
|
|
|
}
|
|
|
|
|
2018-08-04 22:03:22 +00:00
|
|
|
// test cond
|
|
|
|
// fn foo() { if let Some(_) = None {} }
|
|
|
|
fn cond(p: &mut Parser) {
|
|
|
|
if p.eat(LET_KW) {
|
|
|
|
patterns::pattern(p);
|
|
|
|
p.expect(EQ);
|
|
|
|
}
|
|
|
|
expr_no_struct(p)
|
2018-08-04 13:58:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// test match_expr
|
|
|
|
// fn foo() {
|
|
|
|
// match () { };
|
2018-08-04 14:12:00 +00:00
|
|
|
// match S {};
|
2018-08-04 13:58:22 +00:00
|
|
|
// }
|
|
|
|
fn match_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(MATCH_KW));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
2018-08-04 14:12:00 +00:00
|
|
|
expr_no_struct(p);
|
2018-08-04 13:58:22 +00:00
|
|
|
p.eat(L_CURLY);
|
|
|
|
while !p.at(EOF) && !p.at(R_CURLY) {
|
2018-08-07 13:32:09 +00:00
|
|
|
// test match_arms_commas
|
|
|
|
// fn foo() {
|
|
|
|
// match () {
|
|
|
|
// _ => (),
|
|
|
|
// _ => {}
|
|
|
|
// _ => ()
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
if match_arm(p).is_block() {
|
|
|
|
p.eat(COMMA);
|
|
|
|
} else if !p.at(R_CURLY) {
|
2018-08-04 13:58:22 +00:00
|
|
|
p.expect(COMMA);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
p.expect(R_CURLY);
|
|
|
|
m.complete(p, MATCH_EXPR)
|
|
|
|
}
|
|
|
|
|
|
|
|
// test match_arm
|
|
|
|
// fn foo() {
|
|
|
|
// match () {
|
|
|
|
// _ => (),
|
|
|
|
// X | Y if Z => (),
|
|
|
|
// };
|
|
|
|
// }
|
2018-08-07 13:32:09 +00:00
|
|
|
fn match_arm(p: &mut Parser) -> BlockLike {
|
2018-08-04 13:58:22 +00:00
|
|
|
let m = p.start();
|
|
|
|
loop {
|
|
|
|
patterns::pattern(p);
|
|
|
|
if !p.eat(PIPE) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2018-08-04 22:03:22 +00:00
|
|
|
if p.eat(IF_KW) {
|
|
|
|
expr_no_struct(p);
|
2018-08-04 13:58:22 +00:00
|
|
|
}
|
|
|
|
p.expect(FAT_ARROW);
|
2018-08-07 14:00:45 +00:00
|
|
|
let ret = expr_stmt(p);
|
2018-08-04 13:58:22 +00:00
|
|
|
m.complete(p, MATCH_ARM);
|
2018-08-07 13:32:09 +00:00
|
|
|
ret
|
2018-08-04 13:58:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// test block_expr
|
|
|
|
// fn foo() {
|
|
|
|
// {};
|
|
|
|
// unsafe {};
|
|
|
|
// }
|
|
|
|
pub(super) fn block_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(L_CURLY) || p.at(UNSAFE_KW) && p.nth(1) == L_CURLY);
|
|
|
|
let m = p.start();
|
|
|
|
p.eat(UNSAFE_KW);
|
|
|
|
p.bump();
|
|
|
|
while !p.at(EOF) && !p.at(R_CURLY) {
|
|
|
|
match p.current() {
|
|
|
|
LET_KW => let_stmt(p),
|
|
|
|
_ => {
|
|
|
|
// test block_items
|
|
|
|
// fn a() { fn b() {} }
|
|
|
|
let m = p.start();
|
2018-08-13 15:40:47 +00:00
|
|
|
match items::maybe_item(p, items::ItemFlavor::Mod) {
|
2018-08-04 13:58:22 +00:00
|
|
|
items::MaybeItem::Item(kind) => {
|
|
|
|
m.complete(p, kind);
|
|
|
|
}
|
|
|
|
items::MaybeItem::Modifiers => {
|
|
|
|
m.abandon(p);
|
|
|
|
p.error("expected an item");
|
|
|
|
}
|
|
|
|
// test pub_expr
|
|
|
|
// fn foo() { pub 92; } //FIXME
|
|
|
|
items::MaybeItem::None => {
|
2018-08-07 14:00:45 +00:00
|
|
|
let is_blocklike = expressions::expr_stmt(p) == BlockLike::Block;
|
2018-08-07 13:32:09 +00:00
|
|
|
if p.eat(SEMI) || (is_blocklike && !p.at(R_CURLY)) {
|
2018-08-04 13:58:22 +00:00
|
|
|
m.complete(p, EXPR_STMT);
|
|
|
|
} else {
|
|
|
|
m.abandon(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
p.expect(R_CURLY);
|
|
|
|
m.complete(p, BLOCK_EXPR)
|
|
|
|
}
|
|
|
|
|
|
|
|
// test let_stmt;
|
|
|
|
// fn foo() {
|
|
|
|
// let a;
|
|
|
|
// let b: i32;
|
|
|
|
// let c = 92;
|
|
|
|
// let d: i32 = 92;
|
|
|
|
// }
|
|
|
|
fn let_stmt(p: &mut Parser) {
|
|
|
|
assert!(p.at(LET_KW));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
patterns::pattern(p);
|
|
|
|
if p.at(COLON) {
|
|
|
|
types::ascription(p);
|
|
|
|
}
|
|
|
|
if p.eat(EQ) {
|
|
|
|
expressions::expr(p);
|
|
|
|
}
|
|
|
|
p.expect(SEMI);
|
|
|
|
m.complete(p, LET_STMT);
|
|
|
|
}
|
|
|
|
|
|
|
|
// test return_expr
|
|
|
|
// fn foo() {
|
|
|
|
// return;
|
|
|
|
// return 92;
|
|
|
|
// }
|
|
|
|
fn return_expr(p: &mut Parser) -> CompletedMarker {
|
|
|
|
assert!(p.at(RETURN_KW));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
if EXPR_FIRST.contains(p.current()) {
|
|
|
|
expr(p);
|
|
|
|
}
|
|
|
|
m.complete(p, RETURN_EXPR)
|
|
|
|
}
|