| 26 | 26 | |
| 27 | 27 | |
| 28 | 28 | def parse(input_string: str) -> SgfTree: |
| 29 | | pass |
| 29 | """ |
| 30 | Parse an SGF string and return a tree structure of properties. |
| 31 | |
| 32 | Args: |
| 33 | input_string: A string in SGF format |
| 34 | |
| 35 | Returns: |
| 36 | SgfTree: The parsed SGF tree |
| 37 | |
| 38 | Raises: |
| 39 | ValueError: If the input is invalid according to SGF format rules |
| 40 | """ |
| 41 | # Edge Case: Empty input |
| 42 | if not input_string: |
| 43 | raise ValueError("tree missing") |
| 44 | |
| 45 | # Edge Case: Input doesn't start with '(' |
| 46 | if not input_string.startswith('('): |
| 47 | raise ValueError("tree missing") |
| 48 | |
| 49 | # Edge Case: Input doesn't end with ')' |
| 50 | if not input_string.endswith(')'): |
| 51 | raise ValueError("tree missing") |
| 52 | |
| 53 | # Remove the outer parentheses |
| 54 | content = input_string[1:-1] |
| 55 | |
| 56 | # Edge Case: Empty tree with no nodes |
| 57 | if not content: |
| 58 | raise ValueError("tree with no nodes") |
| 59 | |
| 60 | # Parse the tree |
| 61 | tree, _ = _parse_tree(content, 0) |
| 62 | return tree |
| 63 | |
| 64 | |
| 65 | def _parse_tree(content: str, index: int) -> tuple[SgfTree, int]: |
| 66 | """ |
| 67 | Parse a tree from the content string starting at index. |
| 68 | |
| 69 | Args: |
| 70 | content: The SGF content string |
| 71 | index: The starting index for parsing |
| 72 | |
| 73 | Returns: |
| 74 | tuple: A tuple containing the parsed SgfTree and the next index to parse |
| 75 | """ |
| 76 | # Edge Case: Missing semicolon at the beginning of a node |
| 77 | if index >= len(content) or content[index] != ';': |
| 78 | raise ValueError("tree missing") |
| 79 | |
| 80 | index += 1 # Skip the semicolon |
| 81 | |
| 82 | # Parse properties of the current node |
| 83 | properties = {} |
| 84 | while index < len(content) and content[index] not in '();': |
| 85 | # Parse key |
| 86 | key_start = index |
| 87 | while index < len(content) and content[index].isalpha() and content[index].isupper(): |
| 88 | index += 1 |
| 89 | |
| 90 | # Edge Case: Property key is not in uppercase |
| 91 | if index == key_start: |
| 92 | raise ValueError("property must be in uppercase") |
| 93 | |
| 94 | key = content[key_start:index] |
| 95 | |
| 96 | # Edge Case: Missing opening bracket for property value |
| 97 | if index >= len(content) or content[index] != '[': |
| 98 | raise ValueError("properties without delimiter") |
| 99 | |
| 100 | # Parse values |
| 101 | values = [] |
| 102 | while index < len(content) and content[index] == '[': |
| 103 | index += 1 # Skip the opening bracket |
| 104 | value, index = _parse_value(content, index) |
| 105 | |
| 106 | # Edge Case: Missing closing bracket for property value |
| 107 | if index >= len(content) or content[index] != ']': |
| 108 | raise ValueError("properties without delimiter") |
| 109 | |
| 110 | index += 1 # Skip the closing bracket |
| 111 | values.append(value) |
| 112 | |
| 113 | properties[key] = values |
| 114 | |
| 115 | # Parse children - both variations (in parentheses) and sequential nodes (separated by semicolons) |
| 116 | children = [] |
| 117 | |
| 118 | # First handle variations (nodes in parentheses) |
| 119 | while index < len(content) and content[index] == '(': |
| 120 | child, index = _parse_tree(content, index + 1) # Skip the opening parenthesis |
| 121 | children.append(child) |
| 122 | |
| 123 | # Skip the closing parenthesis |
| 124 | # Edge Case: Missing closing parenthesis for child tree |
| 125 | if index >= len(content) or content[index] != ')': |
| 126 | raise ValueError("tree missing") |
| 127 | index += 1 |
| 128 | |
| 129 | # Then handle sequential nodes (separated by semicolons) |
| 130 | if index < len(content) and content[index] == ';': |
| 131 | # Parse the next sequential node as a child |
| 132 | child, index = _parse_tree(content, index) |
| 133 | children.append(child) |
| 134 | |
| 135 | return SgfTree(properties, children), index |
| 136 | |
| 137 | |
| 138 | def _parse_value(content: str, index: int) -> tuple[str, int]: |
| 139 | """ |
| 140 | Parse a property value according to SGF Text type rules. |
| 141 | |
| 142 | Args: |
| 143 | content: The SGF content string |
| 144 | index: The starting index for parsing the value |
| 145 | |
| 146 | Returns: |
| 147 | tuple: A tuple containing the parsed value string and the next index to parse |
| 148 | """ |
| 149 | result = [] |
| 150 | while index < len(content): |
| 151 | if content[index] == ']': |
| 152 | # Found the end of the value |
| 153 | break |
| 154 | elif content[index] == '\\': |
| 155 | # Handle escape character |
| 156 | index += 1 |
| 157 | if index >= len(content): |
| 158 | # Edge Case: Escape character at end of content |
| 159 | result.append('\\') |
| 160 | break |
| 161 | |
| 162 | char = content[index] |
| 163 | if char == '\n': |
| 164 | # Newlines are removed if they come immediately after \ |
| 165 | index += 1 |
| 166 | continue |
| 167 | elif char.isspace(): |
| 168 | # Other whitespace characters after \ are converted to spaces |
| 169 | result.append(' ') |
| 170 | else: |
| 171 | # Any non-whitespace character after \ is inserted as-is |
| 172 | result.append(char) |
| 173 | elif content[index] == '\n': |
| 174 | # Newlines remain as newlines |
| 175 | result.append(content[index]) |
| 176 | elif content[index].isspace() and content[index] != '\n': |
| 177 | # All whitespace characters other than newline are converted to spaces |
| 178 | result.append(' ') |
| 179 | else: |
| 180 | # Regular character |
| 181 | result.append(content[index]) |
| 182 | index += 1 |
| 183 | |
| 184 | return ''.join(result), index |
| 185 | |
| 186 | # Handled Edge Cases: Empty input, Input doesn't start with '(', Input doesn't end with ')', Empty tree with no nodes, Missing semicolon at the beginning of a node, Property key is not in uppercase, Missing opening bracket for property value, Missing closing bracket for property value, Missing closing parenthesis for child tree, Escape character at end of content |