Fix the associativity of ->, <->, U, R, W, and M wrt the PSL standard.
* src/ltlparse/ltlparse.yy: Make all the above operators right-associative. Also let `:' have precedence over `;'. * src/ltltest/reduccmp.test: Adjust for the `:' precedence. * doc/tl/tl.tex, NEWS: Document this.
This commit is contained in:
parent
807dcefba4
commit
ce437cd499
4 changed files with 43 additions and 45 deletions
4
NEWS
4
NEWS
|
|
@ -36,7 +36,9 @@ New in spot 0.8.3a:
|
|||
configured and built. This helps on systems (such as MinGW)
|
||||
where LBTT cannot be built. The test-suite will skip any
|
||||
LBTT-based test if LBTT is missing.
|
||||
* Interface chances:
|
||||
* Interface changes:
|
||||
- Operators ->, <->, U, W, R, and M are no parsed as
|
||||
right-associative to better match the PSL standard.
|
||||
- The new entry point for LTL/PSL simplifications is the function
|
||||
ltl_simplifier::simplify() declared in src/ltlvisit/simplify.hh.
|
||||
The ltl_simplifier class implements a cache.
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue