Refactor binary expression parsing in binary.txt

- Adjusted indentation for source_file to improve readability.
- Wrapped generic_name expressions in parenthesized_expression for consistency.
- Enhanced structure of function_call_expression to align with updated parsing rules.

Author: 0xGeorgii

Cargo.toml

@@ -1,7 +1,7 @@
 [package]
 name = "tree-sitter-inference"
 description = "Inference grammar for tree-sitter"
-version = "0.0.34"
+version = "0.0.35"
 authors = [
     "Georgii Plotnikov <[email protected]>"
 ]

Makefile

@@ -198,7 +198,8 @@ module.exports = grammar({
       field('expression', choice(
         $.type_member_access_expression,
         $._identifier_like_embedded_type,
-        $._name
+        $._name,
+        $.parenthesized_expression
       )),
       alias(token.immediate('::'), '::'),
       field('name', $._simple_name),

grammar.js

@@ -1,6 +1,6 @@
 {
   "name": "tree-sitter-inference",
-  "version": "0.0.34",
+  "version": "0.0.35",
   "description": "Inference grammar for tree-sitter",
   "main": "bindings/node",
   "types": "bindings/node",

package-lock.json

@@ -5,7 +5,7 @@ build-backend = "setuptools.build_meta"
 [project]
 name = "tree-sitter-inference"
 description = "Inference grammar for tree-sitter"
-version = "0.0.34"
+version = "0.0.35"
 keywords = ["incremental", "parsing", "tree-sitter", "inference"]
 classifiers = [
   "Intended Audience :: Developers",