Merge #998

998: Parse macro expansion properly r=CohenArthur a=CohenArthur

This PR adds a base for trying to parse statements or items in macro invocations. We are now able to parse multiple items / expressions / statements properly, but do not lower them properly, which is the last remaining task in #943 

New macro parsing logic:
```mermaid
flowchart TD;
    has_semi -- Yes --> stmt;
    has_semi -- No --> invocation;
    invocation -- Is Parens --> expr;
    invocation -- Is Square --> expr;
    invocation -- Is Curly --> stmt;
```

Closes #943 
Closes #959 
Closes #952 

Co-authored-by: Arthur Cohen <arthur.cohen@embecosm.com>

1 files changed, 0 insertions, 8 deletions

diff --git a/gcc/rust/resolve/rust-ast-resolve-expr.cc b/gcc/rust/resolve/rust-ast-resolve-expr.cc
index 19f8169..e551802 100644
--- a/gcc/rust/resolve/rust-ast-resolve-expr.cc
+++ b/gcc/rust/resolve/rust-ast-resolve-expr.cc
@@ -35,14 +35,6 @@ ResolveExpr::go (AST::Expr *expr, NodeId parent, const CanonicalPath &prefix,
 }
 
 void
-ResolveExpr::visit (AST::MacroInvocation &expr)
-{
-  AST::ASTFragment &fragment = expr.get_fragment ();
-  for (auto &node : fragment.get_nodes ())
-    node.accept_vis (*this);
-}
-
-void
 ResolveExpr::visit (AST::TupleIndexExpr &expr)
 {
   resolve_expr (expr.get_tuple_expr ().get (), expr.get_node_id ());