| 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 containing SGF formatted data |
| 34 | |
| 35 | Returns: |
| 36 | SgfTree: A tree structure representing the SGF data |
| 37 | |
| 38 | Raises: |
| 39 | ValueError: If the input is invalid according to SGF format rules |
| 40 | """ |
| 41 | # Edge Case: Empty input or input that doesn't start with '(' |
| 42 | if not input_string or not input_string.startswith('('): |
| 43 | raise ValueError("tree missing") |
| 44 | |
| 45 | # Edge Case: Input that doesn't end with ')' |
| 46 | if not input_string.endswith(')'): |
| 47 | raise ValueError("tree missing") |
| 48 | |
| 49 | # Remove the outer parentheses |
| 50 | content = input_string[1:-1] |
| 51 | |
| 52 | # Edge Case: Empty content after removing parentheses |
| 53 | if not content: |
| 54 | raise ValueError("tree with no nodes") |
| 55 | |
| 56 | # Parse the tree |
| 57 | tree, _ = _parse_tree(content, 0) |
| 58 | return tree |
| 59 | |
| 60 | |
| 61 | def _parse_tree(content: str, index: int) -> tuple[SgfTree, int]: |
| 62 | """ |
| 63 | Parse a tree from the content string starting at the given index. |
| 64 | |
| 65 | Args: |
| 66 | content: The SGF content string |
| 67 | index: The starting index for parsing |
| 68 | |
| 69 | Returns: |
| 70 | tuple: A tuple containing the parsed SgfTree and the next index to parse |
| 71 | """ |
| 72 | # Edge Case: Content doesn't start with ';' |
| 73 | if index >= len(content) or content[index] != ';': |
| 74 | raise ValueError("tree with no nodes") |
| 75 | |
| 76 | index += 1 # Skip the ';' |
| 77 | |
| 78 | # Parse properties of the current node |
| 79 | properties = {} |
| 80 | while index < len(content) and content[index] not in '();': |
| 81 | # Parse key |
| 82 | key_start = index |
| 83 | while index < len(content) and content[index].isalpha() and content[index].isupper(): |
| 84 | index += 1 |
| 85 | |
| 86 | # Edge Case: Key is not all uppercase |
| 87 | if index == key_start: |
| 88 | raise ValueError("property must be in uppercase") |
| 89 | |
| 90 | key = content[key_start:index] |
| 91 | |
| 92 | # Edge Case: No values for the property |
| 93 | if index >= len(content) or content[index] != '[': |
| 94 | raise ValueError("properties without delimiter") |
| 95 | |
| 96 | # Parse values |
| 97 | values = [] |
| 98 | while index < len(content) and content[index] == '[': |
| 99 | index += 1 # Skip '[' |
| 100 | value_start = index |
| 101 | |
| 102 | # Parse value, handling escapes |
| 103 | while index < len(content) and content[index] != ']': |
| 104 | if content[index] == '\\': |
| 105 | index += 2 # Skip escape and next character |
| 106 | else: |
| 107 | index += 1 |
| 108 | |
| 109 | # Edge Case: Unclosed value bracket |
| 110 | if index >= len(content): |
| 111 | raise ValueError("properties without delimiter") |
| 112 | |
| 113 | value = _unescape_text(content[value_start:index]) |
| 114 | values.append(value) |
| 115 | index += 1 # Skip ']' |
| 116 | |
| 117 | properties[key] = values |
| 118 | |
| 119 | # Parse children (variations in parentheses) |
| 120 | children = [] |
| 121 | while index < len(content) and content[index] == '(': |
| 122 | child, index = _parse_tree(content, index + 1) # Skip '(' |
| 123 | children.append(child) |
| 124 | # Skip ')' |
| 125 | if index >= len(content) or content[index] != ')': |
| 126 | raise ValueError("tree missing") |
| 127 | index += 1 |
| 128 | |
| 129 | # Create current node |
| 130 | current_node = SgfTree(properties, children) |
| 131 | |
| 132 | # Check for consecutive nodes (semicolon) |
| 133 | if index < len(content) and content[index] == ';': |
| 134 | # This is a consecutive node, treat it as a child |
| 135 | child_node, index = _parse_tree(content, index) |
| 136 | current_node.children.append(child_node) |
| 137 | |
| 138 | return current_node, index |
| 139 | |
| 140 | |
| 141 | def _unescape_text(text: str) -> str: |
| 142 | """ |
| 143 | Process escape sequences in SGF text according to SGF specification. |
| 144 | |
| 145 | Args: |
| 146 | text: The text to process |
| 147 | |
| 148 | Returns: |
| 149 | str: The processed text with escape sequences handled |
| 150 | """ |
| 151 | result = [] |
| 152 | i = 0 |
| 153 | while i < len(text): |
| 154 | if text[i] == '\\': |
| 155 | i += 1 |
| 156 | # Edge Case: Backslash at end of text |
| 157 | if i >= len(text): |
| 158 | result.append('\\') |
| 159 | break |
| 160 | |
| 161 | char = text[i] |
| 162 | # If next character is newline, remove the backslash and newline |
| 163 | if char == '\n': |
| 164 | i += 1 |
| 165 | continue |
| 166 | # All whitespace characters other than newline are converted to spaces |
| 167 | elif char.isspace(): |
| 168 | result.append(' ') |
| 169 | else: |
| 170 | # Any non-whitespace character after \ is inserted as-is |
| 171 | result.append(char) |
| 172 | i += 1 |
| 173 | else: |
| 174 | char = text[i] |
| 175 | # All whitespace characters other than newline are converted 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 | |
| 184 | # Handled Edge Cases: Empty input, missing opening parenthesis, missing closing parenthesis, empty content after parentheses removal, missing semicolon, non-uppercase keys, missing property delimiters, unclosed value brackets, backslash at end of text" |