Toy Language Type System

Problem Overview

You are tasked with implementing a type system for a toy programming language. This language supports:

• Primitives: int, float, str
• Generics: Uppercase letters with optional numbers, e.g., T, T1, T2, S
• Tuples: Lists of types enclosed in brackets, which can contain primitives, generics, or nested tuples
• Examples: [int, T1, str], [int, str, [int, T1]]
• Functions: Defined with parameters and a return type
• Syntax: [param1, param2, ...] -> returnType
• Example: [int, [int, T1], T2] -> [str, T2, [float, float]] You need to implement two classes: Node and Function.

Class Specifications

Node Class

The Node class represents a type in the language, which can be either: [Source: darkinterview.com]

• A primitive or generic type (single value)
• A tuple (list of child nodes) Constructor: `def init(self, node_type: Union[str, List['Node']])
• If node_type is a string: represents a primitive or generic type
• If node_type is a list: represents a tuple containing child nodes Key Methods:
• __str__(): Returns the string representation of the node (see Part 1)

Function Class

The Function class represents a function signature with parameters and a return type. [Source: darkinterview.com]