[YANGTOOLS-1051] Reformulate LeafRefValidation in terms of PathExpression Created: 23/Dec/19 Updated: 26/Dec/19 Resolved: 26/Dec/19 |
|
| Status: | Resolved |
| Project: | yangtools |
| Component/s: | data-impl |
| Affects Version/s: | None |
| Fix Version/s: | 4.0.4 |
| Type: | Improvement | Priority: | Medium |
| Reporter: | Robert Varga | Assignee: | Robert Varga |
| Resolution: | Done | Votes: | 0 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Issue Links: |
|
||||||||||||
| Description |
|
Current implementation of LeafRefValidation relies on parsing the path expression, containing a duplicate ANTLR parser for that purpose. Leafref paths are already being fully parsed by the YANG parser, exposing the expression in terms of normal steps. This should be sufficient to eliminate duplicate parsing and re-formulating LeafRefValidation such that it will walk the individual steps and construct its enforcement structure accordingly. |