Testovaci dotazy
----------------


_#occurrences=0:
---------------

[afun=Atr,_#occurrences=0] - ???
[afun=Atr,_#occurrences=0,_transitive=true] - stromy bez Atr
[afun=Pred]([afun=Sb,_#occurrences=0]) - stromy s Pred bez Sb

_#occurrences=!0:
----------------
[afun=Pred]([afun=Adv,_#occurrences=2]) - stromy s Pred s prave dvema Adv
[afun=Pred]([afun=Atr,_transitive=true,_#occurrences=2]) - stromy s prave dvema Atr nekde pod spolecnym Pred
[afun=Pred]([afun=Sb,_#occurrences=0|1]) - stromy s Pred bez Sb nebo s jednim Sb
[afun=Pred]([afun=Sb,_#occurrences<=1]) - totez co predchozi (musi dat stejny vysledek)
[_#sons=2,_#occurrences=2] - vrchol se dvema syny, ktery ma prave jednoho bratra se dvema syny (a mozna dalsi bratry s jinym poctem synu)

kombinace _#occurrences=0 a referenci:
--------------------------------------
[]([_name=N1],[ord<{N1.ord},_#occurrences=0]) - nejlevejsi syn (musi dat stejny vysledek jako []([_#lbrothers=0]))
[afun=Pred]([ord>{N1.ord},_#occurrences=0,_transitive=true],[_name=N1,_transitive=true]) - nejpravejsi potomek Pred
[afun=Pred]([ord<{N1.ord},_#occurrences=0,_transitive=true,_#sons=0],[_name=N1,_transitive=true,_#sons=0]) - nejlevejsi list pod Pred

kombinace _#occurrences=!0 a referenci:
---------------------------------------
[afun=Pred]([ord>{N1.ord},_#occurrences=1,_transitive=true],[_name=N1,_transitive=true]) - druhy nejlevejsi potomek Pred

_optional a _transitive:
------------------------
[]([_transitive=exclusive],[_transitive=exclusive],[_transitive=exclusive]) - vrchol a vsechny kombinace jeho tri potomku s disjunktnimi hranami
[]([_optional=true]([]),[_optional=true]([]),[_optional=true]([])) - musi dat totez co predchozi