Type of issue

Other (describe below)

Description

In the Grammar ambiguities section mentioned below,

If a sequence of tokens can be parsed (in context) as a simple_name, member_access, or pointer_member_access ending with a type_argument_list, the token immediately following the closing > token is examined, to see if it is:

...
One of the relational operators < > <= >= is as;
...

If the following token is among this list, or an identifier in such a context, then the type_argument_list is retained as part of the simple_name, member_access or pointer_member-access and any other possible parse of the sequence of tokens is discarded. Otherwise, the type_argument_list is not considered to be part of the simple_name, member_access or pointer_member_access, even if there is no other possible parse of the sequence of tokens.

The statements

F(G<A, B>7);
F(G<A, B>>7);

will each be interpreted as a call to F with two arguments.

it is mentioned that if the token following the > token in a simple name / member access / pointer member access is one of the relational operators (< > <= >= is as), the simple name / member access / pointer member access will be interpreted with type argument list.

But in the mentioned example, F(G<A, B>>7), the token > is followed by the token >. Need help to understand why it is not being interpreted with type argument list.

Page URL

https://learn.microsoft.com/en-us/dotnet/csharp/language-reference/language-specification/lexical-structure

Content source URL

https://github.com/dotnet/csharpstandard/blob/draft-v8/standard/lexical-structure.md