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);
57 pub(crate) fn block(p: &mut Parser) {
58 expressions::block_expr(p);
61 pub(crate) fn stmt(p: &mut Parser) {
62 expressions::stmt(p, expressions::StmtWithSemi::No, true);
65 pub(crate) fn pat(p: &mut Parser) {
66 patterns::pattern_single(p);
69 pub(crate) fn ty(p: &mut Parser) {
72 pub(crate) fn expr(p: &mut Parser) {
73 let _ = expressions::expr(p);
78 pub(crate) mod entry_points {
81 pub(crate) fn source_file(p: &mut Parser) {
84 items::mod_contents(p, false);
85 m.complete(p, SOURCE_FILE);
88 pub(crate) use paths::type_path as path;
90 pub(crate) fn expr(p: &mut Parser) {
91 let _ = expressions::expr(p);
94 pub(crate) fn stmt_optional_semi(p: &mut Parser) {
95 expressions::stmt(p, expressions::StmtWithSemi::Optional, false);
98 // Parse a meta item , which excluded [], e.g : #[ MetaItem ]
99 pub(crate) fn meta_item(p: &mut Parser) {
103 pub(crate) fn item(p: &mut Parser) {
104 items::item_or_macro(p, true);
107 pub(crate) fn macro_items(p: &mut Parser) {
109 items::mod_contents(p, false);
110 m.complete(p, MACRO_ITEMS);
113 pub(crate) fn macro_stmts(p: &mut Parser) {
122 expressions::stmt(p, expressions::StmtWithSemi::Optional, true);
125 m.complete(p, MACRO_STMTS);
128 pub(crate) fn attr(p: &mut Parser) {
129 attributes::outer_attrs(p);
133 pub(crate) fn reparser(
135 first_child: Option<SyntaxKind>,
136 parent: Option<SyntaxKind>,
137 ) -> Option<fn(&mut Parser)> {
138 let res = match node {
139 BLOCK_EXPR => expressions::block_expr,
140 RECORD_FIELD_LIST => items::record_field_list,
141 RECORD_EXPR_FIELD_LIST => items::record_expr_field_list,
142 VARIANT_LIST => items::variant_list,
143 MATCH_ARM_LIST => items::match_arm_list,
144 USE_TREE_LIST => items::use_tree_list,
145 EXTERN_ITEM_LIST => items::extern_item_list,
146 TOKEN_TREE if first_child? == T!['{'] => items::token_tree,
147 ASSOC_ITEM_LIST => match parent? {
148 IMPL | TRAIT => items::assoc_item_list,
151 ITEM_LIST => items::item_list,
157 #[derive(Clone, Copy, PartialEq, Eq)]
164 fn is_block(self) -> bool {
165 self == BlockLike::Block
169 fn opt_visibility(p: &mut Parser, in_tuple_field: bool) -> bool {
176 // test crate_visibility
177 // pub(crate) struct S;
178 // pub(self) struct S;
179 // pub(super) struct S;
181 // test pub_parens_typepath
182 // struct B(pub (super::A));
183 // struct B(pub (crate::A,));
184 T![crate] | T![self] | T![super] | T![ident] if p.nth(2) != T![:] => {
185 // If we are in a tuple struct, then the parens following `pub`
186 // might be an tuple field, not part of the visibility. So in that
187 // case we don't want to consume an identifier.
189 // test pub_tuple_field
190 // struct MyStruct(pub (u32, u32));
191 if !(in_tuple_field && matches!(p.nth(1), T![ident])) {
197 // test crate_visibility_in
198 // pub(in super::A) struct S;
199 // pub(in crate) struct S;
209 m.complete(p, VISIBILITY);
212 // test crate_keyword_vis
213 // crate fn main() { }
214 // struct S { crate field: u32 }
215 // struct T(crate u32);
217 if p.nth_at(1, T![::]) {
218 // test crate_keyword_path
219 // fn foo() { crate::foo(); }
224 m.complete(p, VISIBILITY);
231 fn opt_rename(p: &mut Parser) {
238 m.complete(p, RENAME);
242 fn abi(p: &mut Parser) {
243 assert!(p.at(T![extern]));
247 abi.complete(p, ABI);
250 fn opt_ret_type(p: &mut Parser) -> bool {
254 types::type_no_bounds(p);
255 m.complete(p, RET_TYPE);
262 fn name_r(p: &mut Parser, recovery: TokenSet) {
268 p.err_recover("expected a name", recovery);
272 fn name(p: &mut Parser) {
273 name_r(p, TokenSet::EMPTY);
276 fn name_ref(p: &mut Parser) {
280 m.complete(p, NAME_REF);
282 p.err_and_bump("expected identifier");
286 fn name_ref_or_index(p: &mut Parser) {
287 assert!(p.at(IDENT) || p.at(INT_NUMBER));
290 m.complete(p, NAME_REF);
293 fn lifetime(p: &mut Parser) {
294 assert!(p.at(LIFETIME_IDENT));
296 p.bump(LIFETIME_IDENT);
297 m.complete(p, LIFETIME);
300 fn error_block(p: &mut Parser, message: &str) {
301 assert!(p.at(T!['{']));
305 expressions::expr_block_contents(p);
307 m.complete(p, ERROR);