Simplify hierarchical traversal
未關閉
refactoring
- 主要語言
- Scala
- 星號
- 170
- 分支
- 96
- 平均合併
- 57 分鐘
- 30 天內合併 PR
- 2
描述
## Background
Currently, the hierarchical records generator uses a lot of auxiliary arrays, maps, etc. Maybe if the parser could specify child segments for segment redefines instead of setting parent segment for child segment redefines the traversal could be simplified.
## Feature
Investigate if hierarchical traversal can be simplified.
## Additional context
* Consider using visitor pattern for both nested and hierarchical traversals so that the traversal algorithms can be reused.
* If this could be achieved the traversal algorithms can be moved from `spark-cobol` to `cobol-parser`.
貢獻指南
這個儲存庫沒有索引到貢獻指南
評估
這個 Issue 還沒有評估資料。