1 //! This is the actual "grammar" of the Rust language.
3 //! Each function in this module and its children corresponds
4 //! to a production of the formal grammar. Submodules roughly
5 //! correspond to different *areas* of the grammar. By convention,
6 //! each submodule starts with `use super::*` import and exports
7 //! "public" productions via `pub(super)`.
9 //! See docs for [`Parser`](super::parser::Parser) to learn about API,
10 //! available to the grammar, and see docs for [`Event`](super::event::Event)
11 //! to learn how this actually manages to produce parse trees.
13 //! Code in this module also contains inline tests, which start with
14 //! `// test name-of-the-test` comment and look like this:
17 //! // test function_with_zero_parameters
21 //! After adding a new inline-test, run `cargo test -p xtask` to
22 //! extract it as a standalone text-fixture into
23 //! `crates/syntax/test_data/parser/`, and run `cargo test` once to
24 //! create the "gold" value.
26 //! Coding convention: rules like `where_clause` always produce either a
27 //! node or an error, rules like `opt_where_clause` may produce nothing.
28 //! Non-opt rules typically start with `assert!(p.at(FIRST_TOKEN))`, the
29 //! caller is responsible for branching on the first token.
42 parser::{CompletedMarker, Marker, Parser},
43 SyntaxKind::{self, *},
47 pub(crate) mod entry {
50 pub(crate) mod prefix {
53 pub(crate) fn vis(p: &mut Parser) {
54 let _ = opt_visibility(p, false);
59 pub(crate) mod entry_points {
62 pub(crate) fn source_file(p: &mut Parser) {
65 items::mod_contents(p, false);
66 m.complete(p, SOURCE_FILE);
69 pub(crate) use expressions::block_expr;
71 pub(crate) use paths::type_path as path;
73 pub(crate) use patterns::pattern_single as pattern;
75 pub(crate) use types::type_;
77 pub(crate) fn expr(p: &mut Parser) {
78 let _ = expressions::expr(p);
81 pub(crate) fn stmt(p: &mut Parser) {
82 expressions::stmt(p, expressions::StmtWithSemi::No, true);
85 pub(crate) fn stmt_optional_semi(p: &mut Parser) {
86 expressions::stmt(p, expressions::StmtWithSemi::Optional, false);
89 pub(crate) fn visibility(p: &mut Parser) {
90 let _ = opt_visibility(p, false);
93 // Parse a meta item , which excluded [], e.g : #[ MetaItem ]
94 pub(crate) fn meta_item(p: &mut Parser) {
98 pub(crate) fn item(p: &mut Parser) {
99 items::item_or_macro(p, true);
102 pub(crate) fn macro_items(p: &mut Parser) {
104 items::mod_contents(p, false);
105 m.complete(p, MACRO_ITEMS);
108 pub(crate) fn macro_stmts(p: &mut Parser) {
117 expressions::stmt(p, expressions::StmtWithSemi::Optional, true);
120 m.complete(p, MACRO_STMTS);
123 pub(crate) fn attr(p: &mut Parser) {
124 attributes::outer_attrs(p);
128 pub(crate) fn reparser(
130 first_child: Option<SyntaxKind>,
131 parent: Option<SyntaxKind>,
132 ) -> Option<fn(&mut Parser)> {
133 let res = match node {
134 BLOCK_EXPR => expressions::block_expr,
135 RECORD_FIELD_LIST => items::record_field_list,
136 RECORD_EXPR_FIELD_LIST => items::record_expr_field_list,
137 VARIANT_LIST => items::variant_list,
138 MATCH_ARM_LIST => items::match_arm_list,
139 USE_TREE_LIST => items::use_tree_list,
140 EXTERN_ITEM_LIST => items::extern_item_list,
141 TOKEN_TREE if first_child? == T!['{'] => items::token_tree,
142 ASSOC_ITEM_LIST => match parent? {
143 IMPL | TRAIT => items::assoc_item_list,
146 ITEM_LIST => items::item_list,
152 #[derive(Clone, Copy, PartialEq, Eq)]
159 fn is_block(self) -> bool {
160 self == BlockLike::Block
164 fn opt_visibility(p: &mut Parser, in_tuple_field: bool) -> bool {
171 // test crate_visibility
172 // pub(crate) struct S;
173 // pub(self) struct S;
174 // pub(super) struct S;
176 // test pub_parens_typepath
177 // struct B(pub (super::A));
178 // struct B(pub (crate::A,));
179 T![crate] | T![self] | T![super] | T![ident] if p.nth(2) != T![:] => {
180 // If we are in a tuple struct, then the parens following `pub`
181 // might be an tuple field, not part of the visibility. So in that
182 // case we don't want to consume an identifier.
184 // test pub_tuple_field
185 // struct MyStruct(pub (u32, u32));
186 if !(in_tuple_field && matches!(p.nth(1), T![ident])) {
192 // test crate_visibility_in
193 // pub(in super::A) struct S;
194 // pub(in crate) struct S;
204 m.complete(p, VISIBILITY);
207 // test crate_keyword_vis
208 // crate fn main() { }
209 // struct S { crate field: u32 }
210 // struct T(crate u32);
212 if p.nth_at(1, T![::]) {
213 // test crate_keyword_path
214 // fn foo() { crate::foo(); }
219 m.complete(p, VISIBILITY);
226 fn opt_rename(p: &mut Parser) {
233 m.complete(p, RENAME);
237 fn abi(p: &mut Parser) {
238 assert!(p.at(T![extern]));
242 abi.complete(p, ABI);
245 fn opt_ret_type(p: &mut Parser) -> bool {
249 types::type_no_bounds(p);
250 m.complete(p, RET_TYPE);
257 fn name_r(p: &mut Parser, recovery: TokenSet) {
263 p.err_recover("expected a name", recovery);
267 fn name(p: &mut Parser) {
268 name_r(p, TokenSet::EMPTY);
271 fn name_ref(p: &mut Parser) {
275 m.complete(p, NAME_REF);
277 p.err_and_bump("expected identifier");
281 fn name_ref_or_index(p: &mut Parser) {
282 assert!(p.at(IDENT) || p.at(INT_NUMBER));
285 m.complete(p, NAME_REF);
288 fn lifetime(p: &mut Parser) {
289 assert!(p.at(LIFETIME_IDENT));
291 p.bump(LIFETIME_IDENT);
292 m.complete(p, LIFETIME);
295 fn error_block(p: &mut Parser, message: &str) {
296 assert!(p.at(T!['{']));
300 expressions::expr_block_contents(p);
302 m.complete(p, ERROR);