rust/crates/parser/src/grammar.rs

302 lines
8.0 KiB
Rust
Raw Normal View History

2018-02-11 08:58:22 -06:00
//! This is the actual "grammar" of the Rust language.
//!
//! Each function in this module and its children corresponds
//! to a production of the formal grammar. Submodules roughly
2018-02-11 08:58:22 -06:00
//! correspond to different *areas* of the grammar. By convention,
//! each submodule starts with `use super::*` import and exports
//! "public" productions via `pub(super)`.
//!
//! See docs for `Parser` to learn about API, available to the grammar,
//! and see docs for `Event` to learn how this actually manages to
//! produce parse trees.
//!
//! Code in this module also contains inline tests, which start with
//! `// test name-of-the-test` comment and look like this:
//!
//! ```
2018-08-09 09:44:40 -05:00
//! // test function_with_zero_parameters
2018-02-11 08:58:22 -06:00
//! // fn foo() {}
//! ```
//!
//! After adding a new inline-test, run `cargo xtask codegen` to
//! extract it as a standalone text-fixture into
2020-08-12 11:26:51 -05:00
//! `crates/syntax/test_data/parser/`, and run `cargo test` once to
//! create the "gold" value.
//!
//! Coding convention: rules like `where_clause` always produce either a
//! node or an error, rules like `opt_where_clause` may produce nothing.
//! Non-opt rules typically start with `assert!(p.at(FIRST_TOKEN))`, the
//! caller is responsible for branching on the first token.
2018-01-07 12:46:10 -06:00
mod attributes;
mod expressions;
2018-07-30 06:08:06 -05:00
mod items;
2018-07-31 15:38:19 -05:00
mod params;
2018-01-09 14:32:18 -06:00
mod paths;
2018-07-30 06:08:06 -05:00
mod patterns;
2018-07-31 15:13:08 -05:00
mod type_args;
2018-07-31 15:38:19 -05:00
mod type_params;
2018-07-30 06:08:06 -05:00
mod types;
2018-01-01 09:58:46 -06:00
use crate::{
parser::{CompletedMarker, Marker, Parser},
SyntaxKind::{self, *},
2019-02-21 04:27:45 -06:00
TokenSet,
};
2018-07-29 07:16:07 -05:00
2019-02-21 04:27:45 -06:00
pub(crate) fn root(p: &mut Parser) {
2018-08-25 06:45:17 -05:00
let m = 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-11-07 09:38:43 -06:00
m.complete(p, SOURCE_FILE);
2018-01-01 09:58:46 -06:00
}
2019-09-02 09:37:48 -05:00
/// Various pieces of syntax that can be parsed by macros by example
pub(crate) mod fragments {
use super::*;
2019-09-02 09:37:48 -05:00
pub(crate) use super::{
2020-05-02 07:34:39 -05:00
expressions::block_expr, paths::type_path as path, patterns::pattern, types::type_,
2019-09-02 09:37:48 -05:00
};
2019-04-18 14:49:56 -05:00
2019-09-02 09:37:48 -05:00
pub(crate) fn expr(p: &mut Parser) {
let _ = expressions::expr(p);
2019-04-18 14:49:56 -05:00
}
2019-09-02 10:51:03 -05:00
pub(crate) fn stmt(p: &mut Parser) {
expressions::stmt(p, expressions::StmtWithSemi::No)
2019-09-02 09:37:48 -05:00
}
2019-09-02 09:37:48 -05:00
pub(crate) fn opt_visibility(p: &mut Parser) {
let _ = super::opt_visibility(p);
}
2019-09-02 09:37:48 -05:00
// Parse a meta item , which excluded [], e.g : #[ MetaItem ]
pub(crate) fn meta_item(p: &mut Parser) {
fn is_delimiter(p: &mut Parser) -> bool {
2020-06-27 20:02:03 -05:00
matches!(p.current(), T!['{'] | T!['('] | T!['['])
2019-09-02 09:37:48 -05:00
}
2019-09-02 09:37:48 -05:00
if is_delimiter(p) {
items::token_tree(p);
return;
}
2019-04-18 14:49:56 -05:00
2019-09-02 09:37:48 -05:00
let m = p.start();
while !p.at(EOF) {
if is_delimiter(p) {
items::token_tree(p);
break;
} else {
// https://doc.rust-lang.org/reference/attributes.html
// https://doc.rust-lang.org/reference/paths.html#simple-paths
// The start of an meta must be a simple path
match p.current() {
2019-09-09 16:59:29 -05:00
IDENT | T![::] | T![super] | T![self] | T![crate] => p.bump_any(),
2019-09-02 09:37:48 -05:00
T![=] => {
2019-09-09 16:59:29 -05:00
p.bump_any();
2019-09-02 09:37:48 -05:00
match p.current() {
2019-09-09 16:59:29 -05:00
c if c.is_literal() => p.bump_any(),
T![true] | T![false] => p.bump_any(),
2019-09-02 09:37:48 -05:00
_ => {}
}
break;
}
_ => break,
}
}
}
2019-04-16 23:34:43 -05:00
2019-09-02 09:37:48 -05:00
m.complete(p, TOKEN_TREE);
}
2019-04-19 05:30:43 -05:00
2019-09-02 09:37:48 -05:00
pub(crate) fn item(p: &mut Parser) {
2020-08-12 07:26:36 -05:00
items::item_or_macro(p, true)
2019-04-19 06:33:29 -05:00
}
2019-09-02 09:37:48 -05:00
pub(crate) fn macro_items(p: &mut Parser) {
let m = p.start();
items::mod_contents(p, false);
m.complete(p, MACRO_ITEMS);
2019-04-19 06:33:29 -05:00
}
2019-09-02 09:37:48 -05:00
pub(crate) fn macro_stmts(p: &mut Parser) {
let m = p.start();
while !p.at(EOF) {
2019-09-09 05:23:37 -05:00
if p.at(T![;]) {
p.bump(T![;]);
2019-09-02 09:37:48 -05:00
continue;
2019-04-25 10:12:57 -05:00
}
2019-09-02 09:37:48 -05:00
expressions::stmt(p, expressions::StmtWithSemi::Optional);
2019-04-19 06:33:29 -05:00
}
2019-09-02 09:37:48 -05:00
m.complete(p, MACRO_STMTS);
}
2019-04-17 21:21:36 -05:00
}
2019-02-21 04:27:45 -06:00
pub(crate) fn reparser(
node: SyntaxKind,
first_child: Option<SyntaxKind>,
parent: Option<SyntaxKind>,
) -> Option<fn(&mut Parser)> {
let res = match node {
2020-05-02 07:34:39 -05:00
BLOCK_EXPR => expressions::block_expr,
2020-08-13 10:58:35 -05:00
RECORD_FIELD_LIST => items::record_field_list,
RECORD_EXPR_FIELD_LIST => items::record_expr_field_list,
VARIANT_LIST => items::variant_list,
2019-02-20 07:02:06 -06:00
MATCH_ARM_LIST => items::match_arm_list,
USE_TREE_LIST => items::use_tree_list,
EXTERN_ITEM_LIST => items::extern_item_list,
2019-05-15 07:35:47 -05:00
TOKEN_TREE if first_child? == T!['{'] => items::token_tree,
2020-07-30 04:48:19 -05:00
ASSOC_ITEM_LIST => match parent? {
2020-08-13 10:58:35 -05:00
IMPL => items::assoc_item_list,
TRAIT => items::assoc_item_list,
_ => return None,
},
2020-08-13 10:58:35 -05:00
ITEM_LIST => items::item_list,
2019-02-20 07:02:06 -06:00
_ => return None,
};
Some(res)
}
2018-08-07 08:32:09 -05:00
#[derive(Clone, Copy, PartialEq, Eq)]
2018-08-07 08:11:40 -05:00
enum BlockLike {
Block,
NotBlock,
}
2018-08-07 08:32:09 -05:00
impl BlockLike {
fn is_block(self) -> bool {
self == BlockLike::Block
}
2018-08-07 08:32:09 -05:00
}
2019-09-02 09:37:48 -05:00
fn opt_visibility(p: &mut Parser) -> bool {
2018-08-08 14:09:47 -05:00
match p.current() {
2019-05-15 07:35:47 -05:00
T![pub] => {
2018-08-08 14:09:47 -05:00
let m = p.start();
p.bump(T![pub]);
2019-05-15 07:35:47 -05:00
if p.at(T!['(']) {
2018-08-08 14:09:47 -05:00
match p.nth(1) {
// test crate_visibility
// pub(crate) struct S;
// pub(self) struct S;
// pub(self) struct S;
// pub(self) struct S;
// test pub_parens_typepath
// struct B(pub (super::A));
// struct B(pub (crate::A,));
T![crate] | T![self] | T![super] if p.nth(2) != T![:] => {
2019-09-09 16:59:29 -05:00
p.bump_any();
p.bump_any();
2019-05-15 07:35:47 -05:00
p.expect(T![')']);
2018-08-08 14:09:47 -05:00
}
2019-05-15 07:35:47 -05:00
T![in] => {
2019-09-09 16:59:29 -05:00
p.bump_any();
p.bump_any();
2018-08-08 14:09:47 -05:00
paths::use_path(p);
2019-05-15 07:35:47 -05:00
p.expect(T![')']);
2018-08-08 14:09:47 -05:00
}
_ => (),
2018-01-20 08:21:13 -06:00
}
2018-01-12 13:05:46 -06:00
}
2018-08-08 14:09:47 -05:00
m.complete(p, VISIBILITY);
2018-01-12 13:05:46 -06:00
}
2018-08-08 14:09:47 -05:00
// test crate_keyword_vis
// crate fn main() { }
// struct S { crate field: u32 }
// struct T(crate u32);
//
// test crate_keyword_path
// fn foo() { crate::foo(); }
T![crate] if !p.nth_at(1, T![::]) => {
2018-08-08 14:09:47 -05:00
let m = p.start();
2019-09-19 14:51:46 -05:00
p.bump(T![crate]);
2018-08-08 14:09:47 -05:00
m.complete(p, VISIBILITY);
}
_ => return false,
2018-01-20 08:21:13 -06:00
}
true
2018-01-01 09:58:46 -06:00
}
2018-08-23 17:19:38 -05:00
2020-08-13 10:58:35 -05:00
fn opt_rename(p: &mut Parser) {
2019-05-15 07:35:47 -05:00
if p.at(T![as]) {
2018-08-23 17:19:38 -05:00
let m = p.start();
2019-09-19 14:51:46 -05:00
p.bump(T![as]);
2019-05-15 07:35:47 -05:00
if !p.eat(T![_]) {
name(p);
}
2020-07-30 04:58:41 -05:00
m.complete(p, RENAME);
2018-01-20 08:21:13 -06:00
}
2018-01-08 15:06:42 -06:00
}
2018-02-11 03:51:09 -06:00
fn abi(p: &mut Parser) {
2019-05-15 07:35:47 -05:00
assert!(p.at(T![extern]));
2018-02-11 03:51:09 -06:00
let abi = p.start();
2019-09-19 14:51:46 -05:00
p.bump(T![extern]);
p.eat(STRING);
2018-02-11 03:51:09 -06:00
abi.complete(p, ABI);
}
2020-08-13 10:58:35 -05:00
fn opt_ret_type(p: &mut Parser) -> bool {
2019-05-15 07:35:47 -05:00
if p.at(T![->]) {
2018-08-28 13:11:17 -05:00
let m = p.start();
p.bump(T![->]);
types::type_no_bounds(p);
2018-08-28 13:11:17 -05:00
m.complete(p, RET_TYPE);
2018-07-31 15:13:08 -05:00
true
} else {
false
2018-02-11 03:51:09 -06:00
}
}
2018-08-31 05:35:48 -05:00
fn name_r(p: &mut Parser, recovery: TokenSet) {
2018-02-10 05:00:23 -06:00
if p.at(IDENT) {
let m = p.start();
2019-09-19 14:51:46 -05:00
p.bump(IDENT);
2018-02-10 05:00:23 -06:00
m.complete(p, NAME);
} else {
2018-08-31 05:35:48 -05:00
p.err_recover("expected a name", recovery);
2018-02-10 05:00:23 -06:00
}
}
2018-08-31 05:35:48 -05:00
fn name(p: &mut Parser) {
2019-12-19 10:13:08 -06:00
name_r(p, TokenSet::EMPTY)
2018-08-31 05:35:48 -05:00
}
2019-08-09 05:16:47 -05:00
fn name_ref(p: &mut Parser) {
if p.at(IDENT) {
2018-02-10 05:17:38 -06:00
let m = p.start();
2019-09-19 14:51:46 -05:00
p.bump(IDENT);
2018-02-10 05:17:38 -06:00
m.complete(p, NAME_REF);
} else {
2018-08-13 10:30:56 -05:00
p.err_and_bump("expected identifier");
2018-02-10 05:17:38 -06:00
}
}
2019-08-09 05:16:47 -05:00
fn name_ref_or_index(p: &mut Parser) {
2020-04-11 16:08:05 -05:00
assert!(p.at(IDENT) || p.at(INT_NUMBER));
let m = p.start();
p.bump_any();
m.complete(p, NAME_REF);
2019-08-09 05:16:47 -05:00
}
2020-12-15 12:23:51 -06:00
fn lifetime(p: &mut Parser) {
assert!(p.at(LIFETIME_IDENT));
let m = p.start();
p.bump(LIFETIME_IDENT);
m.complete(p, LIFETIME);
}
2018-01-28 11:48:37 -06:00
fn error_block(p: &mut Parser, message: &str) {
2019-05-15 07:35:47 -05:00
assert!(p.at(T!['{']));
let m = p.start();
p.error(message);
2019-09-19 14:51:46 -05:00
p.bump(T!['{']);
expressions::expr_block_contents(p);
2019-05-15 07:35:47 -05:00
p.eat(T!['}']);
m.complete(p, ERROR);
2018-01-28 11:48:37 -06:00
}