binary B+ tree - first attempt, compiles and runs

[svn/Cll1h/.git] / demos / boolean.c

#include "cll1.h"

program
{
 const bool t = TRUE, f = FALSE;
 bool l, m = MAYBE;
 str s;

 print("TRUE and FALSE =", btoa(t and f) );
 print("TRUE or FALSE =", btoa(t or f) );
 print("TRUE and MAYBE =", btoa(t and m) );
 print("FALSE or MAYBE =", btoa(t or m) );
 print("not FALSE =", btoa(not f) );
 print("not TRUE =", btoa(not t) );
 print("not MAYBE =", btoa(not m) );
 
 for_strs(s, "TRUE","false","yes","NO","True","FALSE","YES","no","Yes","No","1","0","abc","xyz","Eyes","Ears","rue","alse","oui","no","ano","ne"," ","NULL",NULL,EOL,"","ano","ne")
 {
  l = atob(s);
  echo("\"", s, "\"\tmeans ", btoa(l), EOL);
 } 
}