| ... | ... | @@ -17,15 +17,13 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 17 | 17 | defer stack.deinit(); |
| 18 | 18 | |
| 19 | 19 | const arena = &tree_arena.allocator; |
| 20 | | const root_node = try createNode(arena, ast.Node.Root, |
| 21 | | ast.Node.Root { |
| 22 | | .base = undefined, |
| 23 | | .decls = ast.Node.Root.DeclList.init(arena), |
| 24 | | .doc_comments = null, |
| 25 | | // initialized when we get the eof token |
| 26 | | .eof_token = undefined, |
| 27 | | } |
| 28 | | ); |
| 20 | const root_node = try arena.construct(ast.Node.Root { |
| 21 | .base = ast.Node { .id = ast.Node.Id.Root }, |
| 22 | .decls = ast.Node.Root.DeclList.init(arena), |
| 23 | .doc_comments = null, |
| 24 | // initialized when we get the eof token |
| 25 | .eof_token = undefined, |
| 26 | }); |
| 29 | 27 | |
| 30 | 28 | var tree = ast.Tree { |
| 31 | 29 | .source = source, |
| ... | ... | @@ -113,15 +111,13 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 113 | 111 | continue; |
| 114 | 112 | }, |
| 115 | 113 | Token.Id.Keyword_comptime => { |
| 116 | | const block = try createNode(arena, ast.Node.Block, |
| 117 | | ast.Node.Block { |
| 118 | | .base = undefined, |
| 119 | | .label = null, |
| 120 | | .lbrace = undefined, |
| 121 | | .statements = ast.Node.Block.StatementList.init(arena), |
| 122 | | .rbrace = undefined, |
| 123 | | } |
| 124 | | ); |
| 114 | const block = try arena.construct(ast.Node.Block { |
| 115 | .base = ast.Node {.id = ast.Node.Id.Block }, |
| 116 | .label = null, |
| 117 | .lbrace = undefined, |
| 118 | .statements = ast.Node.Block.StatementList.init(arena), |
| 119 | .rbrace = undefined, |
| 120 | }); |
| 125 | 121 | const node = try arena.construct(ast.Node.Comptime { |
| 126 | 122 | .base = ast.Node { |
| 127 | 123 | .id = ast.Node.Id.Comptime, |
| ... | ... | @@ -312,14 +308,12 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 312 | 308 | continue; |
| 313 | 309 | }, |
| 314 | 310 | Token.Id.Keyword_async => { |
| 315 | | const async_node = try createNode(arena, ast.Node.AsyncAttribute, |
| 316 | | ast.Node.AsyncAttribute { |
| 317 | | .base = undefined, |
| 318 | | .async_token = token_index, |
| 319 | | .allocator_type = null, |
| 320 | | .rangle_bracket = null, |
| 321 | | } |
| 322 | | ); |
| 311 | const async_node = try arena.construct(ast.Node.AsyncAttribute { |
| 312 | .base = ast.Node {.id = ast.Node.Id.AsyncAttribute }, |
| 313 | .async_token = token_index, |
| 314 | .allocator_type = null, |
| 315 | .rangle_bracket = null, |
| 316 | }); |
| 323 | 317 | fn_proto.async_attr = async_node; |
| 324 | 318 | |
| 325 | 319 | try stack.append(State { |
| ... | ... | @@ -396,27 +390,26 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 396 | 390 | const token = nextToken(&tok_it, &tree); |
| 397 | 391 | const token_index = token.index; |
| 398 | 392 | const token_ptr = token.ptr; |
| 399 | | const node = try createToCtxNode(arena, ctx.opt_ctx, ast.Node.ContainerDecl, |
| 400 | | ast.Node.ContainerDecl { |
| 401 | | .base = undefined, |
| 402 | | .ltoken = ctx.ltoken, |
| 403 | | .layout = ctx.layout, |
| 404 | | .kind = switch (token_ptr.id) { |
| 405 | | Token.Id.Keyword_struct => ast.Node.ContainerDecl.Kind.Struct, |
| 406 | | Token.Id.Keyword_union => ast.Node.ContainerDecl.Kind.Union, |
| 407 | | Token.Id.Keyword_enum => ast.Node.ContainerDecl.Kind.Enum, |
| 408 | | else => { |
| 409 | | *(try tree.errors.addOne()) = Error { |
| 410 | | .ExpectedAggregateKw = Error.ExpectedAggregateKw { .token = token_index }, |
| 411 | | }; |
| 412 | | return tree; |
| 413 | | }, |
| 393 | const node = try arena.construct(ast.Node.ContainerDecl { |
| 394 | .base = ast.Node {.id = ast.Node.Id.ContainerDecl }, |
| 395 | .ltoken = ctx.ltoken, |
| 396 | .layout = ctx.layout, |
| 397 | .kind = switch (token_ptr.id) { |
| 398 | Token.Id.Keyword_struct => ast.Node.ContainerDecl.Kind.Struct, |
| 399 | Token.Id.Keyword_union => ast.Node.ContainerDecl.Kind.Union, |
| 400 | Token.Id.Keyword_enum => ast.Node.ContainerDecl.Kind.Enum, |
| 401 | else => { |
| 402 | *(try tree.errors.addOne()) = Error { |
| 403 | .ExpectedAggregateKw = Error.ExpectedAggregateKw { .token = token_index }, |
| 404 | }; |
| 405 | return tree; |
| 414 | 406 | }, |
| 415 | | .init_arg_expr = ast.Node.ContainerDecl.InitArg.None, |
| 416 | | .fields_and_decls = ast.Node.ContainerDecl.DeclList.init(arena), |
| 417 | | .rbrace_token = undefined, |
| 418 | | } |
| 419 | | ); |
| 407 | }, |
| 408 | .init_arg_expr = ast.Node.ContainerDecl.InitArg.None, |
| 409 | .fields_and_decls = ast.Node.ContainerDecl.DeclList.init(arena), |
| 410 | .rbrace_token = undefined, |
| 411 | }); |
| 412 | ctx.opt_ctx.store(&node.base); |
| 420 | 413 | |
| 421 | 414 | stack.append(State { .ContainerDecl = node }) catch unreachable; |
| 422 | 415 | try stack.append(State { .ExpectToken = Token.Id.LBrace }); |
| ... | ... | @@ -844,15 +837,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 844 | 837 | const token_ptr = token.ptr; |
| 845 | 838 | switch (token_ptr.id) { |
| 846 | 839 | Token.Id.LBrace => { |
| 847 | | const block = try createToCtxNode(arena, ctx.opt_ctx, ast.Node.Block, |
| 848 | | ast.Node.Block { |
| 849 | | .base = undefined, |
| 850 | | .label = ctx.label, |
| 851 | | .lbrace = token_index, |
| 852 | | .statements = ast.Node.Block.StatementList.init(arena), |
| 853 | | .rbrace = undefined, |
| 854 | | } |
| 855 | | ); |
| 840 | const block = try arena.construct(ast.Node.Block { |
| 841 | .base = ast.Node {.id = ast.Node.Id.Block}, |
| 842 | .label = ctx.label, |
| 843 | .lbrace = token_index, |
| 844 | .statements = ast.Node.Block.StatementList.init(arena), |
| 845 | .rbrace = undefined, |
| 846 | }); |
| 847 | ctx.opt_ctx.store(&block.base); |
| 856 | 848 | stack.append(State { .Block = block }) catch unreachable; |
| 857 | 849 | continue; |
| 858 | 850 | }, |
| ... | ... | @@ -957,19 +949,18 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 957 | 949 | } |
| 958 | 950 | }, |
| 959 | 951 | State.While => |ctx| { |
| 960 | | const node = try createToCtxNode(arena, ctx.opt_ctx, ast.Node.While, |
| 961 | | ast.Node.While { |
| 962 | | .base = undefined, |
| 963 | | .label = ctx.label, |
| 964 | | .inline_token = ctx.inline_token, |
| 965 | | .while_token = ctx.loop_token, |
| 966 | | .condition = undefined, |
| 967 | | .payload = null, |
| 968 | | .continue_expr = null, |
| 969 | | .body = undefined, |
| 970 | | .@"else" = null, |
| 971 | | } |
| 972 | | ); |
| 952 | const node = try arena.construct(ast.Node.While { |
| 953 | .base = ast.Node {.id = ast.Node.Id.While }, |
| 954 | .label = ctx.label, |
| 955 | .inline_token = ctx.inline_token, |
| 956 | .while_token = ctx.loop_token, |
| 957 | .condition = undefined, |
| 958 | .payload = null, |
| 959 | .continue_expr = null, |
| 960 | .body = undefined, |
| 961 | .@"else" = null, |
| 962 | }); |
| 963 | ctx.opt_ctx.store(&node.base); |
| 973 | 964 | stack.append(State { .Else = &node.@"else" }) catch unreachable; |
| 974 | 965 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.body } }); |
| 975 | 966 | try stack.append(State { .WhileContinueExpr = &node.continue_expr }); |
| ... | ... | @@ -987,18 +978,17 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 987 | 978 | continue; |
| 988 | 979 | }, |
| 989 | 980 | State.For => |ctx| { |
| 990 | | const node = try createToCtxNode(arena, ctx.opt_ctx, ast.Node.For, |
| 991 | | ast.Node.For { |
| 992 | | .base = undefined, |
| 993 | | .label = ctx.label, |
| 994 | | .inline_token = ctx.inline_token, |
| 995 | | .for_token = ctx.loop_token, |
| 996 | | .array_expr = undefined, |
| 997 | | .payload = null, |
| 998 | | .body = undefined, |
| 999 | | .@"else" = null, |
| 1000 | | } |
| 1001 | | ); |
| 981 | const node = try arena.construct(ast.Node.For { |
| 982 | .base = ast.Node {.id = ast.Node.Id.For }, |
| 983 | .label = ctx.label, |
| 984 | .inline_token = ctx.inline_token, |
| 985 | .for_token = ctx.loop_token, |
| 986 | .array_expr = undefined, |
| 987 | .payload = null, |
| 988 | .body = undefined, |
| 989 | .@"else" = null, |
| 990 | }); |
| 991 | ctx.opt_ctx.store(&node.base); |
| 1002 | 992 | stack.append(State { .Else = &node.@"else" }) catch unreachable; |
| 1003 | 993 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.body } }); |
| 1004 | 994 | try stack.append(State { .PointerIndexPayload = OptionalCtx { .Optional = &node.payload } }); |
| ... | ... | @@ -1009,14 +999,12 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1009 | 999 | }, |
| 1010 | 1000 | State.Else => |dest| { |
| 1011 | 1001 | if (eatToken(&tok_it, &tree, Token.Id.Keyword_else)) |else_token| { |
| 1012 | | const node = try createNode(arena, ast.Node.Else, |
| 1013 | | ast.Node.Else { |
| 1014 | | .base = undefined, |
| 1015 | | .else_token = else_token, |
| 1016 | | .payload = null, |
| 1017 | | .body = undefined, |
| 1018 | | } |
| 1019 | | ); |
| 1002 | const node = try arena.construct(ast.Node.Else { |
| 1003 | .base = ast.Node {.id = ast.Node.Id.Else }, |
| 1004 | .else_token = else_token, |
| 1005 | .payload = null, |
| 1006 | .body = undefined, |
| 1007 | }); |
| 1020 | 1008 | *dest = node; |
| 1021 | 1009 | |
| 1022 | 1010 | stack.append(State { .Expression = OptionalCtx { .Required = &node.body } }) catch unreachable; |
| ... | ... | @@ -1170,14 +1158,12 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1170 | 1158 | continue; |
| 1171 | 1159 | } |
| 1172 | 1160 | |
| 1173 | | const node = try createNode(arena, ast.Node.AsmOutput, |
| 1174 | | ast.Node.AsmOutput { |
| 1175 | | .base = undefined, |
| 1176 | | .symbolic_name = undefined, |
| 1177 | | .constraint = undefined, |
| 1178 | | .kind = undefined, |
| 1179 | | } |
| 1180 | | ); |
| 1161 | const node = try arena.construct(ast.Node.AsmOutput { |
| 1162 | .base = ast.Node {.id = ast.Node.Id.AsmOutput }, |
| 1163 | .symbolic_name = undefined, |
| 1164 | .constraint = undefined, |
| 1165 | .kind = undefined, |
| 1166 | }); |
| 1181 | 1167 | try items.push(node); |
| 1182 | 1168 | |
| 1183 | 1169 | stack.append(State { .AsmOutputItems = items }) catch unreachable; |
| ... | ... | @@ -1223,14 +1209,12 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1223 | 1209 | continue; |
| 1224 | 1210 | } |
| 1225 | 1211 | |
| 1226 | | const node = try createNode(arena, ast.Node.AsmInput, |
| 1227 | | ast.Node.AsmInput { |
| 1228 | | .base = undefined, |
| 1229 | | .symbolic_name = undefined, |
| 1230 | | .constraint = undefined, |
| 1231 | | .expr = undefined, |
| 1232 | | } |
| 1233 | | ); |
| 1212 | const node = try arena.construct(ast.Node.AsmInput { |
| 1213 | .base = ast.Node {.id = ast.Node.Id.AsmInput }, |
| 1214 | .symbolic_name = undefined, |
| 1215 | .constraint = undefined, |
| 1216 | .expr = undefined, |
| 1217 | }); |
| 1234 | 1218 | try items.push(node); |
| 1235 | 1219 | |
| 1236 | 1220 | stack.append(State { .AsmInputItems = items }) catch unreachable; |
| ... | ... | @@ -1668,14 +1652,13 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1668 | 1652 | continue; |
| 1669 | 1653 | } |
| 1670 | 1654 | |
| 1671 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.Payload, |
| 1672 | | ast.Node.Payload { |
| 1673 | | .base = undefined, |
| 1674 | | .lpipe = token_index, |
| 1675 | | .error_symbol = undefined, |
| 1676 | | .rpipe = undefined |
| 1677 | | } |
| 1678 | | ); |
| 1655 | const node = try arena.construct(ast.Node.Payload { |
| 1656 | .base = ast.Node {.id = ast.Node.Id.Payload }, |
| 1657 | .lpipe = token_index, |
| 1658 | .error_symbol = undefined, |
| 1659 | .rpipe = undefined |
| 1660 | }); |
| 1661 | opt_ctx.store(&node.base); |
| 1679 | 1662 | |
| 1680 | 1663 | stack.append(State { |
| 1681 | 1664 | .ExpectTokenSave = ExpectTokenSave { |
| ... | ... | @@ -1705,15 +1688,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1705 | 1688 | continue; |
| 1706 | 1689 | } |
| 1707 | 1690 | |
| 1708 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.PointerPayload, |
| 1709 | | ast.Node.PointerPayload { |
| 1710 | | .base = undefined, |
| 1711 | | .lpipe = token_index, |
| 1712 | | .ptr_token = null, |
| 1713 | | .value_symbol = undefined, |
| 1714 | | .rpipe = undefined |
| 1715 | | } |
| 1716 | | ); |
| 1691 | const node = try arena.construct(ast.Node.PointerPayload { |
| 1692 | .base = ast.Node {.id = ast.Node.Id.PointerPayload }, |
| 1693 | .lpipe = token_index, |
| 1694 | .ptr_token = null, |
| 1695 | .value_symbol = undefined, |
| 1696 | .rpipe = undefined |
| 1697 | }); |
| 1698 | opt_ctx.store(&node.base); |
| 1717 | 1699 | |
| 1718 | 1700 | try stack.append(State { |
| 1719 | 1701 | .ExpectTokenSave = ExpectTokenSave { |
| ... | ... | @@ -1749,16 +1731,15 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1749 | 1731 | continue; |
| 1750 | 1732 | } |
| 1751 | 1733 | |
| 1752 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.PointerIndexPayload, |
| 1753 | | ast.Node.PointerIndexPayload { |
| 1754 | | .base = undefined, |
| 1755 | | .lpipe = token_index, |
| 1756 | | .ptr_token = null, |
| 1757 | | .value_symbol = undefined, |
| 1758 | | .index_symbol = null, |
| 1759 | | .rpipe = undefined |
| 1760 | | } |
| 1761 | | ); |
| 1734 | const node = try arena.construct(ast.Node.PointerIndexPayload { |
| 1735 | .base = ast.Node {.id = ast.Node.Id.PointerIndexPayload }, |
| 1736 | .lpipe = token_index, |
| 1737 | .ptr_token = null, |
| 1738 | .value_symbol = undefined, |
| 1739 | .index_symbol = null, |
| 1740 | .rpipe = undefined |
| 1741 | }); |
| 1742 | opt_ctx.store(&node.base); |
| 1762 | 1743 | |
| 1763 | 1744 | stack.append(State { |
| 1764 | 1745 | .ExpectTokenSave = ExpectTokenSave { |
| ... | ... | @@ -1785,14 +1766,13 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1785 | 1766 | const token_ptr = token.ptr; |
| 1786 | 1767 | switch (token_ptr.id) { |
| 1787 | 1768 | Token.Id.Keyword_return, Token.Id.Keyword_break, Token.Id.Keyword_continue => { |
| 1788 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.ControlFlowExpression, |
| 1789 | | ast.Node.ControlFlowExpression { |
| 1790 | | .base = undefined, |
| 1791 | | .ltoken = token_index, |
| 1792 | | .kind = undefined, |
| 1793 | | .rhs = null, |
| 1794 | | } |
| 1795 | | ); |
| 1769 | const node = try arena.construct(ast.Node.ControlFlowExpression { |
| 1770 | .base = ast.Node {.id = ast.Node.Id.ControlFlowExpression }, |
| 1771 | .ltoken = token_index, |
| 1772 | .kind = undefined, |
| 1773 | .rhs = null, |
| 1774 | }); |
| 1775 | opt_ctx.store(&node.base); |
| 1796 | 1776 | |
| 1797 | 1777 | stack.append(State { .Expression = OptionalCtx { .Optional = &node.rhs } }) catch unreachable; |
| 1798 | 1778 | |
| ... | ... | @@ -1815,19 +1795,18 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1815 | 1795 | continue; |
| 1816 | 1796 | }, |
| 1817 | 1797 | Token.Id.Keyword_try, Token.Id.Keyword_cancel, Token.Id.Keyword_resume => { |
| 1818 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.PrefixOp, |
| 1819 | | ast.Node.PrefixOp { |
| 1820 | | .base = undefined, |
| 1821 | | .op_token = token_index, |
| 1822 | | .op = switch (token_ptr.id) { |
| 1823 | | Token.Id.Keyword_try => ast.Node.PrefixOp.Op { .Try = void{} }, |
| 1824 | | Token.Id.Keyword_cancel => ast.Node.PrefixOp.Op { .Cancel = void{} }, |
| 1825 | | Token.Id.Keyword_resume => ast.Node.PrefixOp.Op { .Resume = void{} }, |
| 1826 | | else => unreachable, |
| 1827 | | }, |
| 1828 | | .rhs = undefined, |
| 1829 | | } |
| 1830 | | ); |
| 1798 | const node = try arena.construct(ast.Node.PrefixOp { |
| 1799 | .base = ast.Node {.id = ast.Node.Id.PrefixOp }, |
| 1800 | .op_token = token_index, |
| 1801 | .op = switch (token_ptr.id) { |
| 1802 | Token.Id.Keyword_try => ast.Node.PrefixOp.Op { .Try = void{} }, |
| 1803 | Token.Id.Keyword_cancel => ast.Node.PrefixOp.Op { .Cancel = void{} }, |
| 1804 | Token.Id.Keyword_resume => ast.Node.PrefixOp.Op { .Resume = void{} }, |
| 1805 | else => unreachable, |
| 1806 | }, |
| 1807 | .rhs = undefined, |
| 1808 | }); |
| 1809 | opt_ctx.store(&node.base); |
| 1831 | 1810 | |
| 1832 | 1811 | stack.append(State { .Expression = OptionalCtx { .Required = &node.rhs } }) catch unreachable; |
| 1833 | 1812 | continue; |
| ... | ... | @@ -1850,15 +1829,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1850 | 1829 | const lhs = opt_ctx.get() ?? continue; |
| 1851 | 1830 | |
| 1852 | 1831 | if (eatToken(&tok_it, &tree, Token.Id.Ellipsis3)) |ellipsis3| { |
| 1853 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 1854 | | ast.Node.InfixOp { |
| 1855 | | .base = undefined, |
| 1856 | | .lhs = lhs, |
| 1857 | | .op_token = ellipsis3, |
| 1858 | | .op = ast.Node.InfixOp.Op.Range, |
| 1859 | | .rhs = undefined, |
| 1860 | | } |
| 1861 | | ); |
| 1832 | const node = try arena.construct(ast.Node.InfixOp { |
| 1833 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1834 | .lhs = lhs, |
| 1835 | .op_token = ellipsis3, |
| 1836 | .op = ast.Node.InfixOp.Op.Range, |
| 1837 | .rhs = undefined, |
| 1838 | }); |
| 1839 | opt_ctx.store(&node.base); |
| 1862 | 1840 | stack.append(State { .Expression = OptionalCtx { .Required = &node.rhs } }) catch unreachable; |
| 1863 | 1841 | continue; |
| 1864 | 1842 | } |
| ... | ... | @@ -1876,15 +1854,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1876 | 1854 | const token_index = token.index; |
| 1877 | 1855 | const token_ptr = token.ptr; |
| 1878 | 1856 | if (tokenIdToAssignment(token_ptr.id)) |ass_id| { |
| 1879 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 1880 | | ast.Node.InfixOp { |
| 1881 | | .base = undefined, |
| 1882 | | .lhs = lhs, |
| 1883 | | .op_token = token_index, |
| 1884 | | .op = ass_id, |
| 1885 | | .rhs = undefined, |
| 1886 | | } |
| 1887 | | ); |
| 1857 | const node = try arena.construct(ast.Node.InfixOp { |
| 1858 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1859 | .lhs = lhs, |
| 1860 | .op_token = token_index, |
| 1861 | .op = ass_id, |
| 1862 | .rhs = undefined, |
| 1863 | }); |
| 1864 | opt_ctx.store(&node.base); |
| 1888 | 1865 | stack.append(State { .AssignmentExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 1889 | 1866 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.rhs } }); |
| 1890 | 1867 | continue; |
| ... | ... | @@ -1907,15 +1884,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1907 | 1884 | const token_index = token.index; |
| 1908 | 1885 | const token_ptr = token.ptr; |
| 1909 | 1886 | if (tokenIdToUnwrapExpr(token_ptr.id)) |unwrap_id| { |
| 1910 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 1911 | | ast.Node.InfixOp { |
| 1912 | | .base = undefined, |
| 1913 | | .lhs = lhs, |
| 1914 | | .op_token = token_index, |
| 1915 | | .op = unwrap_id, |
| 1916 | | .rhs = undefined, |
| 1917 | | } |
| 1918 | | ); |
| 1887 | const node = try arena.construct(ast.Node.InfixOp { |
| 1888 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1889 | .lhs = lhs, |
| 1890 | .op_token = token_index, |
| 1891 | .op = unwrap_id, |
| 1892 | .rhs = undefined, |
| 1893 | }); |
| 1894 | opt_ctx.store(&node.base); |
| 1919 | 1895 | |
| 1920 | 1896 | stack.append(State { .UnwrapExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 1921 | 1897 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.rhs } }); |
| ... | ... | @@ -1940,15 +1916,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1940 | 1916 | const lhs = opt_ctx.get() ?? continue; |
| 1941 | 1917 | |
| 1942 | 1918 | if (eatToken(&tok_it, &tree, Token.Id.Keyword_or)) |or_token| { |
| 1943 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 1944 | | ast.Node.InfixOp { |
| 1945 | | .base = undefined, |
| 1946 | | .lhs = lhs, |
| 1947 | | .op_token = or_token, |
| 1948 | | .op = ast.Node.InfixOp.Op.BoolOr, |
| 1949 | | .rhs = undefined, |
| 1950 | | } |
| 1951 | | ); |
| 1919 | const node = try arena.construct(ast.Node.InfixOp { |
| 1920 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1921 | .lhs = lhs, |
| 1922 | .op_token = or_token, |
| 1923 | .op = ast.Node.InfixOp.Op.BoolOr, |
| 1924 | .rhs = undefined, |
| 1925 | }); |
| 1926 | opt_ctx.store(&node.base); |
| 1952 | 1927 | stack.append(State { .BoolOrExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 1953 | 1928 | try stack.append(State { .BoolAndExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 1954 | 1929 | continue; |
| ... | ... | @@ -1965,15 +1940,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1965 | 1940 | const lhs = opt_ctx.get() ?? continue; |
| 1966 | 1941 | |
| 1967 | 1942 | if (eatToken(&tok_it, &tree, Token.Id.Keyword_and)) |and_token| { |
| 1968 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 1969 | | ast.Node.InfixOp { |
| 1970 | | .base = undefined, |
| 1971 | | .lhs = lhs, |
| 1972 | | .op_token = and_token, |
| 1973 | | .op = ast.Node.InfixOp.Op.BoolAnd, |
| 1974 | | .rhs = undefined, |
| 1975 | | } |
| 1976 | | ); |
| 1943 | const node = try arena.construct(ast.Node.InfixOp { |
| 1944 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1945 | .lhs = lhs, |
| 1946 | .op_token = and_token, |
| 1947 | .op = ast.Node.InfixOp.Op.BoolAnd, |
| 1948 | .rhs = undefined, |
| 1949 | }); |
| 1950 | opt_ctx.store(&node.base); |
| 1977 | 1951 | stack.append(State { .BoolAndExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 1978 | 1952 | try stack.append(State { .ComparisonExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 1979 | 1953 | continue; |
| ... | ... | @@ -1993,15 +1967,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 1993 | 1967 | const token_index = token.index; |
| 1994 | 1968 | const token_ptr = token.ptr; |
| 1995 | 1969 | if (tokenIdToComparison(token_ptr.id)) |comp_id| { |
| 1996 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 1997 | | ast.Node.InfixOp { |
| 1998 | | .base = undefined, |
| 1999 | | .lhs = lhs, |
| 2000 | | .op_token = token_index, |
| 2001 | | .op = comp_id, |
| 2002 | | .rhs = undefined, |
| 2003 | | } |
| 2004 | | ); |
| 1970 | const node = try arena.construct(ast.Node.InfixOp { |
| 1971 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1972 | .lhs = lhs, |
| 1973 | .op_token = token_index, |
| 1974 | .op = comp_id, |
| 1975 | .rhs = undefined, |
| 1976 | }); |
| 1977 | opt_ctx.store(&node.base); |
| 2005 | 1978 | stack.append(State { .ComparisonExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2006 | 1979 | try stack.append(State { .BinaryOrExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2007 | 1980 | continue; |
| ... | ... | @@ -2021,15 +1994,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2021 | 1994 | const lhs = opt_ctx.get() ?? continue; |
| 2022 | 1995 | |
| 2023 | 1996 | if (eatToken(&tok_it, &tree, Token.Id.Pipe)) |pipe| { |
| 2024 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2025 | | ast.Node.InfixOp { |
| 2026 | | .base = undefined, |
| 2027 | | .lhs = lhs, |
| 2028 | | .op_token = pipe, |
| 2029 | | .op = ast.Node.InfixOp.Op.BitOr, |
| 2030 | | .rhs = undefined, |
| 2031 | | } |
| 2032 | | ); |
| 1997 | const node = try arena.construct(ast.Node.InfixOp { |
| 1998 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 1999 | .lhs = lhs, |
| 2000 | .op_token = pipe, |
| 2001 | .op = ast.Node.InfixOp.Op.BitOr, |
| 2002 | .rhs = undefined, |
| 2003 | }); |
| 2004 | opt_ctx.store(&node.base); |
| 2033 | 2005 | stack.append(State { .BinaryOrExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2034 | 2006 | try stack.append(State { .BinaryXorExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2035 | 2007 | continue; |
| ... | ... | @@ -2046,15 +2018,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2046 | 2018 | const lhs = opt_ctx.get() ?? continue; |
| 2047 | 2019 | |
| 2048 | 2020 | if (eatToken(&tok_it, &tree, Token.Id.Caret)) |caret| { |
| 2049 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2050 | | ast.Node.InfixOp { |
| 2051 | | .base = undefined, |
| 2052 | | .lhs = lhs, |
| 2053 | | .op_token = caret, |
| 2054 | | .op = ast.Node.InfixOp.Op.BitXor, |
| 2055 | | .rhs = undefined, |
| 2056 | | } |
| 2057 | | ); |
| 2021 | const node = try arena.construct(ast.Node.InfixOp { |
| 2022 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2023 | .lhs = lhs, |
| 2024 | .op_token = caret, |
| 2025 | .op = ast.Node.InfixOp.Op.BitXor, |
| 2026 | .rhs = undefined, |
| 2027 | }); |
| 2028 | opt_ctx.store(&node.base); |
| 2058 | 2029 | stack.append(State { .BinaryXorExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2059 | 2030 | try stack.append(State { .BinaryAndExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2060 | 2031 | continue; |
| ... | ... | @@ -2071,15 +2042,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2071 | 2042 | const lhs = opt_ctx.get() ?? continue; |
| 2072 | 2043 | |
| 2073 | 2044 | if (eatToken(&tok_it, &tree, Token.Id.Ampersand)) |ampersand| { |
| 2074 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2075 | | ast.Node.InfixOp { |
| 2076 | | .base = undefined, |
| 2077 | | .lhs = lhs, |
| 2078 | | .op_token = ampersand, |
| 2079 | | .op = ast.Node.InfixOp.Op.BitAnd, |
| 2080 | | .rhs = undefined, |
| 2081 | | } |
| 2082 | | ); |
| 2045 | const node = try arena.construct(ast.Node.InfixOp { |
| 2046 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2047 | .lhs = lhs, |
| 2048 | .op_token = ampersand, |
| 2049 | .op = ast.Node.InfixOp.Op.BitAnd, |
| 2050 | .rhs = undefined, |
| 2051 | }); |
| 2052 | opt_ctx.store(&node.base); |
| 2083 | 2053 | stack.append(State { .BinaryAndExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2084 | 2054 | try stack.append(State { .BitShiftExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2085 | 2055 | continue; |
| ... | ... | @@ -2099,15 +2069,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2099 | 2069 | const token_index = token.index; |
| 2100 | 2070 | const token_ptr = token.ptr; |
| 2101 | 2071 | if (tokenIdToBitShift(token_ptr.id)) |bitshift_id| { |
| 2102 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2103 | | ast.Node.InfixOp { |
| 2104 | | .base = undefined, |
| 2105 | | .lhs = lhs, |
| 2106 | | .op_token = token_index, |
| 2107 | | .op = bitshift_id, |
| 2108 | | .rhs = undefined, |
| 2109 | | } |
| 2110 | | ); |
| 2072 | const node = try arena.construct(ast.Node.InfixOp { |
| 2073 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2074 | .lhs = lhs, |
| 2075 | .op_token = token_index, |
| 2076 | .op = bitshift_id, |
| 2077 | .rhs = undefined, |
| 2078 | }); |
| 2079 | opt_ctx.store(&node.base); |
| 2111 | 2080 | stack.append(State { .BitShiftExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2112 | 2081 | try stack.append(State { .AdditionExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2113 | 2082 | continue; |
| ... | ... | @@ -2130,15 +2099,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2130 | 2099 | const token_index = token.index; |
| 2131 | 2100 | const token_ptr = token.ptr; |
| 2132 | 2101 | if (tokenIdToAddition(token_ptr.id)) |add_id| { |
| 2133 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2134 | | ast.Node.InfixOp { |
| 2135 | | .base = undefined, |
| 2136 | | .lhs = lhs, |
| 2137 | | .op_token = token_index, |
| 2138 | | .op = add_id, |
| 2139 | | .rhs = undefined, |
| 2140 | | } |
| 2141 | | ); |
| 2102 | const node = try arena.construct(ast.Node.InfixOp { |
| 2103 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2104 | .lhs = lhs, |
| 2105 | .op_token = token_index, |
| 2106 | .op = add_id, |
| 2107 | .rhs = undefined, |
| 2108 | }); |
| 2109 | opt_ctx.store(&node.base); |
| 2142 | 2110 | stack.append(State { .AdditionExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2143 | 2111 | try stack.append(State { .MultiplyExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2144 | 2112 | continue; |
| ... | ... | @@ -2161,15 +2129,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2161 | 2129 | const token_index = token.index; |
| 2162 | 2130 | const token_ptr = token.ptr; |
| 2163 | 2131 | if (tokenIdToMultiply(token_ptr.id)) |mult_id| { |
| 2164 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2165 | | ast.Node.InfixOp { |
| 2166 | | .base = undefined, |
| 2167 | | .lhs = lhs, |
| 2168 | | .op_token = token_index, |
| 2169 | | .op = mult_id, |
| 2170 | | .rhs = undefined, |
| 2171 | | } |
| 2172 | | ); |
| 2132 | const node = try arena.construct(ast.Node.InfixOp { |
| 2133 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2134 | .lhs = lhs, |
| 2135 | .op_token = token_index, |
| 2136 | .op = mult_id, |
| 2137 | .rhs = undefined, |
| 2138 | }); |
| 2139 | opt_ctx.store(&node.base); |
| 2173 | 2140 | stack.append(State { .MultiplyExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2174 | 2141 | try stack.append(State { .CurlySuffixExpressionBegin = OptionalCtx { .Required = &node.rhs } }); |
| 2175 | 2142 | continue; |
| ... | ... | @@ -2211,16 +2178,15 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2211 | 2178 | continue; |
| 2212 | 2179 | } |
| 2213 | 2180 | |
| 2214 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.SuffixOp, |
| 2215 | | ast.Node.SuffixOp { |
| 2216 | | .base = undefined, |
| 2217 | | .lhs = lhs, |
| 2218 | | .op = ast.Node.SuffixOp.Op { |
| 2219 | | .ArrayInitializer = ast.Node.SuffixOp.Op.InitList.init(arena), |
| 2220 | | }, |
| 2221 | | .rtoken = undefined, |
| 2222 | | } |
| 2223 | | ); |
| 2181 | const node = try arena.construct(ast.Node.SuffixOp { |
| 2182 | .base = ast.Node {.id = ast.Node.Id.SuffixOp }, |
| 2183 | .lhs = lhs, |
| 2184 | .op = ast.Node.SuffixOp.Op { |
| 2185 | .ArrayInitializer = ast.Node.SuffixOp.Op.InitList.init(arena), |
| 2186 | }, |
| 2187 | .rtoken = undefined, |
| 2188 | }); |
| 2189 | opt_ctx.store(&node.base); |
| 2224 | 2190 | stack.append(State { .CurlySuffixExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2225 | 2191 | try stack.append(State { .IfToken = Token.Id.LBrace }); |
| 2226 | 2192 | try stack.append(State { |
| ... | ... | @@ -2243,15 +2209,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2243 | 2209 | const lhs = opt_ctx.get() ?? continue; |
| 2244 | 2210 | |
| 2245 | 2211 | if (eatToken(&tok_it, &tree, Token.Id.Bang)) |bang| { |
| 2246 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2247 | | ast.Node.InfixOp { |
| 2248 | | .base = undefined, |
| 2249 | | .lhs = lhs, |
| 2250 | | .op_token = bang, |
| 2251 | | .op = ast.Node.InfixOp.Op.ErrorUnion, |
| 2252 | | .rhs = undefined, |
| 2253 | | } |
| 2254 | | ); |
| 2212 | const node = try arena.construct(ast.Node.InfixOp { |
| 2213 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2214 | .lhs = lhs, |
| 2215 | .op_token = bang, |
| 2216 | .op = ast.Node.InfixOp.Op.ErrorUnion, |
| 2217 | .rhs = undefined, |
| 2218 | }); |
| 2219 | opt_ctx.store(&node.base); |
| 2255 | 2220 | stack.append(State { .TypeExprEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2256 | 2221 | try stack.append(State { .PrefixOpExpression = OptionalCtx { .Required = &node.rhs } }); |
| 2257 | 2222 | continue; |
| ... | ... | @@ -2263,25 +2228,22 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2263 | 2228 | const token_index = token.index; |
| 2264 | 2229 | const token_ptr = token.ptr; |
| 2265 | 2230 | if (tokenIdToPrefixOp(token_ptr.id)) |prefix_id| { |
| 2266 | | var node = try createToCtxNode(arena, opt_ctx, ast.Node.PrefixOp, |
| 2267 | | ast.Node.PrefixOp { |
| 2268 | | .base = undefined, |
| 2269 | | .op_token = token_index, |
| 2270 | | .op = prefix_id, |
| 2271 | | .rhs = undefined, |
| 2272 | | } |
| 2273 | | ); |
| 2231 | var node = try arena.construct(ast.Node.PrefixOp { |
| 2232 | .base = ast.Node {.id = ast.Node.Id.PrefixOp }, |
| 2233 | .op_token = token_index, |
| 2234 | .op = prefix_id, |
| 2235 | .rhs = undefined, |
| 2236 | }); |
| 2237 | opt_ctx.store(&node.base); |
| 2274 | 2238 | |
| 2275 | 2239 | // Treat '**' token as two derefs |
| 2276 | 2240 | if (token_ptr.id == Token.Id.AsteriskAsterisk) { |
| 2277 | | const child = try createNode(arena, ast.Node.PrefixOp, |
| 2278 | | ast.Node.PrefixOp { |
| 2279 | | .base = undefined, |
| 2280 | | .op_token = token_index, |
| 2281 | | .op = prefix_id, |
| 2282 | | .rhs = undefined, |
| 2283 | | } |
| 2284 | | ); |
| 2241 | const child = try arena.construct(ast.Node.PrefixOp { |
| 2242 | .base = ast.Node {.id = ast.Node.Id.PrefixOp}, |
| 2243 | .op_token = token_index, |
| 2244 | .op = prefix_id, |
| 2245 | .rhs = undefined, |
| 2246 | }); |
| 2285 | 2247 | node.rhs = &child.base; |
| 2286 | 2248 | node = child; |
| 2287 | 2249 | } |
| ... | ... | @@ -2300,14 +2262,12 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2300 | 2262 | |
| 2301 | 2263 | State.SuffixOpExpressionBegin => |opt_ctx| { |
| 2302 | 2264 | if (eatToken(&tok_it, &tree, Token.Id.Keyword_async)) |async_token| { |
| 2303 | | const async_node = try createNode(arena, ast.Node.AsyncAttribute, |
| 2304 | | ast.Node.AsyncAttribute { |
| 2305 | | .base = undefined, |
| 2306 | | .async_token = async_token, |
| 2307 | | .allocator_type = null, |
| 2308 | | .rangle_bracket = null, |
| 2309 | | } |
| 2310 | | ); |
| 2265 | const async_node = try arena.construct(ast.Node.AsyncAttribute { |
| 2266 | .base = ast.Node {.id = ast.Node.Id.AsyncAttribute}, |
| 2267 | .async_token = async_token, |
| 2268 | .allocator_type = null, |
| 2269 | .rangle_bracket = null, |
| 2270 | }); |
| 2311 | 2271 | stack.append(State { |
| 2312 | 2272 | .AsyncEnd = AsyncEndCtx { |
| 2313 | 2273 | .ctx = opt_ctx, |
| ... | ... | @@ -2333,19 +2293,19 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2333 | 2293 | const token_ptr = token.ptr; |
| 2334 | 2294 | switch (token_ptr.id) { |
| 2335 | 2295 | Token.Id.LParen => { |
| 2336 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.SuffixOp, |
| 2337 | | ast.Node.SuffixOp { |
| 2338 | | .base = undefined, |
| 2339 | | .lhs = lhs, |
| 2340 | | .op = ast.Node.SuffixOp.Op { |
| 2341 | | .Call = ast.Node.SuffixOp.Op.Call { |
| 2342 | | .params = ast.Node.SuffixOp.Op.Call.ParamList.init(arena), |
| 2343 | | .async_attr = null, |
| 2344 | | } |
| 2345 | | }, |
| 2346 | | .rtoken = undefined, |
| 2347 | | } |
| 2348 | | ); |
| 2296 | const node = try arena.construct(ast.Node.SuffixOp { |
| 2297 | .base = ast.Node {.id = ast.Node.Id.SuffixOp }, |
| 2298 | .lhs = lhs, |
| 2299 | .op = ast.Node.SuffixOp.Op { |
| 2300 | .Call = ast.Node.SuffixOp.Op.Call { |
| 2301 | .params = ast.Node.SuffixOp.Op.Call.ParamList.init(arena), |
| 2302 | .async_attr = null, |
| 2303 | } |
| 2304 | }, |
| 2305 | .rtoken = undefined, |
| 2306 | }); |
| 2307 | opt_ctx.store(&node.base); |
| 2308 | |
| 2349 | 2309 | stack.append(State { .SuffixOpExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2350 | 2310 | try stack.append(State { |
| 2351 | 2311 | .ExprListItemOrEnd = ExprListCtx { |
| ... | ... | @@ -2357,31 +2317,31 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2357 | 2317 | continue; |
| 2358 | 2318 | }, |
| 2359 | 2319 | Token.Id.LBracket => { |
| 2360 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.SuffixOp, |
| 2361 | | ast.Node.SuffixOp { |
| 2362 | | .base = undefined, |
| 2363 | | .lhs = lhs, |
| 2364 | | .op = ast.Node.SuffixOp.Op { |
| 2365 | | .ArrayAccess = undefined, |
| 2366 | | }, |
| 2367 | | .rtoken = undefined |
| 2368 | | } |
| 2369 | | ); |
| 2320 | const node = try arena.construct(ast.Node.SuffixOp { |
| 2321 | .base = ast.Node {.id = ast.Node.Id.SuffixOp }, |
| 2322 | .lhs = lhs, |
| 2323 | .op = ast.Node.SuffixOp.Op { |
| 2324 | .ArrayAccess = undefined, |
| 2325 | }, |
| 2326 | .rtoken = undefined |
| 2327 | }); |
| 2328 | opt_ctx.store(&node.base); |
| 2329 | |
| 2370 | 2330 | stack.append(State { .SuffixOpExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2371 | 2331 | try stack.append(State { .SliceOrArrayAccess = node }); |
| 2372 | 2332 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.op.ArrayAccess }}); |
| 2373 | 2333 | continue; |
| 2374 | 2334 | }, |
| 2375 | 2335 | Token.Id.Period => { |
| 2376 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.InfixOp, |
| 2377 | | ast.Node.InfixOp { |
| 2378 | | .base = undefined, |
| 2379 | | .lhs = lhs, |
| 2380 | | .op_token = token_index, |
| 2381 | | .op = ast.Node.InfixOp.Op.Period, |
| 2382 | | .rhs = undefined, |
| 2383 | | } |
| 2384 | | ); |
| 2336 | const node = try arena.construct(ast.Node.InfixOp { |
| 2337 | .base = ast.Node {.id = ast.Node.Id.InfixOp }, |
| 2338 | .lhs = lhs, |
| 2339 | .op_token = token_index, |
| 2340 | .op = ast.Node.InfixOp.Op.Period, |
| 2341 | .rhs = undefined, |
| 2342 | }); |
| 2343 | opt_ctx.store(&node.base); |
| 2344 | |
| 2385 | 2345 | stack.append(State { .SuffixOpExpressionEnd = opt_ctx.toRequired() }) catch unreachable; |
| 2386 | 2346 | try stack.append(State { .Identifier = OptionalCtx { .Required = &node.rhs } }); |
| 2387 | 2347 | continue; |
| ... | ... | @@ -2461,14 +2421,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2461 | 2421 | continue; |
| 2462 | 2422 | }, |
| 2463 | 2423 | Token.Id.LParen => { |
| 2464 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.GroupedExpression, |
| 2465 | | ast.Node.GroupedExpression { |
| 2466 | | .base = undefined, |
| 2467 | | .lparen = token.index, |
| 2468 | | .expr = undefined, |
| 2469 | | .rparen = undefined, |
| 2470 | | } |
| 2471 | | ); |
| 2424 | const node = try arena.construct(ast.Node.GroupedExpression { |
| 2425 | .base = ast.Node {.id = ast.Node.Id.GroupedExpression }, |
| 2426 | .lparen = token.index, |
| 2427 | .expr = undefined, |
| 2428 | .rparen = undefined, |
| 2429 | }); |
| 2430 | opt_ctx.store(&node.base); |
| 2431 | |
| 2472 | 2432 | stack.append(State { |
| 2473 | 2433 | .ExpectTokenSave = ExpectTokenSave { |
| 2474 | 2434 | .id = Token.Id.RParen, |
| ... | ... | @@ -2479,14 +2439,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2479 | 2439 | continue; |
| 2480 | 2440 | }, |
| 2481 | 2441 | Token.Id.Builtin => { |
| 2482 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.BuiltinCall, |
| 2483 | | ast.Node.BuiltinCall { |
| 2484 | | .base = undefined, |
| 2485 | | .builtin_token = token.index, |
| 2486 | | .params = ast.Node.BuiltinCall.ParamList.init(arena), |
| 2487 | | .rparen_token = undefined, |
| 2488 | | } |
| 2489 | | ); |
| 2442 | const node = try arena.construct(ast.Node.BuiltinCall { |
| 2443 | .base = ast.Node {.id = ast.Node.Id.BuiltinCall }, |
| 2444 | .builtin_token = token.index, |
| 2445 | .params = ast.Node.BuiltinCall.ParamList.init(arena), |
| 2446 | .rparen_token = undefined, |
| 2447 | }); |
| 2448 | opt_ctx.store(&node.base); |
| 2449 | |
| 2490 | 2450 | stack.append(State { |
| 2491 | 2451 | .ExprListItemOrEnd = ExprListCtx { |
| 2492 | 2452 | .list = &node.params, |
| ... | ... | @@ -2498,14 +2458,14 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2498 | 2458 | continue; |
| 2499 | 2459 | }, |
| 2500 | 2460 | Token.Id.LBracket => { |
| 2501 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.PrefixOp, |
| 2502 | | ast.Node.PrefixOp { |
| 2503 | | .base = undefined, |
| 2504 | | .op_token = token.index, |
| 2505 | | .op = undefined, |
| 2506 | | .rhs = undefined, |
| 2507 | | } |
| 2508 | | ); |
| 2461 | const node = try arena.construct(ast.Node.PrefixOp { |
| 2462 | .base = ast.Node {.id = ast.Node.Id.PrefixOp }, |
| 2463 | .op_token = token.index, |
| 2464 | .op = undefined, |
| 2465 | .rhs = undefined, |
| 2466 | }); |
| 2467 | opt_ctx.store(&node.base); |
| 2468 | |
| 2509 | 2469 | stack.append(State { .SliceOrArrayType = node }) catch unreachable; |
| 2510 | 2470 | continue; |
| 2511 | 2471 | }, |
| ... | ... | @@ -2611,18 +2571,18 @@ pub fn parse(allocator: &mem.Allocator, source: []const u8) !ast.Tree { |
| 2611 | 2571 | continue; |
| 2612 | 2572 | }, |
| 2613 | 2573 | Token.Id.Keyword_asm => { |
| 2614 | | const node = try createToCtxNode(arena, opt_ctx, ast.Node.Asm, |
| 2615 | | ast.Node.Asm { |
| 2616 | | .base = undefined, |
| 2617 | | .asm_token = token.index, |
| 2618 | | .volatile_token = null, |
| 2619 | | .template = undefined, |
| 2620 | | .outputs = ast.Node.Asm.OutputList.init(arena), |
| 2621 | | .inputs = ast.Node.Asm.InputList.init(arena), |
| 2622 | | .clobbers = ast.Node.Asm.ClobberList.init(arena), |
| 2623 | | .rparen = undefined, |
| 2624 | | } |
| 2625 | | ); |
| 2574 | const node = try arena.construct(ast.Node.Asm { |
| 2575 | .base = ast.Node {.id = ast.Node.Id.Asm }, |
| 2576 | .asm_token = token.index, |
| 2577 | .volatile_token = null, |
| 2578 | .template = undefined, |
| 2579 | .outputs = ast.Node.Asm.OutputList.init(arena), |
| 2580 | .inputs = ast.Node.Asm.InputList.init(arena), |
| 2581 | .clobbers = ast.Node.Asm.ClobberList.init(arena), |
| 2582 | .rparen = undefined, |
| 2583 | }); |
| 2584 | opt_ctx.store(&node.base); |
| 2585 | |
| 2626 | 2586 | stack.append(State { |
| 2627 | 2587 | .ExpectTokenSave = ExpectTokenSave { |
| 2628 | 2588 | .id = Token.Id.RParen, |
| ... | ... | @@ -3155,31 +3115,29 @@ fn parseBlockExpr(stack: &std.ArrayList(State), arena: &mem.Allocator, ctx: &con |
| 3155 | 3115 | token_ptr: &const Token, token_index: TokenIndex) !bool { |
| 3156 | 3116 | switch (token_ptr.id) { |
| 3157 | 3117 | Token.Id.Keyword_suspend => { |
| 3158 | | const node = try createToCtxNode(arena, ctx, ast.Node.Suspend, |
| 3159 | | ast.Node.Suspend { |
| 3160 | | .base = undefined, |
| 3161 | | .label = null, |
| 3162 | | .suspend_token = token_index, |
| 3163 | | .payload = null, |
| 3164 | | .body = null, |
| 3165 | | } |
| 3166 | | ); |
| 3118 | const node = try arena.construct(ast.Node.Suspend { |
| 3119 | .base = ast.Node {.id = ast.Node.Id.Suspend }, |
| 3120 | .label = null, |
| 3121 | .suspend_token = token_index, |
| 3122 | .payload = null, |
| 3123 | .body = null, |
| 3124 | }); |
| 3125 | ctx.store(&node.base); |
| 3167 | 3126 | |
| 3168 | 3127 | stack.append(State { .SuspendBody = node }) catch unreachable; |
| 3169 | 3128 | try stack.append(State { .Payload = OptionalCtx { .Optional = &node.payload } }); |
| 3170 | 3129 | return true; |
| 3171 | 3130 | }, |
| 3172 | 3131 | Token.Id.Keyword_if => { |
| 3173 | | const node = try createToCtxNode(arena, ctx, ast.Node.If, |
| 3174 | | ast.Node.If { |
| 3175 | | .base = undefined, |
| 3176 | | .if_token = token_index, |
| 3177 | | .condition = undefined, |
| 3178 | | .payload = null, |
| 3179 | | .body = undefined, |
| 3180 | | .@"else" = null, |
| 3181 | | } |
| 3182 | | ); |
| 3132 | const node = try arena.construct(ast.Node.If { |
| 3133 | .base = ast.Node {.id = ast.Node.Id.If }, |
| 3134 | .if_token = token_index, |
| 3135 | .condition = undefined, |
| 3136 | .payload = null, |
| 3137 | .body = undefined, |
| 3138 | .@"else" = null, |
| 3139 | }); |
| 3140 | ctx.store(&node.base); |
| 3183 | 3141 | |
| 3184 | 3142 | stack.append(State { .Else = &node.@"else" }) catch unreachable; |
| 3185 | 3143 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.body } }); |
| ... | ... | @@ -3236,14 +3194,14 @@ fn parseBlockExpr(stack: &std.ArrayList(State), arena: &mem.Allocator, ctx: &con |
| 3236 | 3194 | return true; |
| 3237 | 3195 | }, |
| 3238 | 3196 | Token.Id.Keyword_comptime => { |
| 3239 | | const node = try createToCtxNode(arena, ctx, ast.Node.Comptime, |
| 3240 | | ast.Node.Comptime { |
| 3241 | | .base = undefined, |
| 3242 | | .comptime_token = token_index, |
| 3243 | | .expr = undefined, |
| 3244 | | .doc_comments = null, |
| 3245 | | } |
| 3246 | | ); |
| 3197 | const node = try arena.construct(ast.Node.Comptime { |
| 3198 | .base = ast.Node {.id = ast.Node.Id.Comptime }, |
| 3199 | .comptime_token = token_index, |
| 3200 | .expr = undefined, |
| 3201 | .doc_comments = null, |
| 3202 | }); |
| 3203 | ctx.store(&node.base); |
| 3204 | |
| 3247 | 3205 | try stack.append(State { .Expression = OptionalCtx { .Required = &node.expr } }); |
| 3248 | 3206 | return true; |
| 3249 | 3207 | }, |
| ... | ... | @@ -3390,33 +3348,11 @@ fn tokenIdToPrefixOp(id: @TagType(Token.Id)) ?ast.Node.PrefixOp.Op { |
| 3390 | 3348 | }; |
| 3391 | 3349 | } |
| 3392 | 3350 | |
| 3393 | | fn createNode(arena: &mem.Allocator, comptime T: type, init_to: &const T) !&T { |
| 3394 | | const node = try arena.create(T); |
| 3395 | | *node = *init_to; |
| 3396 | | node.base = blk: { |
| 3397 | | const id = ast.Node.typeToId(T); |
| 3398 | | break :blk ast.Node { |
| 3399 | | .id = id, |
| 3400 | | }; |
| 3401 | | }; |
| 3402 | | |
| 3403 | | return node; |
| 3404 | | } |
| 3405 | | |
| 3406 | | fn createToCtxNode(arena: &mem.Allocator, opt_ctx: &const OptionalCtx, comptime T: type, init_to: &const T) !&T { |
| 3407 | | const node = try createNode(arena, T, init_to); |
| 3408 | | opt_ctx.store(&node.base); |
| 3409 | | |
| 3410 | | return node; |
| 3411 | | } |
| 3412 | | |
| 3413 | 3351 | fn createLiteral(arena: &mem.Allocator, comptime T: type, token_index: TokenIndex) !&T { |
| 3414 | | return createNode(arena, T, |
| 3415 | | T { |
| 3416 | | .base = undefined, |
| 3417 | | .token = token_index, |
| 3418 | | } |
| 3419 | | ); |
| 3352 | return arena.construct(T { |
| 3353 | .base = ast.Node {.id = ast.Node.typeToId(T)}, |
| 3354 | .token = token_index, |
| 3355 | }); |
| 3420 | 3356 | } |
| 3421 | 3357 | |
| 3422 | 3358 | fn createToCtxLiteral(arena: &mem.Allocator, opt_ctx: &const OptionalCtx, comptime T: type, token_index: TokenIndex) !&T { |