| 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 string is not valid SGF |
| 40 | """ |
| 41 | # Edge Case: Empty input |
| 42 | if not input_string: |
| 43 | raise ValueError("tree missing") |
| 44 | |
| 45 | # Edge Case: Missing opening parenthesis |
| 46 | if not input_string.startswith('('): |
| 47 | raise ValueError("tree missing") |
| 48 | |
| 49 | # Edge Case: Missing closing parenthesis |
| 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 |
| 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 |
| 72 | |
| 73 | Returns: |
| 74 | tuple: A tuple containing the parsed SgfTree and the next index |
| 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].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_start = index |
| 105 | |
| 106 | # Parse value - don't skip escape sequences here, let _unescape_text handle them |
| 107 | while index < len(content) and content[index] != ']': |
| 108 | index += 1 |
| 109 | |
| 110 | # Edge Case: Missing closing bracket |
| 111 | if index >= len(content) or content[index] != ']': |
| 112 | raise ValueError("properties without delimiter") |
| 113 | |
| 114 | value = _unescape_text(content[value_start:index]) |
| 115 | values.append(value) |
| 116 | index += 1 # Skip the closing bracket |
| 117 | |
| 118 | properties[key] = values |
| 119 | |
| 120 | # Parse children - handle both variations (parentheses) and sequential nodes (semicolons) |
| 121 | children = [] |
| 122 | |
| 123 | # First, handle variations (parenthesized branches) |
| 124 | while index < len(content) and content[index] == '(': |
| 125 | child, index = _parse_tree(content, index + 1) # Skip the opening parenthesis |
| 126 | children.append(child) |
| 127 | |
| 128 | # Skip the closing parenthesis |
| 129 | if index >= len(content) or content[index] != ')': |
| 130 | raise ValueError("tree missing") |
| 131 | index += 1 |
| 132 | |
| 133 | # Then, handle sequential nodes (semicolons) |
| 134 | while index < len(content) and content[index] == ';': |
| 135 | child, index = _parse_tree(content, index) # Don't skip, _parse_tree expects the semicolon |
| 136 | children.append(child) |
| 137 | |
| 138 | return SgfTree(properties, children), index |
| 139 | |
| 140 | |
| 141 | def _unescape_text(text: str) -> str: |
| 142 | """ |
| 143 | Unescape SGF text according to SGF specification. |
| 144 | |
| 145 | Args: |
| 146 | text: The escaped text |
| 147 | |
| 148 | Returns: |
| 149 | str: The unescaped text |
| 150 | """ |
| 151 | result = [] |
| 152 | i = 0 |
| 153 | while i < len(text): |
| 154 | if text[i] == '\\': |
| 155 | i += 1 |
| 156 | if i < len(text): |
| 157 | next_char = text[i] |
| 158 | # If next character is newline, remove the backslash and newline (per SGF spec) |
| 159 | if next_char == '\n': |
| 160 | # Remove backslash + newline entirely |
| 161 | i += 1 |
| 162 | elif next_char.isspace(): |
| 163 | # For other whitespace after backslash, convert to space |
| 164 | result.append(' ') |
| 165 | i += 1 |
| 166 | else: |
| 167 | # For non-whitespace characters after backslash, insert as-is |
| 168 | result.append(next_char) |
| 169 | i += 1 |
| 170 | else: |
| 171 | # Edge Case: Backslash at end of text |
| 172 | result.append('\\') |
| 173 | else: |
| 174 | char = text[i] |
| 175 | # Convert all whitespace characters other than newline to spaces |
| 176 | if char != '\n' and char.isspace(): |
| 177 | result.append(' ') |
| 178 | else: |
| 179 | result.append(char) |
| 180 | i += 1 |
| 181 | |
| 182 | return ''.join(result) |
| 183 | # Handled Edge Cases: Empty input, missing opening parenthesis, missing closing parenthesis, empty tree, missing semicolon at the beginning of a node, property key is not in uppercase, missing opening bracket for property value, missing closing bracket, backslash at end of text |
| 184 | # Handled Edge Cases: Missing semicolon at the beginning of a node, property key is not in uppercase, missing opening bracket for property value, missing closing bracket |
| 185 | # Handled Edge Cases: Empty input, missing opening parenthesis, missing closing parenthesis, empty tree, missing semicolon at the beginning of a node, property key is not in uppercase, missing opening bracket for property value, missing closing bracket, backslash at end of text |