How a noisy log becomes a validated hierarchy.
Topology parsing
Locate the table
- 1 Normalize line endings, strip ANSI control sequences, and remove common transcript prefixes such as #, >, or |.
- 2 Find a line whose first three normalized columns are Name, Type, and Size.
- 3 Require divider lines before the header, after the header, and after the data rows.
- 4 Split each data row into instance name, class type, and size while preserving leading indentation.
Reconstruct hierarchy from indentation
The shallowest row becomes the root. When indentation uses a consistent unit, rows are ranked by that unit; otherwise raw whitespace width is used. A stack finds the closest shallower parent for each row and produces a dotted full path.
Honest parse failures
| Message | Meaning |
|---|---|
| No UVM topology block found | No valid header/divider structure or no usable rows was found. |
| Hierarchy is malformed | Indentation cannot assign a valid parent to a row. |