AbbreviationParse-tree headerMeaningExternal repr.
ast_list[]param.list
ast_of()application
ast_iter_listitriterators
ast_genset{}setformer
ast_ininmembership
ast_ofa{.}multiapplication
ast_eq=equality
ast_existsEXexist. quantifier
ast_ex_iterEtrexist. iterators
ast_forallALLuniv. quantifier
ast_enum_set{-}enumerated set
ast_andandconjunction
ast_orordisjunction
DOT_EQ==biimplication
ast_add+union
ast_mult*intersection
ast_sub-set difference
ast_enum_tup[-]enumerated tuple
ast_notnotnegation
ast_notinnotinneg. membership
DOT_NEQ/==exclusive or
ast_ne/=inequality
ast_incsincsincludes
DOT_INCINincinis included in
TILDE_->map application
DOT_IMPimpimplication
_nullset0void{}
ast_genset_noexp{/}
ast_nullnull
ast_arbarbarbitrary choice
ast_assign:=assignment
AMP_andconjunction, 2
ast_domaindomaindomaindomain
ast_rangerangeimagerange
AT_@map composition
ast_nelt#cardinality
ast_gt>greater than
ast_ge>=greater than or equal
ast_lt<less than
ast_le<=less than or equal
ast_powpowpowerset
ast_if_exprifif ... then ... else ...

Note: In order to get a view of syntax trees generated by the SETL parser, it suffices to compile a SETL program by means of the command

stlc -da test.stl
To see, more generally, which are all available options for the SETL compiler, just ask
stlc --h