dicelab-0.7/0000777000175000017500000000000011303221402007734 500000000000000dicelab-0.7/tree.tc0000644000175000017500000000316711303206024011151 00000000000000%option lang = "C" %option track_lines %decls %{ #include "roll.h" %} %{ #include #include #include #include "tree.h" #include "util.h" int yyerror(char *s); %} %enum filter_type = { drop, keep } %enum comparison_type = { eq, ne, lt, gt, le, ge } %enum ordering_type = { agnostic, caring } %node expression %abstract %typedef = { %nocreate struct symtab *symtab = {NULL}; %nocreate ordering_type ordering = {caring}; } %node elist expression %node binary expression %abstract = { expression *expr1; expression *expr2; } %node unary expression %abstract = { expression *expr; } %node number expression = { int num; } %node negate unary %node dice unary %node sum unary %node prod unary %node count unary %node perm unary %node sort unary %node rev unary %node mathop binary %abstract %node plus mathop %node minus mathop %node multi mathop %node divi mathop %node mod mathop %node expo mathop %node scat binary %node rep binary %node range binary %node lcat binary %node ifthenelse expression = { expression *if_expr; expression *then_expr; expression *else_expr; } %node filter binary %abstract = { filter_type type; } %node first filter %node last filter %node high filter %node low filter %node comparison filter = { comparison_type comp; } %node let binary = { char *varname; } %node foreach binary = { char *varname; } %node whiledo binary = { char *varname; } %node variable expression = { char * varname; } %include "printtree.tc" %include "roll.tc" %include "symtab.tc" %include "ordering.tc" %include "eval.tc" %include "optimize.tc" dicelab-0.7/configure.in0000644000175000017500000000056111303206024012166 00000000000000AC_INIT([dicelab], [0.7], [Robert Lemmen ]) AM_INIT_AUTOMAKE([dicelab], [0.7], [Robert Lemmen ]) AC_CONFIG_HEADERS([config.h]) AC_PROG_CC AC_PROG_INSTALL AC_PROG_LEX AC_PROG_YACC AC_CHECK_TOOL([TREECC], [treecc]) AC_HEADER_STDC AC_CHECK_LIB([m], [pow]) AC_FUNC_MALLOC AC_FUNC_REALLOC AC_FUNC_MEMCMP AC_OUTPUT(Makefile) dicelab-0.7/ylwrap0000755000175000017500000001407410753463634011151 00000000000000#! /bin/sh # ylwrap - wrapper for lex/yacc invocations. scriptversion=2007-11-22.22 # Copyright (C) 1996, 1997, 1998, 1999, 2001, 2002, 2003, 2004, 2005, # 2007 Free Software Foundation, Inc. # # Written by Tom Tromey . # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # This file is maintained in Automake, please report # bugs to or send patches to # . case "$1" in '') echo "$0: No files given. Try \`$0 --help' for more information." 1>&2 exit 1 ;; --basedir) basedir=$2 shift 2 ;; -h|--h*) cat <<\EOF Usage: ylwrap [--help|--version] INPUT [OUTPUT DESIRED]... -- PROGRAM [ARGS]... Wrapper for lex/yacc invocations, renaming files as desired. INPUT is the input file OUTPUT is one file PROG generates DESIRED is the file we actually want instead of OUTPUT PROGRAM is program to run ARGS are passed to PROG Any number of OUTPUT,DESIRED pairs may be used. Report bugs to . EOF exit $? ;; -v|--v*) echo "ylwrap $scriptversion" exit $? ;; esac # The input. input="$1" shift case "$input" in [\\/]* | ?:[\\/]*) # Absolute path; do nothing. ;; *) # Relative path. Make it absolute. input="`pwd`/$input" ;; esac pairlist= while test "$#" -ne 0; do if test "$1" = "--"; then shift break fi pairlist="$pairlist $1" shift done # The program to run. prog="$1" shift # Make any relative path in $prog absolute. case "$prog" in [\\/]* | ?:[\\/]*) ;; *[\\/]*) prog="`pwd`/$prog" ;; esac # FIXME: add hostname here for parallel makes that run commands on # other machines. But that might take us over the 14-char limit. dirname=ylwrap$$ trap "cd '`pwd`'; rm -rf $dirname > /dev/null 2>&1" 1 2 3 15 mkdir $dirname || exit 1 cd $dirname case $# in 0) "$prog" "$input" ;; *) "$prog" "$@" "$input" ;; esac ret=$? if test $ret -eq 0; then set X $pairlist shift first=yes # Since DOS filename conventions don't allow two dots, # the DOS version of Bison writes out y_tab.c instead of y.tab.c # and y_tab.h instead of y.tab.h. Test to see if this is the case. y_tab_nodot="no" if test -f y_tab.c || test -f y_tab.h; then y_tab_nodot="yes" fi # The directory holding the input. input_dir=`echo "$input" | sed -e 's,\([\\/]\)[^\\/]*$,\1,'` # Quote $INPUT_DIR so we can use it in a regexp. # FIXME: really we should care about more than `.' and `\'. input_rx=`echo "$input_dir" | sed 's,\\\\,\\\\\\\\,g;s,\\.,\\\\.,g'` while test "$#" -ne 0; do from="$1" # Handle y_tab.c and y_tab.h output by DOS if test $y_tab_nodot = "yes"; then if test $from = "y.tab.c"; then from="y_tab.c" else if test $from = "y.tab.h"; then from="y_tab.h" fi fi fi if test -f "$from"; then # If $2 is an absolute path name, then just use that, # otherwise prepend `../'. case "$2" in [\\/]* | ?:[\\/]*) target="$2";; *) target="../$2";; esac # We do not want to overwrite a header file if it hasn't # changed. This avoid useless recompilations. However the # parser itself (the first file) should always be updated, # because it is the destination of the .y.c rule in the # Makefile. Divert the output of all other files to a temporary # file so we can compare them to existing versions. if test $first = no; then realtarget="$target" target="tmp-`echo $target | sed s/.*[\\/]//g`" fi # Edit out `#line' or `#' directives. # # We don't want the resulting debug information to point at # an absolute srcdir; it is better for it to just mention the # .y file with no path. # # We want to use the real output file name, not yy.lex.c for # instance. # # We want the include guards to be adjusted too. FROM=`echo "$from" | sed \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'\ -e 's/[^ABCDEFGHIJKLMNOPQRSTUVWXYZ]/_/g'` TARGET=`echo "$2" | sed \ -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'\ -e 's/[^ABCDEFGHIJKLMNOPQRSTUVWXYZ]/_/g'` sed -e "/^#/!b" -e "s,$input_rx,," -e "s,$from,$2," \ -e "s,$FROM,$TARGET," "$from" >"$target" || ret=$? # Check whether header files must be updated. if test $first = no; then if test -f "$realtarget" && cmp -s "$realtarget" "$target"; then echo "$2" is unchanged rm -f "$target" else echo updating "$2" mv -f "$target" "$realtarget" fi fi else # A missing file is only an error for the first file. This # is a blatant hack to let us support using "yacc -d". If -d # is not specified, we don't want an error when the header # file is "missing". if test $first = yes; then ret=1 fi fi shift shift first=no done else ret=$? fi # Remove the directory. cd .. rm -rf $dirname exit $ret # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: dicelab-0.7/ChangeLog0000644000175000017500000000426111303210371011430 00000000000000Dicelab 0.7 - Nov 25, 2009 ========================== - the documentation was improved, we now have a halfway useful manual - an optimising framework was added and a first cases for "sum X # Y" expressions was added. this is really cool! - fixed handling of msdos (\r\n) newlines - fixed a build problem related to yylineno - a parser problem related to unary minus was fixed ("2-1" vs "2 - 1") - problems in expressions like "sum keep high 2 3#d6" were fixed - a bug in foreach (all probabilities too low) was fixed - a manual is now included lots of fixes by jonas koelker (thanks a lot!): - code cleanups and simplifications, memory allocation fixes, Makefile fixes - repetition of a fixed value did not return the default (0) - segfault in "prod ((), ())" - a problem with the ordering in variables was fixed Dicelab 0.6 - Feb 22, 2008 ========================== Defering whether an operator cares about the ordering of the lists it gets is extended and also includes "let" expressions now. this should significantly speed up many operations. Dicelab 0.5 - Dec 10, 2007 ========================== You can now do perl-like comments starting with a '#', which allows she-bang lines. A segfault in the sorting of results was fixed, and the "let" operator works correctly with "-c" now. Some memory leaks and accesses beyond array bounds were fixed too. A big test suite was added and many errors found this way fixed. Dicelab 0.4 - Aug 14, 2007 ========================== Optimizations that take into account whether the ordering of a result list is of interest to an operator, leads to massive speedups in some cases. Dicelab 0.3 - Jul 07, 2007 ========================== Actually calculating the distribution of values in a precise way is supported. As a consequence the --threshold option was added. Dicelab 0.2 - Mar 22, 2007 ========================== This version adds a way to get the statistical distribution of results by simply rerolling many times. Error reporting was also improved, and some bugs in the grammar fixed. Dicelab 0.1 - Feb 21, 2007 ========================== This is the first "working" release, it does roll dice and has the infrastructure laid out, but is does not yet do statistics. dicelab-0.7/tree.h0000644000175000017500000011427711303206312010777 00000000000000/* tree.h. Generated automatically by treecc */ #ifndef __yy_tree_h #define __yy_tree_h #line 4 "tree.tc" #include "roll.h" #line 1 "symtab.tc" #line 7 "eval.tc" #include extern float cmd_threshold; struct val_list { double prob; int count; int *values; struct val_list *next; }; void list_free(struct val_list *list); #line 26 "tree.h" #ifdef __cplusplus extern "C" { #endif #define expression_kind 14 #define elist_kind 15 #define binary_kind 16 #define unary_kind 17 #define number_kind 18 #define ifthenelse_kind 38 #define variable_kind 48 #define sumrepdice_kind 49 #define sumrepany_kind 50 #define mathop_kind 27 #define scat_kind 34 #define rep_kind 35 #define range_kind 36 #define lcat_kind 37 #define filter_kind 39 #define let_kind 45 #define foreach_kind 46 #define whiledo_kind 47 #define plus_kind 28 #define minus_kind 29 #define multi_kind 30 #define divi_kind 31 #define mod_kind 32 #define expo_kind 33 #define first_kind 40 #define last_kind 41 #define high_kind 42 #define low_kind 43 #define comparison_kind 44 #define negate_kind 19 #define dice_kind 20 #define sum_kind 21 #define prod_kind 22 #define count_kind 23 #define perm_kind 24 #define sort_kind 25 #define rev_kind 26 typedef enum { drop, keep } filter_type; typedef struct expression__ expression; typedef struct elist__ elist; typedef struct binary__ binary; typedef struct unary__ unary; typedef struct number__ number; typedef struct ifthenelse__ ifthenelse; typedef struct variable__ variable; typedef struct sumrepdice__ sumrepdice; typedef struct sumrepany__ sumrepany; typedef struct mathop__ mathop; typedef struct scat__ scat; typedef struct rep__ rep; typedef struct range__ range; typedef struct lcat__ lcat; typedef struct filter__ filter; typedef struct let__ let; typedef struct foreach__ foreach; typedef struct whiledo__ whiledo; typedef struct plus__ plus; typedef struct minus__ minus; typedef struct multi__ multi; typedef struct divi__ divi; typedef struct mod__ mod; typedef struct expo__ expo; typedef struct first__ first; typedef struct last__ last; typedef struct high__ high; typedef struct low__ low; typedef struct comparison__ comparison; typedef struct negate__ negate; typedef struct dice__ dice; typedef struct sum__ sum; typedef struct prod__ prod; typedef struct count__ count; typedef struct perm__ perm; typedef struct sort__ sort; typedef struct rev__ rev; typedef enum { agnostic, caring } ordering_type; typedef enum { eq, ne, lt, gt, le, ge } comparison_type; #line 1 "c_skel.h" typedef struct { struct YYNODESTATE_block *blocks__; struct YYNODESTATE_push *push_stack__; int used__; } YYNODESTATE; #line 135 "tree.h" struct expression__ { const struct expression_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; }; struct expression_vtable__ { const void *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct expression_vtable__ const expression_vt__; #define printtree(this__,depth) \ ((*(((struct expression_vtable__ *)((this__)->vtable__))->printtree_v__)) \ ((expression *)(this__), (depth))) #define roll(this__) \ ((*(((struct expression_vtable__ *)((this__)->vtable__))->roll_v__)) \ ((expression *)(this__))) #define set_symtab(this__,st) \ ((*(((struct expression_vtable__ *)((this__)->vtable__))->set_symtab_v__)) \ ((expression *)(this__), (st))) #define set_ordering(this__,ordering) \ ((*(((struct expression_vtable__ *)((this__)->vtable__))->set_ordering_v__)) \ ((expression *)(this__), (ordering))) #define eval(this__) \ ((*(((struct expression_vtable__ *)((this__)->vtable__))->eval_v__)) \ ((expression *)(this__))) #define optimize(this__) \ ((*(((struct expression_vtable__ *)((this__)->vtable__))->optimize_v__)) \ ((expression *)(this__))) extern void expression_set_ordering__(expression *this, ordering_type ordering); extern expression * expression_optimize__(expression *this); struct elist__ { const struct elist_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; }; struct elist_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct elist_vtable__ const elist_vt__; extern void elist_printtree__(elist *this, int depth); extern struct roll_value * elist_roll__(elist *this); extern void elist_set_symtab__(elist *this, struct symtab * st); extern struct val_list * elist_eval__(elist *this); struct binary__ { const struct binary_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct binary_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct binary_vtable__ const binary_vt__; extern void binary_set_symtab__(binary *this, struct symtab * st); extern void binary_set_ordering__(binary *this, ordering_type ordering); extern expression * binary_optimize__(binary *this); struct unary__ { const struct unary_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct unary_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct unary_vtable__ const unary_vt__; extern void unary_set_symtab__(unary *this, struct symtab * st); extern void unary_set_ordering__(unary *this, ordering_type ordering); extern expression * unary_optimize__(unary *this); struct number__ { const struct number_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; int num; }; struct number_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct number_vtable__ const number_vt__; extern void number_printtree__(number *this, int depth); extern struct roll_value * number_roll__(number *this); extern void number_set_symtab__(number *this, struct symtab * st); extern struct val_list * number_eval__(number *this); struct ifthenelse__ { const struct ifthenelse_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * if_expr; expression * then_expr; expression * else_expr; }; struct ifthenelse_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct ifthenelse_vtable__ const ifthenelse_vt__; extern void ifthenelse_printtree__(ifthenelse *this, int depth); extern struct roll_value * ifthenelse_roll__(ifthenelse *this); extern void ifthenelse_set_symtab__(ifthenelse *this, struct symtab * st); extern void ifthenelse_set_ordering__(ifthenelse *this, ordering_type ordering); extern struct val_list * ifthenelse_eval__(ifthenelse *this); extern expression * ifthenelse_optimize__(ifthenelse *this); struct variable__ { const struct variable_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; char * varname; }; struct variable_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct variable_vtable__ const variable_vt__; extern void variable_printtree__(variable *this, int depth); extern struct roll_value * variable_roll__(variable *this); extern void variable_set_symtab__(variable *this, struct symtab * st); extern void variable_set_ordering__(variable *this, ordering_type ordering); extern struct val_list * variable_eval__(variable *this); struct sumrepdice__ { const struct sumrepdice_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; struct val_list * num_dice; int num_sides; }; struct sumrepdice_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct sumrepdice_vtable__ const sumrepdice_vt__; extern void sumrepdice_printtree__(sumrepdice *this, int depth); extern struct roll_value * sumrepdice_roll__(sumrepdice *this); extern void sumrepdice_set_symtab__(sumrepdice *this, struct symtab * st); extern struct val_list * sumrepdice_eval__(sumrepdice *this); struct sumrepany__ { const struct sumrepany_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; struct val_list * number; struct val_list * data; }; struct sumrepany_vtable__ { const struct expression_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct sumrepany_vtable__ const sumrepany_vt__; extern void sumrepany_printtree__(sumrepany *this, int depth); extern struct roll_value * sumrepany_roll__(sumrepany *this); extern void sumrepany_set_symtab__(sumrepany *this, struct symtab * st); extern struct val_list * sumrepany_eval__(sumrepany *this); struct mathop__ { const struct mathop_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct mathop_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct mathop_vtable__ const mathop_vt__; extern void mathop_printtree__(mathop *this, int depth); extern struct roll_value * mathop_roll__(mathop *this); extern struct val_list * mathop_eval__(mathop *this); struct scat__ { const struct scat_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct scat_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct scat_vtable__ const scat_vt__; extern void scat_printtree__(scat *this, int depth); extern struct roll_value * scat_roll__(scat *this); extern struct val_list * scat_eval__(scat *this); struct rep__ { const struct rep_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct rep_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct rep_vtable__ const rep_vt__; extern void rep_printtree__(rep *this, int depth); extern struct roll_value * rep_roll__(rep *this); extern struct val_list * rep_eval__(rep *this); struct range__ { const struct range_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct range_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct range_vtable__ const range_vt__; extern void range_printtree__(range *this, int depth); extern struct roll_value * range_roll__(range *this); extern struct val_list * range_eval__(range *this); struct lcat__ { const struct lcat_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct lcat_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct lcat_vtable__ const lcat_vt__; extern void lcat_printtree__(lcat *this, int depth); extern struct roll_value * lcat_roll__(lcat *this); extern struct val_list * lcat_eval__(lcat *this); struct filter__ { const struct filter_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; filter_type type; }; struct filter_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct filter_vtable__ const filter_vt__; struct let__ { const struct let_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; char * varname; }; struct let_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct let_vtable__ const let_vt__; extern void let_printtree__(let *this, int depth); extern struct roll_value * let_roll__(let *this); extern void let_set_ordering__(let *this, ordering_type ordering); extern struct val_list * let_eval__(let *this); struct foreach__ { const struct foreach_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; char * varname; }; struct foreach_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct foreach_vtable__ const foreach_vt__; extern void foreach_printtree__(foreach *this, int depth); extern struct roll_value * foreach_roll__(foreach *this); extern struct val_list * foreach_eval__(foreach *this); struct whiledo__ { const struct whiledo_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; char * varname; }; struct whiledo_vtable__ { const struct binary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct whiledo_vtable__ const whiledo_vt__; extern void whiledo_printtree__(whiledo *this, int depth); extern struct roll_value * whiledo_roll__(whiledo *this); extern struct val_list * whiledo_eval__(whiledo *this); struct plus__ { const struct plus_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct plus_vtable__ { const struct mathop_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct plus_vtable__ const plus_vt__; struct minus__ { const struct minus_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct minus_vtable__ { const struct mathop_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct minus_vtable__ const minus_vt__; struct multi__ { const struct multi_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct multi_vtable__ { const struct mathop_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct multi_vtable__ const multi_vt__; struct divi__ { const struct divi_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct divi_vtable__ { const struct mathop_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct divi_vtable__ const divi_vt__; struct mod__ { const struct mod_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct mod_vtable__ { const struct mathop_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct mod_vtable__ const mod_vt__; struct expo__ { const struct expo_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; }; struct expo_vtable__ { const struct mathop_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct expo_vtable__ const expo_vt__; struct first__ { const struct first_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; filter_type type; }; struct first_vtable__ { const struct filter_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct first_vtable__ const first_vt__; extern void first_printtree__(first *this, int depth); extern struct roll_value * first_roll__(first *this); extern void first_set_ordering__(first *this, ordering_type ordering); extern struct val_list * first_eval__(first *this); struct last__ { const struct last_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; filter_type type; }; struct last_vtable__ { const struct filter_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct last_vtable__ const last_vt__; extern void last_printtree__(last *this, int depth); extern struct roll_value * last_roll__(last *this); extern void last_set_ordering__(last *this, ordering_type ordering); extern struct val_list * last_eval__(last *this); struct high__ { const struct high_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; filter_type type; }; struct high_vtable__ { const struct filter_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct high_vtable__ const high_vt__; extern void high_printtree__(high *this, int depth); extern struct roll_value * high_roll__(high *this); extern struct val_list * high_eval__(high *this); struct low__ { const struct low_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; filter_type type; }; struct low_vtable__ { const struct filter_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct low_vtable__ const low_vt__; extern void low_printtree__(low *this, int depth); extern struct roll_value * low_roll__(low *this); extern struct val_list * low_eval__(low *this); struct comparison__ { const struct comparison_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr1; expression * expr2; filter_type type; comparison_type comp; }; struct comparison_vtable__ { const struct filter_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct comparison_vtable__ const comparison_vt__; extern void comparison_printtree__(comparison *this, int depth); extern struct roll_value * comparison_roll__(comparison *this); extern struct val_list * comparison_eval__(comparison *this); struct negate__ { const struct negate_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct negate_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct negate_vtable__ const negate_vt__; extern void negate_printtree__(negate *this, int depth); extern struct roll_value * negate_roll__(negate *this); extern struct val_list * negate_eval__(negate *this); struct dice__ { const struct dice_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct dice_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct dice_vtable__ const dice_vt__; extern void dice_printtree__(dice *this, int depth); extern struct roll_value * dice_roll__(dice *this); extern struct val_list * dice_eval__(dice *this); struct sum__ { const struct sum_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct sum_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct sum_vtable__ const sum_vt__; extern void sum_printtree__(sum *this, int depth); extern struct roll_value * sum_roll__(sum *this); extern void sum_set_ordering__(sum *this, ordering_type ordering); extern struct val_list * sum_eval__(sum *this); extern expression * sum_optimize__(sum *this); struct prod__ { const struct prod_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct prod_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct prod_vtable__ const prod_vt__; extern void prod_printtree__(prod *this, int depth); extern struct roll_value * prod_roll__(prod *this); extern void prod_set_ordering__(prod *this, ordering_type ordering); extern struct val_list * prod_eval__(prod *this); struct count__ { const struct count_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct count_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct count_vtable__ const count_vt__; extern void count_printtree__(count *this, int depth); extern struct roll_value * count_roll__(count *this); extern void count_set_ordering__(count *this, ordering_type ordering); extern struct val_list * count_eval__(count *this); struct perm__ { const struct perm_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct perm_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct perm_vtable__ const perm_vt__; extern void perm_printtree__(perm *this, int depth); extern struct roll_value * perm_roll__(perm *this); extern void perm_set_ordering__(perm *this, ordering_type ordering); extern struct val_list * perm_eval__(perm *this); struct sort__ { const struct sort_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct sort_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct sort_vtable__ const sort_vt__; extern void sort_printtree__(sort *this, int depth); extern struct roll_value * sort_roll__(sort *this); extern void sort_set_ordering__(sort *this, ordering_type ordering); extern struct val_list * sort_eval__(sort *this); struct rev__ { const struct rev_vtable__ *vtable__; int kind__; char *filename__; long linenum__; struct symtab * symtab; ordering_type ordering; expression * expr; }; struct rev_vtable__ { const struct unary_vtable__ *parent__; int kind__; const char *name__; void (*printtree_v__)(expression *this__, int depth); struct roll_value * (*roll_v__)(expression *this__); void (*set_symtab_v__)(expression *this__, struct symtab * st); void (*set_ordering_v__)(expression *this__, ordering_type ordering); struct val_list * (*eval_v__)(expression *this__); expression * (*optimize_v__)(expression *this__); }; extern struct rev_vtable__ const rev_vt__; extern void rev_printtree__(rev *this, int depth); extern struct roll_value * rev_roll__(rev *this); extern struct val_list * rev_eval__(rev *this); extern expression *elist_create(void); extern expression *number_create(int num); extern expression *ifthenelse_create(expression * if_expr, expression * then_expr, expression * else_expr); extern expression *variable_create(char * varname); extern expression *sumrepdice_create(struct val_list * num_dice, int num_sides); extern expression *sumrepany_create(struct val_list * number, struct val_list * data); extern expression *scat_create(expression * expr1, expression * expr2); extern expression *rep_create(expression * expr1, expression * expr2); extern expression *range_create(expression * expr1, expression * expr2); extern expression *lcat_create(expression * expr1, expression * expr2); extern expression *let_create(expression * expr1, expression * expr2, char * varname); extern expression *foreach_create(expression * expr1, expression * expr2, char * varname); extern expression *whiledo_create(expression * expr1, expression * expr2, char * varname); extern expression *plus_create(expression * expr1, expression * expr2); extern expression *minus_create(expression * expr1, expression * expr2); extern expression *multi_create(expression * expr1, expression * expr2); extern expression *divi_create(expression * expr1, expression * expr2); extern expression *mod_create(expression * expr1, expression * expr2); extern expression *expo_create(expression * expr1, expression * expr2); extern expression *first_create(expression * expr1, expression * expr2, filter_type type); extern expression *last_create(expression * expr1, expression * expr2, filter_type type); extern expression *high_create(expression * expr1, expression * expr2, filter_type type); extern expression *low_create(expression * expr1, expression * expr2, filter_type type); extern expression *comparison_create(expression * expr1, expression * expr2, filter_type type, comparison_type comp); extern expression *negate_create(expression * expr); extern expression *dice_create(expression * expr); extern expression *sum_create(expression * expr); extern expression *prod_create(expression * expr); extern expression *count_create(expression * expr); extern expression *perm_create(expression * expr); extern expression *sort_create(expression * expr); extern expression *rev_create(expression * expr); #ifndef yykind #define yykind(node__) ((node__)->kind__) #endif #ifndef yykindname #define yykindname(node__) ((node__)->vtable__->name__) #endif #ifndef yykindof #define yykindof(type__) (type__##_kind) #endif #ifndef yyisa extern int yyisa__(const void *vtable__, int kind__); #define yyisa(node__,type__) \ (yyisa__((node__)->vtable__, (type__##_kind))) #endif #ifndef yygetfilename #define yygetfilename(node__) ((node__)->filename__) #endif #ifndef yygetlinenum #define yygetlinenum(node__) ((node__)->linenum__) #endif #ifndef yysetfilename #define yysetfilename(node__, value__) \ ((node__)->filename__ = (value__)) #endif #ifndef yysetlinenum #define yysetlinenum(node__, value__) \ ((node__)->linenum__ = (value__)) #endif #ifndef yytracklines_declared extern char *yycurrfilename(void); extern long yycurrlinenum(void); #define yytracklines_declared 1 #endif #ifndef yynodeops_declared extern void yynodeinit(void); extern void *yynodealloc(unsigned int size__); extern int yynodepush(void); extern void yynodepop(void); extern void yynodeclear(void); extern void yynodefailed(void); #define yynodeops_declared 1 #endif #ifdef __cplusplus }; #endif #endif dicelab-0.7/par.h0000644000175000017500000000616011303206450010614 00000000000000/* A Bison parser, made by GNU Bison 2.3. */ /* Skeleton interface for Bison's Yacc-like parsers in C Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ /* As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception. This special exception was added by the Free Software Foundation in version 2.2 of Bison. */ /* Tokens. */ #ifndef YYTOKENTYPE # define YYTOKENTYPE /* Put the tokens into the symbol table, so that GDB and other debuggers know about them. */ enum yytokentype { NUMBER = 258, VARIABLE = 259, IN = 260, DO = 261, WHILE = 262, ELSE = 263, RANGE = 264, EQ = 265, NE = 266, LT = 267, GT = 268, LE = 269, GE = 270, SUM = 271, PROD = 272, COUNT = 273, LOW = 274, HIGH = 275, DICE = 276, PERM = 277, SORT = 278, REV = 279, DROP = 280, KEEP = 281, FIRST = 282, LAST = 283, LET = 284, FOREACH = 285, IF = 286, THEN = 287 }; #endif /* Tokens. */ #define NUMBER 258 #define VARIABLE 259 #define IN 260 #define DO 261 #define WHILE 262 #define ELSE 263 #define RANGE 264 #define EQ 265 #define NE 266 #define LT 267 #define GT 268 #define LE 269 #define GE 270 #define SUM 271 #define PROD 272 #define COUNT 273 #define LOW 274 #define HIGH 275 #define DICE 276 #define PERM 277 #define SORT 278 #define REV 279 #define DROP 280 #define KEEP 281 #define FIRST 282 #define LAST 283 #define LET 284 #define FOREACH 285 #define IF 286 #define THEN 287 #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED typedef union YYSTYPE #line 88 "par.y" { int ival; char *tval; expression *expr; } /* Line 1489 of yacc.c. */ #line 119 "par.h" YYSTYPE; # define yystype YYSTYPE /* obsolescent; will be withdrawn */ # define YYSTYPE_IS_DECLARED 1 # define YYSTYPE_IS_TRIVIAL 1 #endif extern YYSTYPE yylval; dicelab-0.7/roll.c0000644000175000017500000000115111303206024010765 00000000000000#include #include #include "roll.h" struct roll_value *new_roll_single(int num) { struct roll_value *ret = (struct roll_value*)malloc( sizeof(struct roll_value)); ret->count = 1; ret->values = (int*)malloc(sizeof(int)); ret->values[0] = num; return ret; } struct roll_value *new_roll_multi(int count) { struct roll_value *ret = (struct roll_value*)malloc( sizeof(struct roll_value)); ret->count = count; ret->values = (int*)malloc(sizeof(int)*count); memset(ret->values, 0, sizeof(int)*count); return ret; } void free_roll(struct roll_value *v) { free(v->values); free(v); } dicelab-0.7/aclocal.m40000644000175000017500000007674611303206046011543 00000000000000# generated automatically by aclocal 1.10.1 -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2007, 2008 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(AC_AUTOCONF_VERSION, [2.61],, [m4_warning([this file was generated for autoconf 2.61. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically `autoreconf'.])]) # Copyright (C) 2002, 2003, 2005, 2006, 2007 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.10' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.10.1], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AC_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.10.1])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(AC_AUTOCONF_VERSION)]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to # `$srcdir', `$srcdir/..', or `$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is `.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 8 # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ(2.52)dnl ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 9 # There are a few dirty hacks below to avoid letting `AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "GCJ", or "OBJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl ifelse([$1], CC, [depcc="$CC" am_compiler_list=], [$1], CXX, [depcc="$CXX" am_compiler_list=], [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], UPC, [depcc="$UPC" am_compiler_list=], [$1], GCJ, [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf case $depmode in nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; none) break ;; esac # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. if depmode=$depmode \ source=sub/conftest.c object=sub/conftest.${OBJEXT-o} \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c -o sub/conftest.${OBJEXT-o} sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftest.${OBJEXT-o} sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE(dependency-tracking, [ --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. #serial 3 # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [for mf in $CONFIG_FILES; do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each `.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, # 2005, 2006, 2008 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 13 # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.60])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) AM_MISSING_PROG(AUTOCONF, autoconf) AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) AM_MISSING_PROG(AUTOHEADER, autoheader) AM_MISSING_PROG(MAKEINFO, makeinfo) AM_PROG_INSTALL_SH AM_PROG_INSTALL_STRIP AC_REQUIRE([AM_PROG_MKDIR_P])dnl # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES(CC)], [define([AC_PROG_CC], defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES(CXX)], [define([AC_PROG_CXX], defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES(OBJC)], [define([AC_PROG_OBJC], defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl ]) ]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl install_sh=${install_sh-"\$(SHELL) $am_aux_dir/install-sh"} AC_SUBST(install_sh)]) # Copyright (C) 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 3 # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo done .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # We grep out `Entering directory' and `Leaving directory' # messages which can occur if `w' ends up in MAKEFLAGS. # In particular we don't look at `^make:' because GNU make might # be invoked under some other name (usually "gmake"), in which # case it prints its new name instead of `make'. if test "`$am_make -s -f confmf 2> /dev/null | grep -v 'ing directory'`" = "done"; then am__include=include am__quote= _am_result=GNU fi # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf if test "`$am_make -s -f confmf 2> /dev/null`" = "done"; then am__include=.include am__quote="\"" _am_result=BSD fi fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 5 # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it supports --run. # If it does, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing" # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= AC_MSG_WARN([`missing' script is too old or missing]) fi ]) # Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_MKDIR_P # --------------- # Check for `mkdir -p'. AC_DEFUN([AM_PROG_MKDIR_P], [AC_PREREQ([2.60])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, dnl while keeping a definition of mkdir_p for backward compatibility. dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of dnl Makefile.ins that do not define MKDIR_P, so we do our own dnl adjustment using top_builddir (which is defined more often than dnl MKDIR_P). AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl case $mkdir_p in [[\\/$]]* | ?:[[\\/]]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001, 2002, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 3 # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # ------------------------------ # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), 1)]) # _AM_SET_OPTIONS(OPTIONS) # ---------------------------------- # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [AC_FOREACH([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005 # Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 4 # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Just in case sleep 1 echo timestamp > conftest.file # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt $srcdir/configure conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t $srcdir/configure conftest.file` fi rm -f conftest.file if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT(yes)]) # Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor `install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in `make install-strip', and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be `maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004, 2005 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # serial 2 # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of `v7', `ustar', or `pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. AM_MISSING_PROG([AMTAR], [tar]) m4_if([$1], [v7], [am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'], [m4_case([$1], [ustar],, [pax],, [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' _am_tools=${am_cv_prog_tar_$1-$_am_tools} # Do not fold the above two line into one, because Tru64 sh and # Solaris sh will not grok spaces in the rhs of `-'. for _am_tool in $_am_tools do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR dicelab-0.7/configure0000755000175000017500000054101111303206047011571 00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.61 for dicelab 0.7. # # Report bugs to >. # # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, # 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## --------------------- ## ## M4sh Initialization. ## ## --------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac fi # PATH needs CR # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then echo "#! /bin/sh" >conf$$.sh echo "exit 0" >>conf$$.sh chmod +x conf$$.sh if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then PATH_SEPARATOR=';' else PATH_SEPARATOR=: fi rm -f conf$$.sh fi # Support unset when possible. if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then as_unset=unset else as_unset=false fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) as_nl=' ' IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 { (exit 1); exit 1; } fi # Work around bugs in pre-3.0 UWIN ksh. for as_var in ENV MAIL MAILPATH do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. for as_var in \ LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ LC_TELEPHONE LC_TIME do if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then eval $as_var=C; export $as_var else ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var fi done # Required to use basename. if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi # Name of the executable. as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # CDPATH. $as_unset CDPATH if test "x$CONFIG_SHELL" = x; then if (eval ":") 2>/dev/null; then as_have_required=yes else as_have_required=no fi if test $as_have_required = yes && (eval ": (as_func_return () { (exit \$1) } as_func_success () { as_func_return 0 } as_func_failure () { as_func_return 1 } as_func_ret_success () { return 0 } as_func_ret_failure () { return 1 } exitcode=0 if as_func_success; then : else exitcode=1 echo as_func_success failed. fi if as_func_failure; then exitcode=1 echo as_func_failure succeeded. fi if as_func_ret_success; then : else exitcode=1 echo as_func_ret_success failed. fi if as_func_ret_failure; then exitcode=1 echo as_func_ret_failure succeeded. fi if ( set x; as_func_ret_success y && test x = \"\$1\" ); then : else exitcode=1 echo positional parameters were not saved. fi test \$exitcode = 0) || { (exit 1); exit 1; } ( as_lineno_1=\$LINENO as_lineno_2=\$LINENO test \"x\$as_lineno_1\" != \"x\$as_lineno_2\" && test \"x\`expr \$as_lineno_1 + 1\`\" = \"x\$as_lineno_2\") || { (exit 1); exit 1; } ") 2> /dev/null; then : else as_candidate_shells= as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. case $as_dir in /*) for as_base in sh bash ksh sh5; do as_candidate_shells="$as_candidate_shells $as_dir/$as_base" done;; esac done IFS=$as_save_IFS for as_shell in $as_candidate_shells $SHELL; do # Try only shells that exist, to save several forks. if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { ("$as_shell") 2> /dev/null <<\_ASEOF if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac fi : _ASEOF }; then CONFIG_SHELL=$as_shell as_have_required=yes if { "$as_shell" 2> /dev/null <<\_ASEOF if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac fi : (as_func_return () { (exit $1) } as_func_success () { as_func_return 0 } as_func_failure () { as_func_return 1 } as_func_ret_success () { return 0 } as_func_ret_failure () { return 1 } exitcode=0 if as_func_success; then : else exitcode=1 echo as_func_success failed. fi if as_func_failure; then exitcode=1 echo as_func_failure succeeded. fi if as_func_ret_success; then : else exitcode=1 echo as_func_ret_success failed. fi if as_func_ret_failure; then exitcode=1 echo as_func_ret_failure succeeded. fi if ( set x; as_func_ret_success y && test x = "$1" ); then : else exitcode=1 echo positional parameters were not saved. fi test $exitcode = 0) || { (exit 1); exit 1; } ( as_lineno_1=$LINENO as_lineno_2=$LINENO test "x$as_lineno_1" != "x$as_lineno_2" && test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2") || { (exit 1); exit 1; } _ASEOF }; then break fi fi done if test "x$CONFIG_SHELL" != x; then for as_var in BASH_ENV ENV do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var done export CONFIG_SHELL exec "$CONFIG_SHELL" "$as_myself" ${1+"$@"} fi if test $as_have_required = no; then echo This script requires a shell more modern than all the echo shells that I found on your system. Please install a echo modern shell, or manually run the script under such a echo shell if you do have one. { (exit 1); exit 1; } fi fi fi (eval "as_func_return () { (exit \$1) } as_func_success () { as_func_return 0 } as_func_failure () { as_func_return 1 } as_func_ret_success () { return 0 } as_func_ret_failure () { return 1 } exitcode=0 if as_func_success; then : else exitcode=1 echo as_func_success failed. fi if as_func_failure; then exitcode=1 echo as_func_failure succeeded. fi if as_func_ret_success; then : else exitcode=1 echo as_func_ret_success failed. fi if as_func_ret_failure; then exitcode=1 echo as_func_ret_failure succeeded. fi if ( set x; as_func_ret_success y && test x = \"\$1\" ); then : else exitcode=1 echo positional parameters were not saved. fi test \$exitcode = 0") || { echo No shell found that supports shell functions. echo Please tell autoconf@gnu.org about your system, echo including any error possibly output before this echo message } as_lineno_1=$LINENO as_lineno_2=$LINENO test "x$as_lineno_1" != "x$as_lineno_2" && test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2" || { # Create $as_me.lineno as a copy of $as_myself, but with $LINENO # uniformly replaced by the line number. The first 'sed' inserts a # line-number line after each line using $LINENO; the second 'sed' # does the real work. The second script uses 'N' to pair each # line-number line with the line containing $LINENO, and appends # trailing '-' during substitution so that $LINENO is not a special # case at line end. # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the # scripts with optimization help from Paolo Bonzini. Blame Lee # E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2 { (exit 1); exit 1; }; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in -n*) case `echo 'x\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. *) ECHO_C='\c';; esac;; *) ECHO_N='-n';; esac if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir fi echo >conf$$.file if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p=: else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= SHELL=${CONFIG_SHELL-/bin/sh} # Identity of this package. PACKAGE_NAME='dicelab' PACKAGE_TARNAME='dicelab' PACKAGE_VERSION='0.7' PACKAGE_STRING='dicelab 0.7' PACKAGE_BUGREPORT='Robert Lemmen ' # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_subst_vars='SHELL PATH_SEPARATOR PACKAGE_NAME PACKAGE_TARNAME PACKAGE_VERSION PACKAGE_STRING PACKAGE_BUGREPORT exec_prefix prefix program_transform_name bindir sbindir libexecdir datarootdir datadir sysconfdir sharedstatedir localstatedir includedir oldincludedir docdir infodir htmldir dvidir pdfdir psdir libdir localedir mandir DEFS ECHO_C ECHO_N ECHO_T LIBS build_alias host_alias target_alias INSTALL_PROGRAM INSTALL_SCRIPT INSTALL_DATA am__isrc CYGPATH_W PACKAGE VERSION ACLOCAL AUTOCONF AUTOMAKE AUTOHEADER MAKEINFO install_sh STRIP INSTALL_STRIP_PROGRAM mkdir_p AWK SET_MAKE am__leading_dot AMTAR am__tar am__untar CC CFLAGS LDFLAGS CPPFLAGS ac_ct_CC EXEEXT OBJEXT DEPDIR am__include am__quote AMDEP_TRUE AMDEP_FALSE AMDEPBACKSLASH CCDEPMODE am__fastdepCC_TRUE am__fastdepCC_FALSE LEX LEX_OUTPUT_ROOT LEXLIB YACC YFLAGS TREECC CPP GREP EGREP LIBOBJS LTLIBOBJS' ac_subst_files='' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS YACC YFLAGS CPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_feature=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_feature" : ".*[^-._$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid feature name: $ac_feature" >&2 { (exit 1); exit 1; }; } ac_feature=`echo $ac_feature | sed 's/[-.]/_/g'` eval enable_$ac_feature=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_feature=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_feature" : ".*[^-._$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid feature name: $ac_feature" >&2 { (exit 1); exit 1; }; } ac_feature=`echo $ac_feature | sed 's/[-.]/_/g'` eval enable_$ac_feature=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_package=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_package" : ".*[^-._$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid package name: $ac_package" >&2 { (exit 1); exit 1; }; } ac_package=`echo $ac_package | sed 's/[-.]/_/g'` eval with_$ac_package=\$ac_optarg ;; -without-* | --without-*) ac_package=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_package" : ".*[^-._$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid package name: $ac_package" >&2 { (exit 1); exit 1; }; } ac_package=`echo $ac_package | sed 's/[-.]/_/g'` eval with_$ac_package=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) { echo "$as_me: error: unrecognized option: $ac_option Try \`$0 --help' for more information." >&2 { (exit 1); exit 1; }; } ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. expr "x$ac_envvar" : ".*[^_$as_cr_alnum]" >/dev/null && { echo "$as_me: error: invalid variable name: $ac_envvar" >&2 { (exit 1); exit 1; }; } eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option} ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` { echo "$as_me: error: missing argument to $ac_option" >&2 { (exit 1); exit 1; }; } fi # Be sure to have absolute directory names. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 { (exit 1); exit 1; }; } done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. If a cross compiler is detected then cross compile mode will be used." >&2 elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || { echo "$as_me: error: Working directory cannot be determined" >&2 { (exit 1); exit 1; }; } test "X$ac_ls_di" = "X$ac_pwd_ls_di" || { echo "$as_me: error: pwd does not report name of working directory" >&2 { (exit 1); exit 1; }; } # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$0" || $as_expr X"$0" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$0" : 'X\(//\)[^/]' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || echo X"$0" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." { echo "$as_me: error: cannot find sources ($ac_unique_file) in $srcdir" >&2 { (exit 1); exit 1; }; } fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || { echo "$as_me: error: $ac_msg" >&2 { (exit 1); exit 1; }; } pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures dicelab 0.7 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/dicelab] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of dicelab 0.7:";; esac cat <<\_ACEOF Optional Features: --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --disable-dependency-tracking speeds up one-time build --enable-dependency-tracking do not reject slow dependency extractors Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS C/C++/Objective C preprocessor flags, e.g. -I if you have headers in a nonstandard directory YACC The `Yet Another C Compiler' implementation to use. Defaults to the first program found out of: `bison -y', `byacc', `yacc'. YFLAGS The list of arguments that will be passed by default to $YACC. This script will default YFLAGS to the empty string to avoid a default value of `-d' given by some make applications. CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to >. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,/..,g;s,/,,'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF dicelab configure 0.7 generated by GNU Autoconf 2.61 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by dicelab $as_me 0.7, which was generated by GNU Autoconf 2.61. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) ac_configure_args0="$ac_configure_args0 '$ac_arg'" ;; 2) ac_configure_args1="$ac_configure_args1 '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi ac_configure_args="$ac_configure_args '$ac_arg'" ;; esac done done $as_unset ac_configure_args0 || test "${ac_configure_args0+set}" != set || { ac_configure_args0=; export ac_configure_args0; } $as_unset ac_configure_args1 || test "${ac_configure_args1+set}" != set || { ac_configure_args1=; export ac_configure_args1; } # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo cat <<\_ASBOX ## ---------------- ## ## Cache variables. ## ## ---------------- ## _ASBOX echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { echo "$as_me:$LINENO: WARNING: Cache variable $ac_var contains a newline." >&5 echo "$as_me: WARNING: Cache variable $ac_var contains a newline." >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( *) $as_unset $ac_var ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo cat <<\_ASBOX ## ----------------- ## ## Output variables. ## ## ----------------- ## _ASBOX echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then cat <<\_ASBOX ## ------------------- ## ## File substitutions. ## ## ------------------- ## _ASBOX echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then cat <<\_ASBOX ## ----------- ## ## confdefs.h. ## ## ----------- ## _ASBOX echo cat confdefs.h echo fi test "$ac_signal" != 0 && echo "$as_me: caught signal $ac_signal" echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; { (exit 1); exit 1; }' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer explicitly selected file to automatically selected ones. if test -n "$CONFIG_SITE"; then set x "$CONFIG_SITE" elif test "x$prefix" != xNONE; then set x "$prefix/share/config.site" "$prefix/etc/config.site" else set x "$ac_default_prefix/share/config.site" \ "$ac_default_prefix/etc/config.site" fi shift for ac_site_file do if test -r "$ac_site_file"; then { echo "$as_me:$LINENO: loading site script $ac_site_file" >&5 echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special # files actually), so we avoid doing that. if test -f "$cache_file"; then { echo "$as_me:$LINENO: loading cache $cache_file" >&5 echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { echo "$as_me:$LINENO: creating cache $cache_file" >&5 echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { echo "$as_me:$LINENO: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { echo "$as_me:$LINENO: error: \`$ac_var' was not set in the previous run" >&5 echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then { echo "$as_me:$LINENO: error: \`$ac_var' has changed since the previous run:" >&5 echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} { echo "$as_me:$LINENO: former value: $ac_old_val" >&5 echo "$as_me: former value: $ac_old_val" >&2;} { echo "$as_me:$LINENO: current value: $ac_new_val" >&5 echo "$as_me: current value: $ac_new_val" >&2;} ac_cache_corrupted=: fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) ac_configure_args="$ac_configure_args '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { echo "$as_me:$LINENO: error: changes in the environment can compromise the build" >&5 echo "$as_me: error: changes in the environment can compromise the build" >&2;} { { echo "$as_me:$LINENO: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&5 echo "$as_me: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&2;} { (exit 1); exit 1; }; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu am__api_version='1.10' ac_aux_dir= for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then { { echo "$as_me:$LINENO: error: cannot find install-sh or install.sh in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" >&5 echo "$as_me: error: cannot find install-sh or install.sh in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" >&2;} { (exit 1); exit 1; }; } fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. { echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5 echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6; } if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in ./ | .// | /cC/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:\\/os2\\/install\\/* | ?:\\/OS2\\/INSTALL\\/* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi done done ;; esac done IFS=$as_save_IFS fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { echo "$as_me:$LINENO: result: $INSTALL" >&5 echo "${ECHO_T}$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { echo "$as_me:$LINENO: checking whether build environment is sane" >&5 echo $ECHO_N "checking whether build environment is sane... $ECHO_C" >&6; } # Just in case sleep 1 echo timestamp > conftest.file # Do `set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( set X `ls -Lt $srcdir/configure conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t $srcdir/configure conftest.file` fi rm -f conftest.file if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". { { echo "$as_me:$LINENO: error: ls -t appears to fail. Make sure there is not a broken alias in your environment" >&5 echo "$as_me: error: ls -t appears to fail. Make sure there is not a broken alias in your environment" >&2;} { (exit 1); exit 1; }; } fi test "$2" = conftest.file ) then # Ok. : else { { echo "$as_me:$LINENO: error: newly created file is older than distributed files! Check your system clock" >&5 echo "$as_me: error: newly created file is older than distributed files! Check your system clock" >&2;} { (exit 1); exit 1; }; } fi { echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6; } test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. echo might interpret backslashes. # By default was `s,x,x', remove it if useless. cat <<\_ACEOF >conftest.sed s/[\\$]/&&/g;s/;s,x,x,$// _ACEOF program_transform_name=`echo $program_transform_name | sed -f conftest.sed` rm -f conftest.sed # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing" # Use eval to expand $SHELL if eval "$MISSING --run true"; then am_missing_run="$MISSING --run " else am_missing_run= { echo "$as_me:$LINENO: WARNING: \`missing' script is too old or missing" >&5 echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;} fi { echo "$as_me:$LINENO: checking for a thread-safe mkdir -p" >&5 echo $ECHO_N "checking for a thread-safe mkdir -p... $ECHO_C" >&6; } if test -z "$MKDIR_P"; then if test "${ac_cv_path_mkdir+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. test -d ./--version && rmdir ./--version MKDIR_P="$ac_install_sh -d" fi fi { echo "$as_me:$LINENO: result: $MKDIR_P" >&5 echo "${ECHO_T}$MKDIR_P" >&6; } mkdir_p="$MKDIR_P" case $mkdir_p in [\\/$]* | ?:[\\/]*) ;; */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; esac for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_AWK+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_AWK="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { echo "$as_me:$LINENO: result: $AWK" >&5 echo "${ECHO_T}$AWK" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi test -n "$AWK" && break done { echo "$as_me:$LINENO: checking whether ${MAKE-make} sets \$(MAKE)" >&5 echo $ECHO_N "checking whether ${MAKE-make} sets \$(MAKE)... $ECHO_C" >&6; } set x ${MAKE-make}; ac_make=`echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if { as_var=ac_cv_prog_make_${ac_make}_set; eval "test \"\${$as_var+set}\" = set"; }; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6; } SET_MAKE= else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then { { echo "$as_me:$LINENO: error: source directory already configured; run \"make distclean\" there first" >&5 echo "$as_me: error: source directory already configured; run \"make distclean\" there first" >&2;} { (exit 1); exit 1; }; } fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE=dicelab VERSION=0.7 # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} install_sh=${install_sh-"\$(SHELL) $am_aux_dir/install-sh"} # Installed binaries are usually stripped using `strip' when the user # run `make install-strip'. However `strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the `STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { echo "$as_me:$LINENO: result: $STRIP" >&5 echo "${ECHO_T}$STRIP" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_STRIP="strip" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5 echo "${ECHO_T}$ac_ct_STRIP" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&5 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. AMTAR=${AMTAR-"${am_missing_run}tar"} am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -' ac_config_headers="$ac_config_headers config.h" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}gcc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="gcc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 echo "${ECHO_T}$ac_ct_CC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&5 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="${ac_tool_prefix}cc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { echo "$as_me:$LINENO: result: $CC" >&5 echo "${ECHO_T}$CC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_ac_ct_CC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_CC="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 echo "${ECHO_T}$ac_ct_CC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&5 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { echo "$as_me:$LINENO: error: no acceptable C compiler found in \$PATH See \`config.log' for more details." >&5 echo "$as_me: error: no acceptable C compiler found in \$PATH See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } # Provide some information about the compiler. echo "$as_me:$LINENO: checking for C compiler version" >&5 ac_compiler=`set X $ac_compile; echo $2` { (ac_try="$ac_compiler --version >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compiler --version >&5") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (ac_try="$ac_compiler -v >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compiler -v >&5") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { (ac_try="$ac_compiler -V >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compiler -V >&5") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { echo "$as_me:$LINENO: checking for C compiler default output file name" >&5 echo $ECHO_N "checking for C compiler default output file name... $ECHO_C" >&6; } ac_link_default=`echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # # List of possible output files, starting from the most likely. # The algorithm is not robust to junk in `.', hence go to wildcards (a.*) # only as a last resort. b.out is created by i960 compilers. ac_files='a_out.exe a.exe conftest.exe a.out conftest a.* conftest.* b.out' # # The IRIX 6 linker writes into existing files which may not be # executable, retaining their permissions. Remove them first so a # subsequent execution test works. ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { (ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link_default") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi { echo "$as_me:$LINENO: result: $ac_file" >&5 echo "${ECHO_T}$ac_file" >&6; } if test -z "$ac_file"; then echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { echo "$as_me:$LINENO: error: C compiler cannot create executables See \`config.log' for more details." >&5 echo "$as_me: error: C compiler cannot create executables See \`config.log' for more details." >&2;} { (exit 77); exit 77; }; } fi ac_exeext=$ac_cv_exeext # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { echo "$as_me:$LINENO: checking whether the C compiler works" >&5 echo $ECHO_N "checking whether the C compiler works... $ECHO_C" >&6; } # FIXME: These cross compiler hacks should be removed for Autoconf 3.0 # If not cross compiling, check that we can run a simple program. if test "$cross_compiling" != yes; then if { ac_try='./$ac_file' { (case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_try") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { echo "$as_me:$LINENO: error: cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." >&5 echo "$as_me: error: cannot run C compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi fi fi { echo "$as_me:$LINENO: result: yes" >&5 echo "${ECHO_T}yes" >&6; } rm -f a.out a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { echo "$as_me:$LINENO: checking whether we are cross compiling" >&5 echo $ECHO_N "checking whether we are cross compiling... $ECHO_C" >&6; } { echo "$as_me:$LINENO: result: $cross_compiling" >&5 echo "${ECHO_T}$cross_compiling" >&6; } { echo "$as_me:$LINENO: checking for suffix of executables" >&5 echo $ECHO_N "checking for suffix of executables... $ECHO_C" >&6; } if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { echo "$as_me:$LINENO: error: cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." >&5 echo "$as_me: error: cannot compute suffix of executables: cannot compile and link See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi rm -f conftest$ac_cv_exeext { echo "$as_me:$LINENO: result: $ac_cv_exeext" >&5 echo "${ECHO_T}$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT { echo "$as_me:$LINENO: checking for suffix of object files" >&5 echo $ECHO_N "checking for suffix of object files... $ECHO_C" >&6; } if test "${ac_cv_objext+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; then for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { echo "$as_me:$LINENO: error: cannot compute suffix of object files: cannot compile See \`config.log' for more details." >&5 echo "$as_me: error: cannot compute suffix of object files: cannot compile See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { echo "$as_me:$LINENO: result: $ac_cv_objext" >&5 echo "${ECHO_T}$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { echo "$as_me:$LINENO: checking whether we are using the GNU C compiler" >&5 echo $ECHO_N "checking whether we are using the GNU C compiler... $ECHO_C" >&6; } if test "${ac_cv_c_compiler_gnu+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_compiler_gnu=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { echo "$as_me:$LINENO: result: $ac_cv_c_compiler_gnu" >&5 echo "${ECHO_T}$ac_cv_c_compiler_gnu" >&6; } GCC=`test $ac_compiler_gnu = yes && echo yes` ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { echo "$as_me:$LINENO: checking whether $CC accepts -g" >&5 echo $ECHO_N "checking whether $CC accepts -g... $ECHO_C" >&6; } if test "${ac_cv_prog_cc_g+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_cv_prog_cc_g=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 CFLAGS="" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_cv_prog_cc_g=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { echo "$as_me:$LINENO: result: $ac_cv_prog_cc_g" >&5 echo "${ECHO_T}$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { echo "$as_me:$LINENO: checking for $CC option to accept ISO C89" >&5 echo $ECHO_N "checking for $CC option to accept ISO C89... $ECHO_C" >&6; } if test "${ac_cv_prog_cc_c89+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #include #include /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_cv_prog_cc_c89=$ac_arg else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { echo "$as_me:$LINENO: result: none needed" >&5 echo "${ECHO_T}none needed" >&6; } ;; xno) { echo "$as_me:$LINENO: result: unsupported" >&5 echo "${ECHO_T}unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { echo "$as_me:$LINENO: result: $ac_cv_prog_cc_c89" >&5 echo "${ECHO_T}$ac_cv_prog_cc_c89" >&6; } ;; esac ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo done .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { echo "$as_me:$LINENO: checking for style of include used by $am_make" >&5 echo $ECHO_N "checking for style of include used by $am_make... $ECHO_C" >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # We grep out `Entering directory' and `Leaving directory' # messages which can occur if `w' ends up in MAKEFLAGS. # In particular we don't look at `^make:' because GNU make might # be invoked under some other name (usually "gmake"), in which # case it prints its new name instead of `make'. if test "`$am_make -s -f confmf 2> /dev/null | grep -v 'ing directory'`" = "done"; then am__include=include am__quote= _am_result=GNU fi # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf if test "`$am_make -s -f confmf 2> /dev/null`" = "done"; then am__include=.include am__quote="\"" _am_result=BSD fi fi { echo "$as_me:$LINENO: result: $_am_result" >&5 echo "${ECHO_T}$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CC" am_compiler_list= { echo "$as_me:$LINENO: checking dependency style of $depcc" >&5 echo $ECHO_N "checking dependency style of $depcc... $ECHO_C" >&6; } if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named `D' -- because `-MD' means `put the output # in D'. mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with # Solaris 8's {/usr,}/bin/sh. touch sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf case $depmode in nosideeffect) # after this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; none) break ;; esac # We check with `-c' and `-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle `-M -o', and we need to detect this. if depmode=$depmode \ source=sub/conftest.c object=sub/conftest.${OBJEXT-o} \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c -o sub/conftest.${OBJEXT-o} sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftest.${OBJEXT-o} sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { echo "$as_me:$LINENO: result: $am_cv_CC_dependencies_compiler_type" >&5 echo "${ECHO_T}$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. { echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5 echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6; } if test -z "$INSTALL"; then if test "${ac_cv_path_install+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in ./ | .// | /cC/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:\\/os2\\/install\\/* | ?:\\/OS2\\/INSTALL\\/* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi done done ;; esac done IFS=$as_save_IFS fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { echo "$as_me:$LINENO: result: $INSTALL" >&5 echo "${ECHO_T}$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' for ac_prog in flex lex do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_LEX+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$LEX"; then ac_cv_prog_LEX="$LEX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_LEX="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LEX=$ac_cv_prog_LEX if test -n "$LEX"; then { echo "$as_me:$LINENO: result: $LEX" >&5 echo "${ECHO_T}$LEX" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi test -n "$LEX" && break done test -n "$LEX" || LEX=":" if test "x$LEX" != "x:"; then cat >conftest.l <<_ACEOF %% a { ECHO; } b { REJECT; } c { yymore (); } d { yyless (1); } e { yyless (input () != 0); } f { unput (yytext[0]); } . { BEGIN INITIAL; } %% #ifdef YYTEXT_POINTER extern char *yytext; #endif int main (void) { return ! yylex () + ! yywrap (); } _ACEOF { (ac_try="$LEX conftest.l" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$LEX conftest.l") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { echo "$as_me:$LINENO: checking lex output file root" >&5 echo $ECHO_N "checking lex output file root... $ECHO_C" >&6; } if test "${ac_cv_prog_lex_root+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -f lex.yy.c; then ac_cv_prog_lex_root=lex.yy elif test -f lexyy.c; then ac_cv_prog_lex_root=lexyy else { { echo "$as_me:$LINENO: error: cannot find output from $LEX; giving up" >&5 echo "$as_me: error: cannot find output from $LEX; giving up" >&2;} { (exit 1); exit 1; }; } fi fi { echo "$as_me:$LINENO: result: $ac_cv_prog_lex_root" >&5 echo "${ECHO_T}$ac_cv_prog_lex_root" >&6; } LEX_OUTPUT_ROOT=$ac_cv_prog_lex_root if test -z "${LEXLIB+set}"; then { echo "$as_me:$LINENO: checking lex library" >&5 echo $ECHO_N "checking lex library... $ECHO_C" >&6; } if test "${ac_cv_lib_lex+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_save_LIBS=$LIBS ac_cv_lib_lex='none needed' for ac_lib in '' -lfl -ll; do LIBS="$ac_lib $ac_save_LIBS" cat >conftest.$ac_ext <<_ACEOF `cat $LEX_OUTPUT_ROOT.c` _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && $as_test_x conftest$ac_exeext; then ac_cv_lib_lex=$ac_lib else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \ conftest$ac_exeext conftest.$ac_ext test "$ac_cv_lib_lex" != 'none needed' && break done LIBS=$ac_save_LIBS fi { echo "$as_me:$LINENO: result: $ac_cv_lib_lex" >&5 echo "${ECHO_T}$ac_cv_lib_lex" >&6; } test "$ac_cv_lib_lex" != 'none needed' && LEXLIB=$ac_cv_lib_lex fi { echo "$as_me:$LINENO: checking whether yytext is a pointer" >&5 echo $ECHO_N "checking whether yytext is a pointer... $ECHO_C" >&6; } if test "${ac_cv_prog_lex_yytext_pointer+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # POSIX says lex can declare yytext either as a pointer or an array; the # default is implementation-dependent. Figure out which it is, since # not all implementations provide the %pointer and %array declarations. ac_cv_prog_lex_yytext_pointer=no ac_save_LIBS=$LIBS LIBS="$LEXLIB $ac_save_LIBS" cat >conftest.$ac_ext <<_ACEOF #define YYTEXT_POINTER 1 `cat $LEX_OUTPUT_ROOT.c` _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && $as_test_x conftest$ac_exeext; then ac_cv_prog_lex_yytext_pointer=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 fi rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_save_LIBS fi { echo "$as_me:$LINENO: result: $ac_cv_prog_lex_yytext_pointer" >&5 echo "${ECHO_T}$ac_cv_prog_lex_yytext_pointer" >&6; } if test $ac_cv_prog_lex_yytext_pointer = yes; then cat >>confdefs.h <<\_ACEOF #define YYTEXT_POINTER 1 _ACEOF fi rm -f conftest.l $LEX_OUTPUT_ROOT.c fi for ac_prog in 'bison -y' byacc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_YACC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$YACC"; then ac_cv_prog_YACC="$YACC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_YACC="$ac_prog" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi YACC=$ac_cv_prog_YACC if test -n "$YACC"; then { echo "$as_me:$LINENO: result: $YACC" >&5 echo "${ECHO_T}$YACC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi test -n "$YACC" && break done test -n "$YACC" || YACC="yacc" if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}treecc", so it can be a program name with args. set dummy ${ac_tool_prefix}treecc; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_TREECC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$TREECC"; then ac_cv_prog_TREECC="$TREECC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_TREECC="${ac_tool_prefix}treecc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi TREECC=$ac_cv_prog_TREECC if test -n "$TREECC"; then { echo "$as_me:$LINENO: result: $TREECC" >&5 echo "${ECHO_T}$TREECC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi fi if test -z "$ac_cv_prog_TREECC"; then ac_ct_TREECC=$TREECC # Extract the first word of "treecc", so it can be a program name with args. set dummy treecc; ac_word=$2 { echo "$as_me:$LINENO: checking for $ac_word" >&5 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; } if test "${ac_cv_prog_ac_ct_TREECC+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test -n "$ac_ct_TREECC"; then ac_cv_prog_ac_ct_TREECC="$ac_ct_TREECC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then ac_cv_prog_ac_ct_TREECC="treecc" echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_TREECC=$ac_cv_prog_ac_ct_TREECC if test -n "$ac_ct_TREECC"; then { echo "$as_me:$LINENO: result: $ac_ct_TREECC" >&5 echo "${ECHO_T}$ac_ct_TREECC" >&6; } else { echo "$as_me:$LINENO: result: no" >&5 echo "${ECHO_T}no" >&6; } fi if test "x$ac_ct_TREECC" = x; then TREECC="" else case $cross_compiling:$ac_tool_warned in yes:) { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&5 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools whose name does not start with the host triplet. If you think this configuration is useful to you, please write to autoconf@gnu.org." >&2;} ac_tool_warned=yes ;; esac TREECC=$ac_ct_TREECC fi else TREECC="$ac_cv_prog_TREECC" fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { echo "$as_me:$LINENO: checking how to run the C preprocessor" >&5 echo $ECHO_N "checking how to run the C preprocessor... $ECHO_C" >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if test "${ac_cv_prog_CPP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { echo "$as_me:$LINENO: result: $CPP" >&5 echo "${ECHO_T}$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if { (ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Broken: fails on valid input. continue fi rm -f conftest.err conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if { (ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then # Broken: success on invalid input. continue else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { echo "$as_me:$LINENO: error: C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." >&5 echo "$as_me: error: C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details." >&2;} { (exit 1); exit 1; }; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { echo "$as_me:$LINENO: checking for grep that handles long lines and -e" >&5 echo $ECHO_N "checking for grep that handles long lines and -e... $ECHO_C" >&6; } if test "${ac_cv_path_GREP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else # Extract the first word of "grep ggrep" to use in msg output if test -z "$GREP"; then set dummy grep ggrep; ac_prog_name=$2 if test "${ac_cv_path_GREP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break ac_count=`expr $ac_count + 1` if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS fi GREP="$ac_cv_path_GREP" if test -z "$GREP"; then { { echo "$as_me:$LINENO: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&5 echo "$as_me: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&2;} { (exit 1); exit 1; }; } fi else ac_cv_path_GREP=$GREP fi fi { echo "$as_me:$LINENO: result: $ac_cv_path_GREP" >&5 echo "${ECHO_T}$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { echo "$as_me:$LINENO: checking for egrep" >&5 echo $ECHO_N "checking for egrep... $ECHO_C" >&6; } if test "${ac_cv_path_EGREP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else # Extract the first word of "egrep" to use in msg output if test -z "$EGREP"; then set dummy egrep; ac_prog_name=$2 if test "${ac_cv_path_EGREP+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break ac_count=`expr $ac_count + 1` if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS fi EGREP="$ac_cv_path_EGREP" if test -z "$EGREP"; then { { echo "$as_me:$LINENO: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&5 echo "$as_me: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&2;} { (exit 1); exit 1; }; } fi else ac_cv_path_EGREP=$EGREP fi fi fi { echo "$as_me:$LINENO: result: $ac_cv_path_EGREP" >&5 echo "${ECHO_T}$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { echo "$as_me:$LINENO: checking for ANSI C header files" >&5 echo $ECHO_N "checking for ANSI C header files... $ECHO_C" >&6; } if test "${ac_cv_header_stdc+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_cv_header_stdc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF rm -f conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='./conftest$ac_exeext' { (case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_try") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then : else echo "$as_me: program exited with status $ac_status" >&5 echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ( exit $ac_status ) ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext fi fi fi { echo "$as_me:$LINENO: result: $ac_cv_header_stdc" >&5 echo "${ECHO_T}$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then cat >>confdefs.h <<\_ACEOF #define STDC_HEADERS 1 _ACEOF fi { echo "$as_me:$LINENO: checking for pow in -lm" >&5 echo $ECHO_N "checking for pow in -lm... $ECHO_C" >&6; } if test "${ac_cv_lib_m_pow+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lm $LIBS" cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char pow (); int main () { return pow (); ; return 0; } _ACEOF rm -f conftest.$ac_objext conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && $as_test_x conftest$ac_exeext; then ac_cv_lib_m_pow=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_cv_lib_m_pow=no fi rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { echo "$as_me:$LINENO: result: $ac_cv_lib_m_pow" >&5 echo "${ECHO_T}$ac_cv_lib_m_pow" >&6; } if test $ac_cv_lib_m_pow = yes; then cat >>confdefs.h <<_ACEOF #define HAVE_LIBM 1 _ACEOF LIBS="-lm $LIBS" fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` { echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; } if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then echo $ECHO_N "(cached) $ECHO_C" >&6 else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then eval "$as_ac_Header=yes" else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 eval "$as_ac_Header=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi ac_res=`eval echo '${'$as_ac_Header'}'` { echo "$as_me:$LINENO: result: $ac_res" >&5 echo "${ECHO_T}$ac_res" >&6; } if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in stdlib.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then { echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; } if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then echo $ECHO_N "(cached) $ECHO_C" >&6 fi ac_res=`eval echo '${'$as_ac_Header'}'` { echo "$as_me:$LINENO: result: $ac_res" >&5 echo "${ECHO_T}$ac_res" >&6; } else # Is the header compilable? { echo "$as_me:$LINENO: checking $ac_header usability" >&5 echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6; } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_header_compiler=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 echo "${ECHO_T}$ac_header_compiler" >&6; } # Is the header present? { echo "$as_me:$LINENO: checking $ac_header presence" >&5 echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6; } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include <$ac_header> _ACEOF if { (ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then ac_header_preproc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_preproc=no fi rm -f conftest.err conftest.$ac_ext { echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 echo "${ECHO_T}$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in yes:no: ) { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;} ac_header_preproc=yes ;; no:yes:* ) { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5 echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5 echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5 echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;} ( cat <<\_ASBOX ## ------------------------------------------------------ ## ## Report this to Robert Lemmen ## ## ------------------------------------------------------ ## _ASBOX ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac { echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; } if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then echo $ECHO_N "(cached) $ECHO_C" >&6 else eval "$as_ac_Header=\$ac_header_preproc" fi ac_res=`eval echo '${'$as_ac_Header'}'` { echo "$as_me:$LINENO: result: $ac_res" >&5 echo "${ECHO_T}$ac_res" >&6; } fi if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done { echo "$as_me:$LINENO: checking for GNU libc compatible malloc" >&5 echo $ECHO_N "checking for GNU libc compatible malloc... $ECHO_C" >&6; } if test "${ac_cv_func_malloc_0_nonnull+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test "$cross_compiling" = yes; then ac_cv_func_malloc_0_nonnull=no else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #if defined STDC_HEADERS || defined HAVE_STDLIB_H # include #else char *malloc (); #endif int main () { return ! malloc (0); ; return 0; } _ACEOF rm -f conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='./conftest$ac_exeext' { (case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_try") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_malloc_0_nonnull=yes else echo "$as_me: program exited with status $ac_status" >&5 echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ( exit $ac_status ) ac_cv_func_malloc_0_nonnull=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext fi fi { echo "$as_me:$LINENO: result: $ac_cv_func_malloc_0_nonnull" >&5 echo "${ECHO_T}$ac_cv_func_malloc_0_nonnull" >&6; } if test $ac_cv_func_malloc_0_nonnull = yes; then cat >>confdefs.h <<\_ACEOF #define HAVE_MALLOC 1 _ACEOF else cat >>confdefs.h <<\_ACEOF #define HAVE_MALLOC 0 _ACEOF case " $LIBOBJS " in *" malloc.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS malloc.$ac_objext" ;; esac cat >>confdefs.h <<\_ACEOF #define malloc rpl_malloc _ACEOF fi for ac_header in stdlib.h do as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then { echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; } if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then echo $ECHO_N "(cached) $ECHO_C" >&6 fi ac_res=`eval echo '${'$as_ac_Header'}'` { echo "$as_me:$LINENO: result: $ac_res" >&5 echo "${ECHO_T}$ac_res" >&6; } else # Is the header compilable? { echo "$as_me:$LINENO: checking $ac_header usability" >&5 echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6; } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default #include <$ac_header> _ACEOF rm -f conftest.$ac_objext if { (ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_compile") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then ac_header_compiler=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 echo "${ECHO_T}$ac_header_compiler" >&6; } # Is the header present? { echo "$as_me:$LINENO: checking $ac_header presence" >&5 echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6; } cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #include <$ac_header> _ACEOF if { (ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1 ac_status=$? grep -v '^ *+' conftest.er1 >conftest.err rm -f conftest.er1 cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } >/dev/null && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then ac_header_preproc=yes else echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_header_preproc=no fi rm -f conftest.err conftest.$ac_ext { echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 echo "${ECHO_T}$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in yes:no: ) { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;} ac_header_preproc=yes ;; no:yes:* ) { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5 echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5 echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5 echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;} ( cat <<\_ASBOX ## ------------------------------------------------------ ## ## Report this to Robert Lemmen ## ## ------------------------------------------------------ ## _ASBOX ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac { echo "$as_me:$LINENO: checking for $ac_header" >&5 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; } if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then echo $ECHO_N "(cached) $ECHO_C" >&6 else eval "$as_ac_Header=\$ac_header_preproc" fi ac_res=`eval echo '${'$as_ac_Header'}'` { echo "$as_me:$LINENO: result: $ac_res" >&5 echo "${ECHO_T}$ac_res" >&6; } fi if test `eval echo '${'$as_ac_Header'}'` = yes; then cat >>confdefs.h <<_ACEOF #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done { echo "$as_me:$LINENO: checking for GNU libc compatible realloc" >&5 echo $ECHO_N "checking for GNU libc compatible realloc... $ECHO_C" >&6; } if test "${ac_cv_func_realloc_0_nonnull+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test "$cross_compiling" = yes; then ac_cv_func_realloc_0_nonnull=no else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ #if defined STDC_HEADERS || defined HAVE_STDLIB_H # include #else char *realloc (); #endif int main () { return ! realloc (0, 0); ; return 0; } _ACEOF rm -f conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='./conftest$ac_exeext' { (case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_try") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_realloc_0_nonnull=yes else echo "$as_me: program exited with status $ac_status" >&5 echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ( exit $ac_status ) ac_cv_func_realloc_0_nonnull=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext fi fi { echo "$as_me:$LINENO: result: $ac_cv_func_realloc_0_nonnull" >&5 echo "${ECHO_T}$ac_cv_func_realloc_0_nonnull" >&6; } if test $ac_cv_func_realloc_0_nonnull = yes; then cat >>confdefs.h <<\_ACEOF #define HAVE_REALLOC 1 _ACEOF else cat >>confdefs.h <<\_ACEOF #define HAVE_REALLOC 0 _ACEOF case " $LIBOBJS " in *" realloc.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS realloc.$ac_objext" ;; esac cat >>confdefs.h <<\_ACEOF #define realloc rpl_realloc _ACEOF fi { echo "$as_me:$LINENO: checking for working memcmp" >&5 echo $ECHO_N "checking for working memcmp... $ECHO_C" >&6; } if test "${ac_cv_func_memcmp_working+set}" = set; then echo $ECHO_N "(cached) $ECHO_C" >&6 else if test "$cross_compiling" = yes; then ac_cv_func_memcmp_working=no else cat >conftest.$ac_ext <<_ACEOF /* confdefs.h. */ _ACEOF cat confdefs.h >>conftest.$ac_ext cat >>conftest.$ac_ext <<_ACEOF /* end confdefs.h. */ $ac_includes_default int main () { /* Some versions of memcmp are not 8-bit clean. */ char c0 = '\100', c1 = '\200', c2 = '\201'; if (memcmp(&c0, &c2, 1) >= 0 || memcmp(&c1, &c2, 1) >= 0) return 1; /* The Next x86 OpenStep bug shows up only when comparing 16 bytes or more and with at least one buffer not starting on a 4-byte boundary. William Lewis provided this test program. */ { char foo[21]; char bar[21]; int i; for (i = 0; i < 4; i++) { char *a = foo + i; char *b = bar + i; strcpy (a, "--------01111111"); strcpy (b, "--------10000000"); if (memcmp (a, b, 16) >= 0) return 1; } return 0; } ; return 0; } _ACEOF rm -f conftest$ac_exeext if { (ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_link") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && { ac_try='./conftest$ac_exeext' { (case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5 (eval "$ac_try") 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); }; }; then ac_cv_func_memcmp_working=yes else echo "$as_me: program exited with status $ac_status" >&5 echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ( exit $ac_status ) ac_cv_func_memcmp_working=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext fi fi { echo "$as_me:$LINENO: result: $ac_cv_func_memcmp_working" >&5 echo "${ECHO_T}$ac_cv_func_memcmp_working" >&6; } test $ac_cv_func_memcmp_working = no && case " $LIBOBJS " in *" memcmp.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS memcmp.$ac_objext" ;; esac ac_config_files="$ac_config_files Makefile" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { echo "$as_me:$LINENO: WARNING: Cache variable $ac_var contains a newline." >&5 echo "$as_me: WARNING: Cache variable $ac_var contains a newline." >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( *) $as_unset $ac_var ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes (double-quote # substitution turns \\\\ into \\, and sed turns \\ into \). sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then test "x$cache_file" != "x/dev/null" && { echo "$as_me:$LINENO: updating cache $cache_file" >&5 echo "$as_me: updating cache $cache_file" >&6;} cat confcache >$cache_file else { echo "$as_me:$LINENO: not updating unwritable cache $cache_file" >&5 echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. ac_libobjs="$ac_libobjs \${LIBOBJDIR}$ac_i\$U.$ac_objext" ac_ltlibobjs="$ac_ltlibobjs \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then { { echo "$as_me:$LINENO: error: conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." >&5 echo "$as_me: error: conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." >&2;} { (exit 1); exit 1; }; } fi : ${CONFIG_STATUS=./config.status} ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { echo "$as_me:$LINENO: creating $CONFIG_STATUS" >&5 echo "$as_me: creating $CONFIG_STATUS" >&6;} cat >$CONFIG_STATUS <<_ACEOF #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF ## --------------------- ## ## M4sh Initialization. ## ## --------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix ;; esac fi # PATH needs CR # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then echo "#! /bin/sh" >conf$$.sh echo "exit 0" >>conf$$.sh chmod +x conf$$.sh if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then PATH_SEPARATOR=';' else PATH_SEPARATOR=: fi rm -f conf$$.sh fi # Support unset when possible. if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then as_unset=unset else as_unset=false fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) as_nl=' ' IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. case $0 in *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 { (exit 1); exit 1; } fi # Work around bugs in pre-3.0 UWIN ksh. for as_var in ENV MAIL MAILPATH do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. for as_var in \ LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ LC_TELEPHONE LC_TIME do if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then eval $as_var=C; export $as_var else ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var fi done # Required to use basename. if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi # Name of the executable. as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # CDPATH. $as_unset CDPATH as_lineno_1=$LINENO as_lineno_2=$LINENO test "x$as_lineno_1" != "x$as_lineno_2" && test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2" || { # Create $as_me.lineno as a copy of $as_myself, but with $LINENO # uniformly replaced by the line number. The first 'sed' inserts a # line-number line after each line using $LINENO; the second 'sed' # does the real work. The second script uses 'N' to pair each # line-number line with the line containing $LINENO, and appends # trailing '-' during substitution so that $LINENO is not a special # case at line end. # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the # scripts with optimization help from Paolo Bonzini. Blame Lee # E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2 { (exit 1); exit 1; }; } # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in -n*) case `echo 'x\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. *) ECHO_C='\c';; esac;; *) ECHO_N='-n';; esac if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir fi echo >conf$$.file if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -p'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -p' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -p' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p=: else test -d ./-p && rmdir ./-p as_mkdir_p=false fi if test -x / >/dev/null 2>&1; then as_test_x='test -x' else if ls -dL / >/dev/null 2>&1; then as_ls_L_option=L else as_ls_L_option= fi as_test_x=' eval sh -c '\'' if test -d "$1"; then test -d "$1/."; else case $1 in -*)set "./$1";; esac; case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in ???[sx]*):;;*)false;;esac;fi '\'' sh ' fi as_executable_p=$as_test_x # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 # Save the log message, to keep $[0] and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by dicelab $as_me 0.7, which was generated by GNU Autoconf 2.61. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF cat >>$CONFIG_STATUS <<_ACEOF # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF ac_cs_usage="\ \`$as_me' instantiates files from templates according to the current configuration. Usage: $0 [OPTIONS] [FILE]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF ac_cs_version="\\ dicelab config.status 0.7 configured by $0, generated by GNU Autoconf 2.61, with options \\"`echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`\\" Copyright (C) 2006 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # If no file are specified by the user, then we need to provide default # value. By we need to know if files were specified by the user. ac_need_defaults=: while test $# != 0 do case $1 in --*=*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) echo "$ac_cs_version"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift CONFIG_FILES="$CONFIG_FILES $ac_optarg" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift CONFIG_HEADERS="$CONFIG_HEADERS $ac_optarg" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header { echo "$as_me: error: ambiguous option: $1 Try \`$0 --help' for more information." >&2 { (exit 1); exit 1; }; };; --help | --hel | -h ) echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) { echo "$as_me: error: unrecognized option: $1 Try \`$0 --help' for more information." >&2 { (exit 1); exit 1; }; } ;; *) ac_config_targets="$ac_config_targets $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF if \$ac_cs_recheck; then echo "running CONFIG_SHELL=$SHELL $SHELL $0 "$ac_configure_args \$ac_configure_extra_args " --no-create --no-recursion" >&6 CONFIG_SHELL=$SHELL export CONFIG_SHELL exec $SHELL "$0"$ac_configure_args \$ac_configure_extra_args --no-create --no-recursion fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "config.h") CONFIG_HEADERS="$CONFIG_HEADERS config.h" ;; "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; *) { { echo "$as_me:$LINENO: error: invalid argument: $ac_config_target" >&5 echo "$as_me: error: invalid argument: $ac_config_target" >&2;} { (exit 1); exit 1; }; };; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= trap 'exit_status=$? { test -z "$tmp" || test ! -d "$tmp" || rm -fr "$tmp"; } && exit $exit_status ' 0 trap '{ (exit 1); exit 1; }' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || { echo "$me: cannot create a temporary directory in ." >&2 { (exit 1); exit 1; } } # # Set up the sed scripts for CONFIG_FILES section. # # No need to generate the scripts if there are no CONFIG_FILES. # This happens for instance when ./config.status config.h if test -n "$CONFIG_FILES"; then _ACEOF ac_delim='%!_!# ' for ac_last_try in false false false false false :; do cat >conf$$subs.sed <<_ACEOF SHELL!$SHELL$ac_delim PATH_SEPARATOR!$PATH_SEPARATOR$ac_delim PACKAGE_NAME!$PACKAGE_NAME$ac_delim PACKAGE_TARNAME!$PACKAGE_TARNAME$ac_delim PACKAGE_VERSION!$PACKAGE_VERSION$ac_delim PACKAGE_STRING!$PACKAGE_STRING$ac_delim PACKAGE_BUGREPORT!$PACKAGE_BUGREPORT$ac_delim exec_prefix!$exec_prefix$ac_delim prefix!$prefix$ac_delim program_transform_name!$program_transform_name$ac_delim bindir!$bindir$ac_delim sbindir!$sbindir$ac_delim libexecdir!$libexecdir$ac_delim datarootdir!$datarootdir$ac_delim datadir!$datadir$ac_delim sysconfdir!$sysconfdir$ac_delim sharedstatedir!$sharedstatedir$ac_delim localstatedir!$localstatedir$ac_delim includedir!$includedir$ac_delim oldincludedir!$oldincludedir$ac_delim docdir!$docdir$ac_delim infodir!$infodir$ac_delim htmldir!$htmldir$ac_delim dvidir!$dvidir$ac_delim pdfdir!$pdfdir$ac_delim psdir!$psdir$ac_delim libdir!$libdir$ac_delim localedir!$localedir$ac_delim mandir!$mandir$ac_delim DEFS!$DEFS$ac_delim ECHO_C!$ECHO_C$ac_delim ECHO_N!$ECHO_N$ac_delim ECHO_T!$ECHO_T$ac_delim LIBS!$LIBS$ac_delim build_alias!$build_alias$ac_delim host_alias!$host_alias$ac_delim target_alias!$target_alias$ac_delim INSTALL_PROGRAM!$INSTALL_PROGRAM$ac_delim INSTALL_SCRIPT!$INSTALL_SCRIPT$ac_delim INSTALL_DATA!$INSTALL_DATA$ac_delim am__isrc!$am__isrc$ac_delim CYGPATH_W!$CYGPATH_W$ac_delim PACKAGE!$PACKAGE$ac_delim VERSION!$VERSION$ac_delim ACLOCAL!$ACLOCAL$ac_delim AUTOCONF!$AUTOCONF$ac_delim AUTOMAKE!$AUTOMAKE$ac_delim AUTOHEADER!$AUTOHEADER$ac_delim MAKEINFO!$MAKEINFO$ac_delim install_sh!$install_sh$ac_delim STRIP!$STRIP$ac_delim INSTALL_STRIP_PROGRAM!$INSTALL_STRIP_PROGRAM$ac_delim mkdir_p!$mkdir_p$ac_delim AWK!$AWK$ac_delim SET_MAKE!$SET_MAKE$ac_delim am__leading_dot!$am__leading_dot$ac_delim AMTAR!$AMTAR$ac_delim am__tar!$am__tar$ac_delim am__untar!$am__untar$ac_delim CC!$CC$ac_delim CFLAGS!$CFLAGS$ac_delim LDFLAGS!$LDFLAGS$ac_delim CPPFLAGS!$CPPFLAGS$ac_delim ac_ct_CC!$ac_ct_CC$ac_delim EXEEXT!$EXEEXT$ac_delim OBJEXT!$OBJEXT$ac_delim DEPDIR!$DEPDIR$ac_delim am__include!$am__include$ac_delim am__quote!$am__quote$ac_delim AMDEP_TRUE!$AMDEP_TRUE$ac_delim AMDEP_FALSE!$AMDEP_FALSE$ac_delim AMDEPBACKSLASH!$AMDEPBACKSLASH$ac_delim CCDEPMODE!$CCDEPMODE$ac_delim am__fastdepCC_TRUE!$am__fastdepCC_TRUE$ac_delim am__fastdepCC_FALSE!$am__fastdepCC_FALSE$ac_delim LEX!$LEX$ac_delim LEX_OUTPUT_ROOT!$LEX_OUTPUT_ROOT$ac_delim LEXLIB!$LEXLIB$ac_delim YACC!$YACC$ac_delim YFLAGS!$YFLAGS$ac_delim TREECC!$TREECC$ac_delim CPP!$CPP$ac_delim GREP!$GREP$ac_delim EGREP!$EGREP$ac_delim LIBOBJS!$LIBOBJS$ac_delim LTLIBOBJS!$LTLIBOBJS$ac_delim _ACEOF if test `sed -n "s/.*$ac_delim\$/X/p" conf$$subs.sed | grep -c X` = 86; then break elif $ac_last_try; then { { echo "$as_me:$LINENO: error: could not make $CONFIG_STATUS" >&5 echo "$as_me: error: could not make $CONFIG_STATUS" >&2;} { (exit 1); exit 1; }; } else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done ac_eof=`sed -n '/^CEOF[0-9]*$/s/CEOF/0/p' conf$$subs.sed` if test -n "$ac_eof"; then ac_eof=`echo "$ac_eof" | sort -nru | sed 1q` ac_eof=`expr $ac_eof + 1` fi cat >>$CONFIG_STATUS <<_ACEOF cat >"\$tmp/subs-1.sed" <<\CEOF$ac_eof /@[a-zA-Z_][a-zA-Z_0-9]*@/!b end _ACEOF sed ' s/[,\\&]/\\&/g; s/@/@|#_!!_#|/g s/^/s,@/; s/!/@,|#_!!_#|/ :n t n s/'"$ac_delim"'$/,g/; t s/$/\\/; p N; s/^.*\n//; s/[,\\&]/\\&/g; s/@/@|#_!!_#|/g; b n ' >>$CONFIG_STATUS >$CONFIG_STATUS <<_ACEOF :end s/|#_!!_#|//g CEOF$ac_eof _ACEOF # VPATH may cause trouble with some makes, so we remove $(srcdir), # ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=/{ s/:*\$(srcdir):*/:/ s/:*\${srcdir}:*/:/ s/:*@srcdir@:*/:/ s/^\([^=]*=[ ]*\):*/\1/ s/:*$// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF fi # test -n "$CONFIG_FILES" for ac_tag in :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) { { echo "$as_me:$LINENO: error: Invalid tag $ac_tag." >&5 echo "$as_me: error: Invalid tag $ac_tag." >&2;} { (exit 1); exit 1; }; };; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || { { echo "$as_me:$LINENO: error: cannot find input file: $ac_f" >&5 echo "$as_me: error: cannot find input file: $ac_f" >&2;} { (exit 1); exit 1; }; };; esac ac_file_inputs="$ac_file_inputs $ac_f" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input="Generated from "`IFS=: echo $* | sed 's|^[^:]*/||;s|:[^:]*/|, |g'`" by configure." if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { echo "$as_me:$LINENO: creating $ac_file" >&5 echo "$as_me: creating $ac_file" >&6;} fi case $ac_tag in *:-:* | *:-) cat >"$tmp/stdin";; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` { as_dir="$ac_dir" case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || { $as_mkdir_p && mkdir -p "$as_dir"; } || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || { { echo "$as_me:$LINENO: error: cannot create directory $as_dir" >&5 echo "$as_me: error: cannot create directory $as_dir" >&2;} { (exit 1); exit 1; }; }; } ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,/..,g;s,/,,'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= case `sed -n '/datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p ' $ac_file_inputs` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { echo "$as_me:$LINENO: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF sed "$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s&@configure_input@&$configure_input&;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " $ac_file_inputs | sed -f "$tmp/subs-1.sed" >$tmp/out test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' "$tmp/out"`; test -z "$ac_out"; } && { echo "$as_me:$LINENO: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&5 echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined." >&2;} rm -f "$tmp/stdin" case $ac_file in -) cat "$tmp/out"; rm -f "$tmp/out";; *) rm -f "$ac_file"; mv "$tmp/out" $ac_file;; esac ;; :H) # # CONFIG_HEADER # _ACEOF # Transform confdefs.h into a sed script `conftest.defines', that # substitutes the proper values into config.h.in to produce config.h. rm -f conftest.defines conftest.tail # First, append a space to every undef/define line, to ease matching. echo 's/$/ /' >conftest.defines # Then, protect against being on the right side of a sed subst, or in # an unquoted here document, in config.status. If some macros were # called several times there might be several #defines for the same # symbol, which is useless. But do not sort them, since the last # AC_DEFINE must be honored. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* # These sed commands are passed to sed as "A NAME B PARAMS C VALUE D", where # NAME is the cpp macro being defined, VALUE is the value it is being given. # PARAMS is the parameter list in the macro definition--in most cases, it's # just an empty string. ac_dA='s,^\\([ #]*\\)[^ ]*\\([ ]*' ac_dB='\\)[ (].*,\\1define\\2' ac_dC=' ' ac_dD=' ,' uniq confdefs.h | sed -n ' t rset :rset s/^[ ]*#[ ]*define[ ][ ]*// t ok d :ok s/[\\&,]/\\&/g s/^\('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/ '"$ac_dA"'\1'"$ac_dB"'\2'"${ac_dC}"'\3'"$ac_dD"'/p s/^\('"$ac_word_re"'\)[ ]*\(.*\)/'"$ac_dA"'\1'"$ac_dB$ac_dC"'\2'"$ac_dD"'/p ' >>conftest.defines # Remove the space that was appended to ease matching. # Then replace #undef with comments. This is necessary, for # example, in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. # (The regexp can be short, since the line contains either #define or #undef.) echo 's/ $// s,^[ #]*u.*,/* & */,' >>conftest.defines # Break up conftest.defines: ac_max_sed_lines=50 # First sed command is: sed -f defines.sed $ac_file_inputs >"$tmp/out1" # Second one is: sed -f defines.sed "$tmp/out1" >"$tmp/out2" # Third one will be: sed -f defines.sed "$tmp/out2" >"$tmp/out1" # et cetera. ac_in='$ac_file_inputs' ac_out='"$tmp/out1"' ac_nxt='"$tmp/out2"' while : do # Write a here document: cat >>$CONFIG_STATUS <<_ACEOF # First, check the format of the line: cat >"\$tmp/defines.sed" <<\\CEOF /^[ ]*#[ ]*undef[ ][ ]*$ac_word_re[ ]*\$/b def /^[ ]*#[ ]*define[ ][ ]*$ac_word_re[( ]/b def b :def _ACEOF sed ${ac_max_sed_lines}q conftest.defines >>$CONFIG_STATUS echo 'CEOF sed -f "$tmp/defines.sed"' "$ac_in >$ac_out" >>$CONFIG_STATUS ac_in=$ac_out; ac_out=$ac_nxt; ac_nxt=$ac_in sed 1,${ac_max_sed_lines}d conftest.defines >conftest.tail grep . conftest.tail >/dev/null || break rm -f conftest.defines mv conftest.tail conftest.defines done rm -f conftest.defines conftest.tail echo "ac_result=$ac_in" >>$CONFIG_STATUS cat >>$CONFIG_STATUS <<\_ACEOF if test x"$ac_file" != x-; then echo "/* $configure_input */" >"$tmp/config.h" cat "$ac_result" >>"$tmp/config.h" if diff $ac_file "$tmp/config.h" >/dev/null 2>&1; then { echo "$as_me:$LINENO: $ac_file is unchanged" >&5 echo "$as_me: $ac_file is unchanged" >&6;} else rm -f $ac_file mv "$tmp/config.h" $ac_file fi else echo "/* $configure_input */" cat "$ac_result" fi rm -f "$tmp/out12" # Compute $ac_file's index in $config_headers. _am_arg=$ac_file _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { echo "$as_me:$LINENO: executing $ac_file commands" >&5 echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || for mf in $CONFIG_FILES; do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named `Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running `make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # When using ansi2knr, U may be empty or an underscore; expand it U=`sed -n 's/^U = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` { as_dir=$dirpart/$fdir case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || { $as_mkdir_p && mkdir -p "$as_dir"; } || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || { { echo "$as_me:$LINENO: error: cannot create directory $as_dir" >&5 echo "$as_me: error: cannot create directory $as_dir" >&2;} { (exit 1); exit 1; }; }; } # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done ;; esac done # for ac_tag { (exit 0); exit 0; } _ACEOF chmod +x $CONFIG_STATUS ac_clean_files=$ac_clean_files_save # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || { (exit 1); exit 1; } fi dicelab-0.7/util.c0000644000175000017500000000454411303206024011003 00000000000000#include #include "util.h" int cmpint(const void *p1, const void *p2) { return *(int*)p1 - *(int*)p2; } void quicksort(int *data, int start, int end) { qsort(&data[start], end-start+1, sizeof(int), cmpint); } void reverse(int *data, int start, int end) { int temp; while (start < end) { temp = data[start]; data[start] = data[end]; data[end] = temp; start++; end--; } } void permute(int *data, int count) { int i, p, t; for (i = count-1; i >= 0; i--) { p = (int) ((i+1) * (rand() / (RAND_MAX + 1.0))); t = data[i]; data[i] = data[p]; data[p] = t; } } void result_add(struct result_node **list, int value) { // make sure we have a list if (*list == NULL) { *list = (struct result_node *)malloc(sizeof(struct result_node)); (*list)->value = value; (*list)->prob = 1; (*list)->next = NULL; return; } // walk the list struct result_node *cur = *list, *last = NULL; while ((cur != NULL) && (cur->value < value)) { last = cur; cur = cur->next; } // see what we have to do if (cur == NULL) { cur = (struct result_node *)malloc(sizeof(struct result_node)); cur->value = value; cur->prob = 1; cur->next = NULL; last->next = cur; return; } else if (cur->value == value) { cur->prob++; return; } else if (last != NULL) { last->next = (struct result_node *)malloc(sizeof(struct result_node)); last->next->value = value; last->next->prob = 1; last->next->next = cur; } else { *list = (struct result_node *)malloc(sizeof(struct result_node)); (*list)->value = value; (*list)->prob = 1; (*list)->next = cur; } } inline void swapperm(int *data, int i, int j) { if (i == j) return; data[i] ^= data[j]; data[j] ^= data[i]; data[i] ^= data[j]; }; void _rec_all_permutations(int *data, int count, void (*callback)(int *data, int count, void *arg, float farg), void *arg, float farg, int n) { if (1 == n) { callback(data, count, arg, farg); } else { int c; for (c = 0; c < n; c++) { _rec_all_permutations(data, count, callback, arg, farg, n-1); swapperm(data, n%2 == 1 ? 0 : c, n-1); } } } void all_permutations(int *data, int count, void (*callback)(int *data, int count, void *arg, float farg), void *arg, float farg) { _rec_all_permutations(data, count, callback, arg, farg, count); } long factorial(int n) { long fact = 1; while (n > 0) { fact *= n--; } return fact; } dicelab-0.7/par.y0000644000175000017500000001615611303206024010640 00000000000000%{ #include #include #include #include "util.h" #include "tree.h" int yylex(); int yyerror(char *s); int yyget_lineno(); char *filename = ""; extern int cmd_parse_tree; extern int cmd_roll; extern int cmd_rolleval; extern int cmd_calc; extern int cmd_count; int cmplist(const void *p1, const void *p2) { return ((struct val_list*)p1)->values[0] - ((struct val_list*)p2)->values[0]; } /* XXX use qsort from libc, but for some reason this segfaults void list_quicksort(struct val_list **data, int start, int end) { qsort(&data[start], end-start+1, sizeof(struct val_list*), cmplist); }*/ void list_quicksort(struct val_list **data, int start, int end) { if (end > start) { int i=start-1; int j = end; struct val_list *t; for(;;) { while(cmplist(data[++i], data[end]) < 0); while(cmplist(data[--j >= 0 ? j : end], data[end]) > 0); if (i>=j) break; t = data[i]; data[i] = data[j]; data[j] = t; } t = data[i]; data[i] = data[end]; data[end] = t; list_quicksort(data, start, i-1); list_quicksort(data, i+1, end); } } struct val_list *list_sort(struct val_list *list) { int count = 0; struct val_list *cl = list; // count the list while (cl) { count++; cl = cl->next; } // create an array struct val_list **hash = (struct val_list**)malloc( sizeof(struct val_list*) * count); int i = 0; cl = list; while (cl) { hash[i] = cl; cl = cl->next; i++; } // now sort the hash list_quicksort(hash, 0, count-1); for (i = 0; i < count-1; i++) { hash[i]->next = hash[i+1]; } hash[count-1]->next = NULL; cl = hash[0]; free(hash); return cl; } %} %error-verbose %union { int ival; char *tval; expression *expr; } %token NUMBER %token VARIABLE %token IN DO WHILE ELSE %token RANGE %right ',' %token EQ NE LT GT LE GE %left '+' '-' '.' %left '*' '/' '%' %token SUM PROD COUNT LOW HIGH %right '#' %right '^' %right DICE %token PERM SORT REV DROP KEEP FIRST LAST LET FOREACH IF THEN %type expr %type scalar %type list %type filter %% input: pexpr | input ';' pexpr | input ';' ; pexpr: expr { if (cmd_parse_tree) { printtree($1, 0); } if (cmd_roll) { int i; struct symtab *st = NULL; set_symtab($1, st); struct roll_value *rv = roll($1); for (i = 0; i < rv->count; i++) { printf("%i ", rv->values[i]); } printf("\n"); free_roll(rv); } if (cmd_calc) { struct symtab *st = NULL; $1 = optimize($1); set_symtab($1, st); // we can use agnostic here as we are getting a scalar anyway. set_ordering($1, agnostic); struct val_list *vl = eval($1); struct val_list *cl = vl = list_sort(vl); while (cl) { if (cl->count != 1) { yyerror("result is not scalar"); break; } // XXX make output resolution configurable printf("%3i\t%0.6f\t\n", cl->values[0], cl->prob); cl = cl->next; } list_free(vl); } if (cmd_rolleval) { int i; struct result_node *rl = NULL; for (i = 0; i < cmd_count; i++) { struct symtab *st = NULL; set_symtab($1, st); struct roll_value *rv = roll($1); if (rv->count != 1) { yyerror("Result not a single value"); free_roll(rv); break; } result_add(&rl, rv->values[0]); free_roll(rv); } struct result_node *cl = rl; int sum = 0; while (cl != NULL) { sum += cl->prob; cl = cl->next; } cl = rl; while (cl != NULL) { float fprob; fprob = 1.0*cl->prob; fprob /= sum; // XXX make output resolution configurable printf("%3i\t%0.6f\n", cl->value, fprob); struct result_node *old = cl; cl = cl->next; free(old); } } } ; expr: scalar { $$ = $1; } | list { $$ = $1; } ; scalar: NUMBER { $$ = number_create($1); } | VARIABLE { $$ = variable_create($1); } | '(' scalar ')' { $$ = $2; } | '-' scalar { $$ = negate_create($2); } | scalar '+' scalar { $$ = plus_create($1, $3); } | scalar '-' scalar { $$ = minus_create($1, $3); } | scalar '*' scalar { $$ = multi_create($1, $3); } | scalar '/' scalar { $$ = divi_create($1, $3); } | scalar '%' scalar { $$ = mod_create($1, $3); } | scalar '^' scalar { $$ = expo_create($1, $3); } | scalar '.' scalar { $$ = scat_create($1, $3); } | DICE scalar { $$ = dice_create($2); } | SUM expr { $$ = sum_create($2); } | PROD expr { $$ = prod_create($2); } | COUNT expr { $$ = count_create($2); } ; list: scalar '#' expr { $$ = rep_create($1, $3); } | '(' list ')' { $$ = $2; } | '(' ')' { $$ = elist_create(); } | scalar RANGE scalar { $$ = range_create($1, $3); } | expr ',' expr { $$ = lcat_create($1, $3); } | PERM expr { $$ = perm_create($2); } | SORT expr { $$ = sort_create($2); } | REV expr { $$ = rev_create($2); } | filter { $$ = $1; } | IF expr THEN expr ELSE expr { $$ = ifthenelse_create($2, $4, $6); } | LET VARIABLE '=' expr IN expr { $$ = let_create($4, $6, $2); } | WHILE VARIABLE '=' expr DO expr { $$ = whiledo_create($4, $6, $2); } | FOREACH VARIABLE IN expr DO expr { $$ = foreach_create($4, $6, $2); } ; filter: DROP FIRST expr expr { $$ = first_create($3, $4, drop); } | KEEP FIRST expr expr { $$ = first_create($3, $4, keep); } | FIRST expr expr { $$ = first_create($2, $3, keep); } | DROP LAST expr expr { $$ = last_create($3, $4, drop); } | KEEP LAST expr expr { $$ = last_create($3, $4, keep); } | LAST expr expr { $$ = last_create($2, $3, keep); } | DROP HIGH expr expr { $$ = high_create($3, $4, drop); } | KEEP HIGH expr expr { $$ = high_create($3, $4, keep); } | HIGH expr expr { $$ = high_create($2, $3, keep); } | DROP LOW expr expr { $$ = low_create($3, $4, drop); } | KEEP LOW expr expr { $$ = low_create($3, $4, keep); } | LOW expr expr { $$ = low_create($2, $3, keep); } | DROP EQ expr expr { $$ = comparison_create($3, $4, drop, eq); } | KEEP EQ expr expr { $$ = comparison_create($3, $4, keep, eq); } | EQ expr expr { $$ = comparison_create($2, $3, keep, eq); } | DROP NE expr expr { $$ = comparison_create($3, $4, drop, ne); } | KEEP NE expr expr { $$ = comparison_create($3, $4, keep, ne); } | NE expr expr { $$ = comparison_create($2, $3, keep, ne); } | DROP GT expr expr { $$ = comparison_create($3, $4, drop, gt); } | KEEP GT expr expr { $$ = comparison_create($3, $4, keep, gt); } | GT expr expr { $$ = comparison_create($2, $3, keep, gt); } | DROP LT expr expr { $$ = comparison_create($3, $4, drop, lt); } | KEEP LT expr expr { $$ = comparison_create($3, $4, keep, lt); } | LT expr expr { $$ = comparison_create($2, $3, keep, lt); } | DROP GE expr expr { $$ = comparison_create($3, $4, drop, ge); } | KEEP GE expr expr { $$ = comparison_create($3, $4, keep, ge); } | GE expr expr { $$ = comparison_create($2, $3, keep, ge); } | DROP LE expr expr { $$ = comparison_create($3, $4, drop, le); } | KEEP LE expr expr { $$ = comparison_create($3, $4, keep, le); } | LE expr expr { $$ = comparison_create($2, $3, keep, le); } ; %% int yyerror(char *s) { fprintf(stderr, "%s:%li %s\n", yycurrfilename(), yycurrlinenum(), s); return (1); } extern int yylineno; long yycurrlinenum() { return yylineno; } char *yycurrfilename() { return filename; } void yynodefailed() { exit(1); } dicelab-0.7/roll.tc0000644000175000017500000003204311303206024011155 00000000000000%operation %virtual struct roll_value *roll(expression *this) roll(elist) { struct roll_value *rv = new_roll_single(0); rv->count = 0; return rv; } roll(number) { struct roll_value *rv = new_roll_single(this->num); return rv; } roll(mathop) { struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); if (rv1->count != 1) { yyerror("Argument 1 to math op isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } if (rv2->count != 1) { yyerror("Argument 2 to math op isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } switch (yykind(this)) { case plus_kind: rv1->values[0] += rv2->values[0]; break; case minus_kind: rv1->values[0] -= rv2->values[0]; break; case multi_kind: rv1->values[0] *= rv2->values[0]; break; case divi_kind: rv1->values[0] /= rv2->values[0]; break; case mod_kind: rv1->values[0] %= rv2->values[0]; break; case expo_kind: rv1->values[0] = (int) pow(rv1->values[0], rv2->values[0]); break; default: yyerror("Unknown math op"); } free_roll(rv2); return rv1; } /* XXX scat could also be a math op */ roll(scat) { struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); if (rv1->count != 1) { yyerror("Argument 1 to scat (.) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } if (rv2->count != 1) { yyerror("Argument 2 to scat (.) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } int i = 10; while (i < rv2->values[0]) { i *= 10; } rv1->values[0] *= i; rv1->values[0] += rv2->values[0]; free_roll(rv2); return rv1; } roll(range) { int i; int c = 0; struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); if (rv1->count != 1) { yyerror("Argument 1 to range (..) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } if (rv2->count != 1) { yyerror("Argument 2 to range (..) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } struct roll_value *rv; if (rv1->values[0] <= rv2->values[0]) { rv = new_roll_multi( abs(rv1->values[0] - rv2->values[0]) + 1); for (i = rv1->values[0]; i != rv2->values[0]; rv1->values[0] < rv2->values[0] ? i++ : i--) { rv->values[c] = i; c++; } rv->values[c] = rv2->values[0]; } else { rv = new_roll_single(0); rv->count = 0; } free_roll(rv1); free_roll(rv2); return rv; } roll(rep) { struct roll_value *rep = roll(this->expr1); if (rep->count != 1) { yyerror("Argument 1 to rep (#) isn't scalar"); rep->count = 1; rep->values[0] = 0; return rep; } struct roll_value *rv = new_roll_single(rep->values[0]); rv->count = 0; int i; for (i = 0; i < rep->values[0]; i++) { struct roll_value *roll = roll(this->expr2); rv->values = (int*)realloc(rv->values, sizeof(int) * (rv->count + roll->count)); memcpy(&rv->values[rv->count], roll->values, roll->count * sizeof(int)); rv->count += roll->count; free_roll(roll); } free_roll(rep); return rv; } roll(lcat) { struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); rv1->values = (int*)realloc(rv1->values, sizeof(int) * (rv1->count + rv2->count)); memcpy(&rv1->values[rv1->count], rv2->values, rv2->count * sizeof(int)); rv1->count += rv2->count; free_roll(rv2); return rv1; } roll(negate) { struct roll_value *rv = roll(this->expr); if (rv->count != 1) { yyerror("Argument 1 to negate (-) isn't scalar"); rv->count = 1; rv->values[0] = 0; return rv; } rv->values[0] *= -1; return rv; } roll(dice) { struct roll_value *rv = roll(this->expr); if (rv->count != 1) { yyerror("Argument 1 to dice (d) isn't scalar"); rv->count = 1; rv->values[0] = 0; return rv; } if (rv->values[0] < 1) { yyerror("Argument 1 to dice (d) isn't >= 1"); rv->count = 1; rv->values[0] = 0; return rv; } rv->values[0] = 1 + (int) (rv->values[0] * (rand() / (RAND_MAX + 1.0))); return rv; } roll(sum) { int s = 0; int i; struct roll_value *rv = roll(this->expr); for (i = 0; i < rv->count; i++) { s += rv->values[i]; } rv->count = 1; rv->values = (int*)realloc(rv->values, sizeof(int) * rv->count); rv->values[0] = s; return rv; } roll(prod) { int s = 1; int i; struct roll_value *rv = roll(this->expr); for (i = 0; i < rv->count; i++) { s *= rv->values[i]; } rv->count = 1; rv->values = (int*)realloc(rv->values, sizeof(int) * rv->count); rv->values[0] = s; return rv; } roll(perm) { struct roll_value *rv = roll(this->expr); permute(rv->values, rv->count); return rv; } roll(sort) { struct roll_value *rv = roll(this->expr); /* sortiere */ quicksort(rv->values, 0, rv->count - 1); return rv; } roll(rev) { int i; struct roll_value *rv = roll(this->expr); for (i = 0; i < rv->count/2; i++) { rv->values[i] ^= rv->values[rv->count-1-i]; rv->values[rv->count-1-i] ^= rv->values[i]; rv->values[i] ^= rv->values[rv->count-1-i]; } return rv; } roll(count) { struct roll_value *rv = roll(this->expr); rv->values = realloc(rv->values, sizeof(int)); rv->values[0] = rv->count; rv->count = 1; return rv; } roll(first) { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to first isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } if (this->type == drop) { int i = exp->count - num->values[0]; if (i <= 0) { i = 0; exp->count = 0; } else { memcpy(&exp->values[0], &exp->values[exp->count - i], i * sizeof(int)); exp->count = i; } } else { exp->count = min(exp->count, num->values[0]); } free_roll(num); return exp; } roll(last) { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to last isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } if (this->type == drop) { exp->count -= num->values[0]; if (exp->count < 0) { exp->count = 0; } } else { if (num->values[0] < exp->count) { memcpy(&exp->values[0], &exp->values[exp->count - num->values[0]], num->values[0] * sizeof(int)); exp->count = num->values[0]; } } free_roll(num); return exp; } roll(low) { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to last isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } int *slist = (int*)malloc(sizeof(int) * exp->count); int *mask = (int*)malloc(sizeof(int) * exp->count); memcpy(slist, exp->values, sizeof(int) * exp->count); memset(mask, 0, sizeof(int) * exp->count); quicksort(slist, 0, exp->count -1); int p = 0, i, c = 0; if (this->type == keep) { for (i = 0; (i < exp->count) && (c < num->values[0]); i++) { int j, found = 0; for (j = 0; j < num->values[0]; j++) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } else { for (i = 0; (i < exp->count) && (c < (exp->count - num->values[0])); i++) { int j, found = 0; for (j = exp->count - 1; j >= num->values[0]; j--) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } else { } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } exp->count = c; free_roll(num); free(slist); free(mask); return exp; } roll(high) { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to last isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } int *slist = (int*)malloc(sizeof(int) * exp->count); int *mask = (int*)malloc(sizeof(int) * exp->count); memcpy(slist, exp->values, sizeof(int) * exp->count); memset(mask, 0, sizeof(int) * exp->count); quicksort(slist, 0, exp->count -1); int p = 0, i, c = 0; if (this->type == keep) { for (i = 0; (i < exp->count) && (c < num->values[0]); i++) { int j, found = 0; for (j = exp->count - 1; j >= exp->count - num->values[0]; j--) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } else { for (i = 0; (i < exp->count) && (c < (exp->count - num->values[0])); i++) { int j, found = 0; for (j = 0; j < exp->count - num->values[0]; j++) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } exp->count = c; free_roll(num); free(slist); free(mask); return exp; } roll(comparison) { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to comparison isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } int o, n = 0; for (o = 0; o < exp->count; o++) { int c = 0; switch (this->comp) { case eq: c = exp->values[o] == num->values[0]; break; case ne: c = exp->values[o] != num->values[0]; break; case gt: c = exp->values[o] > num->values[0]; break; case lt: c = exp->values[o] < num->values[0]; break; case ge: c = exp->values[o] >= num->values[0]; break; case le: c = exp->values[o] <= num->values[0]; break; default: yyerror("Unexpected comparison (really bad)"); } if (this->type == drop) { c = !c; } if (c) { exp->values[n++] = exp->values[o]; } } exp->count = n; free_roll(num); return exp; } roll(ifthenelse) { struct roll_value *if_expr = roll(this->if_expr); if (if_expr->count > 0) { free_roll(if_expr); return roll(this->then_expr); } else { free_roll(if_expr); return roll(this->else_expr); } } roll(let) { // variable setzen und in symtab struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = roll(this->expr1); nst->next = this->symtab; set_symtab(this->expr2, nst); struct roll_value *ret = roll(this->expr2); // variable wieder vom stack free_roll(nst->rvalue); free(nst); return ret; } roll(variable) { struct symtab *nst = this->symtab; struct roll_value *ret = NULL; while (nst != NULL) { if (strcmp(this->varname, nst->name) == 0) { /* copy the roll value */ ret = (struct roll_value*)malloc(sizeof(struct roll_value)); ret->values = (int*)malloc(sizeof(int) * nst->rvalue->count); memcpy(ret->values, nst->rvalue->values, sizeof(int) * nst->rvalue->count); ret->count = nst->rvalue->count; break; } nst = nst->next; } if (ret == NULL) { char *emsg = (char*)malloc(sizeof(char)*22+strlen(this->varname)); sprintf(emsg, "Variable \"%s\" not found", this->varname); yyerror(emsg); free(emsg); ret = (struct roll_value*)malloc(sizeof(struct roll_value)); ret->values = (int*)malloc(sizeof(int) * 1); ret->values[0] = 0; ret->count = 1; } return ret; } roll(foreach) { struct roll_value *list = roll(this->expr1); struct roll_value *ret = (struct roll_value*) malloc(sizeof(struct roll_value)); ret->count = 0; ret->values = NULL; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = 1; nst->rvalue->values = (int*)malloc(sizeof(int)); nst->next = this->symtab; set_symtab(this->expr2, nst); int i; for (i = 0; i < list->count; i++) { nst->rvalue->values[0] = list->values[i]; struct roll_value *cur = roll(this->expr2); /* concat to the current solution */ ret->values = (int*)realloc(ret->values, (ret->count + cur->count) * sizeof(int)); memcpy(&ret->values[ret->count], cur->values, cur->count * sizeof(int)); ret->count += cur->count; free_roll(cur); } free_roll(list); free_roll(nst->rvalue); free(nst); return ret; } roll(whiledo) { struct roll_value *cur; struct roll_value *ret = (struct roll_value*)malloc( sizeof(struct roll_value)); ret->count = 0; ret->values = NULL; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->next = this->symtab; set_symtab(this->expr2, nst); cur = roll(this->expr1); nst->rvalue = cur; /* concat cur to ret */ ret->values = (int*)realloc(ret->values, sizeof(int) * (cur->count + ret->count)); memcpy(&ret->values[ret->count], cur->values, sizeof(int) * cur->count); ret->count += cur->count; while (cur->count > 0) { cur = roll(this->expr2); free_roll(nst->rvalue); nst->rvalue = cur; /* concat cur to ret */ ret->values = (int*)realloc(ret->values, sizeof(int) * (cur->count + ret->count)); memcpy(&ret->values[ret->count], cur->values, sizeof(int) * cur->count); ret->count += cur->count; } free_roll(cur); free(nst); return ret; } dicelab-0.7/missing0000755000175000017500000002557710753463634011316 00000000000000#! /bin/sh # Common stub for a few missing GNU programs while installing. scriptversion=2006-05-10.23 # Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006 # Free Software Foundation, Inc. # Originally by Fran,cois Pinard , 1996. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try \`$0 --help' for more information" exit 1 fi run=: sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' sed_minuso='s/.* -o \([^ ]*\).*/\1/p' # In the cases where this matters, `missing' is being run in the # srcdir already. if test -f configure.ac; then configure_ac=configure.ac else configure_ac=configure.in fi msg="missing on your system" case $1 in --run) # Try to run requested program, and just exit if it succeeds. run= shift "$@" && exit 0 # Exit code 63 means version mismatch. This often happens # when the user try to use an ancient version of a tool on # a file that requires a minimum version. In this case we # we should proceed has if the program had been absent, or # if --run hadn't been passed. if test $? = 63; then run=: msg="probably too old" fi ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an error status if there is no known handling for PROGRAM. Options: -h, --help display this help and exit -v, --version output version information and exit --run try to run the given command, and emulate it if it fails Supported PROGRAM values: aclocal touch file \`aclocal.m4' autoconf touch file \`configure' autoheader touch file \`config.h.in' autom4te touch the output file, or create a stub one automake touch all \`Makefile.in' files bison create \`y.tab.[ch]', if possible, from existing .[ch] flex create \`lex.yy.c', if possible, from existing .c help2man touch the output file lex create \`lex.yy.c', if possible, from existing .c makeinfo touch the output file tar try tar, gnutar, gtar, then tar without non-portable flags yacc create \`y.tab.[ch]', if possible, from existing .[ch] Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: Unknown \`$1' option" echo 1>&2 "Try \`$0 --help' for more information" exit 1 ;; esac # Now exit if we have it, but it failed. Also exit now if we # don't have it and --version was passed (most likely to detect # the program). case $1 in lex|yacc) # Not GNU programs, they don't have --version. ;; tar) if test -n "$run"; then echo 1>&2 "ERROR: \`tar' requires --run" exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then exit 1 fi ;; *) if test -z "$run" && ($1 --version) > /dev/null 2>&1; then # We have it, but it failed. exit 1 elif test "x$2" = "x--version" || test "x$2" = "x--help"; then # Could not run --version or --help. This is probably someone # running `$TOOL --version' or `$TOOL --help' to check whether # $TOOL exists and not knowing $TOOL uses missing. exit 1 fi ;; esac # If it does not exist, or fails to run (possibly an outdated version), # try to emulate it. case $1 in aclocal*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." touch aclocal.m4 ;; autoconf) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." touch configure ;; autoheader) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`acconfig.h' or \`${configure_ac}'. You might want to install the \`Autoconf' and \`GNU m4' packages. Grab them from any GNU archive site." files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` test -z "$files" && files="config.h" touch_files= for f in $files; do case $f in *:*) touch_files="$touch_files "`echo "$f" | sed -e 's/^[^:]*://' -e 's/:.*//'`;; *) touch_files="$touch_files $f.in";; esac done touch $touch_files ;; automake*) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. You might want to install the \`Automake' and \`Perl' packages. Grab them from any GNU archive site." find . -type f -name Makefile.am -print | sed 's/\.am$/.in/' | while read f; do touch "$f"; done ;; autom4te) echo 1>&2 "\ WARNING: \`$1' is needed, but is $msg. You might have modified some files without having the proper tools for further handling them. You can get \`$1' as part of \`Autoconf' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo "#! /bin/sh" echo "# Created by GNU Automake missing as a replacement of" echo "# $ $@" echo "exit 0" chmod +x $file exit 1 fi ;; bison|yacc) echo 1>&2 "\ WARNING: \`$1' $msg. You should only need it if you modified a \`.y' file. You may need the \`Bison' package in order for those modifications to take effect. You can get \`Bison' from any GNU archive site." rm -f y.tab.c y.tab.h if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.y) SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.c fi SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` if test -f "$SRCFILE"; then cp "$SRCFILE" y.tab.h fi ;; esac fi if test ! -f y.tab.h; then echo >y.tab.h fi if test ! -f y.tab.c; then echo 'main() { return 0; }' >y.tab.c fi ;; lex|flex) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.l' file. You may need the \`Flex' package in order for those modifications to take effect. You can get \`Flex' from any GNU archive site." rm -f lex.yy.c if test $# -ne 1; then eval LASTARG="\${$#}" case $LASTARG in *.l) SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` if test -f "$SRCFILE"; then cp "$SRCFILE" lex.yy.c fi ;; esac fi if test ! -f lex.yy.c; then echo 'main() { return 0; }' >lex.yy.c fi ;; help2man) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a dependency of a manual page. You may need the \`Help2man' package in order for those modifications to take effect. You can get \`Help2man' from any GNU archive site." file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -f "$file"; then touch $file else test -z "$file" || exec >$file echo ".ab help2man is required to generate this page" exit 1 fi ;; makeinfo) echo 1>&2 "\ WARNING: \`$1' is $msg. You should only need it if you modified a \`.texi' or \`.texinfo' file, or any other file indirectly affecting the aspect of the manual. The spurious call might also be the consequence of using a buggy \`make' (AIX, DU, IRIX). You might want to install the \`Texinfo' package or the \`GNU make' package. Grab either from any GNU archive site." # The file to touch is that specified with -o ... file=`echo "$*" | sed -n "$sed_output"` test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` if test -z "$file"; then # ... or it is the one specified with @setfilename ... infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` file=`sed -n ' /^@setfilename/{ s/.* \([^ ]*\) *$/\1/ p q }' $infile` # ... or it is derived from the source name (dir/f.texi becomes f.info) test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info fi # If the file does not exist, the user really needs makeinfo; # let's fail without touching anything. test -f $file || exit 1 touch $file ;; tar) shift # We have already tried tar in the generic part. # Look for gnutar/gtar before invocation to avoid ugly error # messages. if (gnutar --version > /dev/null 2>&1); then gnutar "$@" && exit 0 fi if (gtar --version > /dev/null 2>&1); then gtar "$@" && exit 0 fi firstarg="$1" if shift; then case $firstarg in *o*) firstarg=`echo "$firstarg" | sed s/o//` tar "$firstarg" "$@" && exit 0 ;; esac case $firstarg in *h*) firstarg=`echo "$firstarg" | sed s/h//` tar "$firstarg" "$@" && exit 0 ;; esac fi echo 1>&2 "\ WARNING: I can't seem to be able to run \`tar' with the given arguments. You may want to install GNU tar or Free paxutils, or check the command line arguments." exit 1 ;; *) echo 1>&2 "\ WARNING: \`$1' is needed, and is $msg. You might have modified some files without having the proper tools for further handling them. Check the \`README' file, it often tells you about the needed prerequisites for installing this package. You may also peek at any GNU archive site, in case some other package would contain this missing \`$1' program." exit 1 ;; esac exit 0 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: dicelab-0.7/install-sh0000755000175000017500000003246410753463634011714 00000000000000#!/bin/sh # install - install a program, script, or datafile scriptversion=2006-12-25.00 # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # `make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call `install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then trap '(exit $?); exit' 1 2 13 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names starting with `-'. case $src in -*) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # Protect names starting with `-'. case $dst in -*) dst=./$dst;; esac # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writeable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; -*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test -z "$d" && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: dicelab-0.7/ordering.tc0000644000175000017500000000374311303206024012023 00000000000000// this is being called recursively over the whole tree. if "ordering" is "caring", then the // parent op wants the lists ordered, otherwise it doesn't care %operation %virtual void set_ordering(expression *this, ordering_type ordering) set_ordering(expression) { this->ordering = ordering; } set_ordering(unary) { this->ordering = ordering; set_ordering(this->expr, ordering); } set_ordering(binary) { this->ordering = ordering; set_ordering(this->expr1, ordering); set_ordering(this->expr2, ordering); } set_ordering(sum) { this->ordering = ordering; set_ordering(this->expr, agnostic); } set_ordering(prod) { this->ordering = ordering; set_ordering(this->expr, agnostic); } set_ordering(count) { this->ordering = ordering; set_ordering(this->expr, agnostic); } set_ordering(sort) { this->ordering = ordering; set_ordering(this->expr, agnostic); } set_ordering(perm) { this->ordering = ordering; set_ordering(this->expr, agnostic); } set_ordering(first) { this->ordering = ordering; set_ordering(this->expr1, agnostic); set_ordering(this->expr2, caring); } set_ordering(last) { this->ordering = ordering; set_ordering(this->expr1, agnostic); set_ordering(this->expr2, caring); } set_ordering(ifthenelse) { this->ordering = ordering; set_ordering(this->if_expr, agnostic); set_ordering(this->then_expr, ordering); set_ordering(this->else_expr, ordering); } set_ordering(variable) { this->ordering = ordering; // get the symtab struct symtab *nst = this->symtab; while (nst != NULL) { if (strcmp(this->varname, nst->name) == 0) { break; } nst = nst->next; } if (nst && nst->ordering == agnostic) { nst->ordering = ordering; } } set_ordering(let) { this->ordering = ordering; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->ordering = agnostic; nst->next = this->symtab; set_symtab(this->expr2, nst); set_ordering(this->expr2, ordering); set_ordering(this->expr1, nst->ordering); free(nst); } dicelab-0.7/README0000644000175000017500000003002211303206024010530 00000000000000D I C E L A B R E A D M E =========================== Purpose ------- Dicelab is intended to examine dice rolling schemes and roll dice according to such a scheme. It may be helpfull when designing or playing certain games. The current version can determine the statistical distribution by rolling over and over again, or by actually doing the maths. The latter is more precise, but might be prohibitively slow in some cases. Getting new Versions -------------------- New versions should always be available from http://www.semistable.com/dicelab/ Build Requirements ------------------ In order to build dicelab from source you will need: * GNU Make * gcc If you want to hack on this, you will also need: * flex * bison * treecc Compilation ----------- To build this program run './configure' and inspect the output for problems. This will also honour the '--prefix' option to specify where you want the program to be installed. To build dicelab then run 'make'. Installation ------------ The command 'make install' (as root) will install the program and accompanying documentation files to the location specified during './configure' (the default is /usr). Optionally, you can of course copy the files to their intended location by hand. Win32 ----- Dicelab can be built into a Win32 (commandline) executable using Mingw32 (and probably other tools as well). In order to do this, you need a static flex library for the target system, and then set CC and LDFLAGS accordingly. In my case i do change the Makefile that gets generated by ./configure: CC=i586-mingw32msvc-cc LDFLAGS=-L../flex/lib Should you have problems getting this to work, you can always mail me and i'll provide you with a binary (though i don't understand why you use win32 at all) Running ------- Dicelab is called like this: dicelab [options] [-f ] The options include --help -h -? print a help message --version -v display the version number --print-tree -p print the parse tree (for debugging purposes) --eval -e evaluate the statistical distribution by re-rollingp --count -c specify the number of rolls used with --eval default is 10000 --roll -r roll the dice as specified. This will also be used if no other action is requested --threshold -t cutoff threshold, results with a probability less than this value will be discarded by some operations when using --calc --file -f read the dice rolling specs from the file specified, use stdin if not supplied If you don't specify a file with the dice rolling scheme, dicelab will read from stdin. Quick Start ----------- Single die rolls may be made using the 'd' operator, followed by the number of faces on the die to be rolled. E.g., d6 will roll a single six-sided die, and d2 will flip a coin. Expressions may be modified by the standard arithmetic operators. d10-1 will yield a value between 0 and 9, inclusive. In order to roll multiple dice of the same type, use the repetition operator '#'. 2#d6 will roll two six-sided dice; this is not the same as 2*d6, which rolls only a single die but multipies the result by two, or 2d6 which will cause a syntax error. In order to get the sum of two six-sided dice, do sum(2#d6). Full Syntax ----------- ::= -?[0-9]+ ::= [A-Za-z]+ ::= | | ( ) | - | + | - | * | / | % | ^ | . | d | sum | prod | count ::= # | ( ) | .. | , | perm | sort | rev | (drop|keep)? low | (drop|keep)? high | (drop|keep)? first | (drop|keep)? last | (drop|keep)? == | (drop|keep)? != | (drop|keep)? < | (drop|keep)? > | (drop|keep)? <= | (drop|keep)? >= | if then else | let = in | while = do | foreach in do ::= ::= | ; Comments may be inserted by using double slashed (//) as in C. Sematics -------- + - * / ^ These are the familiar binary arithmetic operators for addition, subtraction, multiplication, division, and exponentiation. Division rounds toward zero. Examples: 5+7, d6-1, 2^10 - This is the unary minus operator. Examples: -1 % This is the modulus operator. x % y gives the remainder of x divided by y. Examples: 11%2, d6%3 . This is the scalar concatenation operator. x . y gives xy, the concatenation of x and y. Examples: -10.9, d6.d6 d This is the die roll operator. dn gives the value of a single roll of an n-sided die. Examples: d6, 2#d6 sum prod These are the extended sum and product operators. If e is an expression, sum e and prod e give the sum of the members of e and the product of the members of e, respectively. Examples: sum(1..100), prod(3#d6) count This is the list size operator. If e is an expression, then count e gives the number of members of e. Examples: count(1,2,3), count(== 6 10#d6) # This is the list repetition operator. If n is a nonnegative scalar and e is an expression, then n#e is a list containing the results of n evaluations of e. Examples: 10#8, 3#d10 .. This is the range operator. If x and y are scalars, then x..y is a list consisting of the interval [x,y]. If x>y, then the resulting list is empty. Examples: 1..10, 4..d10 , This is the list concatenation operator. v,u gives the list consisting of all of the members of v, followed by all of the members of u. Examples: 1,2 4,(3#d6) sort This is the list sorting operator. sort e sorts the list e in ascending order. Examples: sort(10#d6) perm This is the list permutation operator. sort e results in a random permutation of the list e. Use perm to shuffle a list. Examples: perm(1..52) rev This is the list reversal operator. rev e results in a list with the same members as the list e, but in reverse order. Examples: rev(1..10), rev sort(10#d8) low high These operators act as filters by finding the least and greatest values in lists. If n is a nonnegative scalar and e is an expression, then low n e gives the n least members of e, and high n e gives the n greatest members of e. Examples: high 3 5#d6 first last These operators act as filters by finding initial and final segments of lists. If n is a nonnegtive scalar and e is an expression, then first n e gives the first n members of e, and last n e gives the last n members of e. Examples: first 3 (1..10) == != < > <= >= These operators act as filters by finding values in lists which meet given conditions. If x is a scalar and e is an expression, then == x e gives the list of members of e equal to x; != x e gives the list of members of e not equal to x; < x e gives the list of members of e less than x; > x e gives the list of members of e greater than x; <= x e gives the list of members of e less than or equal to x; >= x e gives the list of members of e greater than or equal to x. Examples: >= 3 5#d6 drop keep These operators modify filters on lists. If fop is a filter operation on an expression e, then keep fop e has the same result as fop e and drop fop e evaluates to e less keep fop e. In other words, drop negates filter conditions, and keep affirms them. keep is never necessary and exists only for symmetry. Examples: sum(drop low 1 4#d6) let This is the variable assignment and substitution operator. If x is a variable and e and f are an expressions, then let x = e in f gives the list which results from evaluating f with the value of e substituted for every occurance of x in f. Evaluation of e is done prior to substitution. Examples: let x = d6 in x*x foreach This is the bounded iteration operator. If x is a variable and e and f are expressions, then foreach x in e do f gives the list which results from assigning to x each of the members of e and evaluating f. Examples: foreach x in c do x+1 while This is the unbounded iteration operator. If x is a variable and e and f are expressions, then while x = e do f is the list v0,v1,...,vn, where v0 is the result of evaluating e and vi+1 is the result of assigning vi to x and evaluating f, stopping at the first vi which is empty. Examples: while x=d6 do ((count <6 x)#d6) if This is the branching operator. If e, f, and g are expressions, then if e then f else g gives f if e is nonempty, and g otherwise. Examples: if count(>4 2#d6) then 1 else 0 Examples -------- * Count the number of dice greater than 7: count >7 5#d10 * Count the number of dice greater than 7 minus the number of dice equal to 1: let c=5#d10 in (count >7 c)-(count ==1 c) * Count the number of rolls until a 6 is rolled: count (while x=d6 do ((count <6 x)#d6)) * Count the number of rolls until a 6 is rolled, more efficiently: count (while x=(d6/6) do ((count <1 x)#(d6/6))) * Roll attributes for a new D&D character: 6#sum(drop low 1 4#d6) * Roll on the 11..66 morale check table in The Gamers' Civil War Brigade Series: d6.d6 * Find the median of 3 d20s: high 1 low 2 3#d20 * 3d6 with rerolls on 6s: sum(while x=3#d6 do ((count ==6 x)#d6)) * Roll 7 d10 and find the largest sum of identical dice: let x = 7#d10 in high 1 (foreach y in 1..10 do sum (==y x)) * The Fibonacci sequence is defined by Fn = Fn-1 + Fn-2, with F1 = F2 = 1. Calculate the first twenty Fibonacci numbers: let n = 20 in let f = (1,1) in foreach i in 1..n do let f = (f,sum(high 2 f)) in if ==n i then f else () * Risk has battles where the attacker rolls 3d6 and the defender rolls 2d6. The highest attacker die is matched with the highest defender die and the second highest attacker die to the second highest defender die. For both matches, the highest wins, with ties going to the defender. The number of attacker wins: let a = 3#d6 in let b = 2#d6 in count( (<(high 1 a) high 1 b), (<(high 1 low 2 a) low 1 b)) * Storyteller die roll with target number 8 and botches indicated at -1: let c=5#d10 in let succs = count >7 c in let ones = count ==1 c in if >0 succs then high 1 (0,succs-ones) else if >0 ones then -1 else 0 * Combat in Silent Death is rather complex. Three dice are rolled. If their sum is above a target, the roll is a hit. To calculate damage, the same dice are sorted. If all three are equal, all are summed to yield the damage. If the least two are equal, but the third is higher, the high die is the damage. If the two highest are equal, but the third is lower, the two high dice are summed to yield the damage. If all three dice are different, the middle die is the damage. This example assumes that the dice are two d8s and a d10, with a target number of 15: let x = 2#d8,d10 in (count >15 sum x)# let a = low 1 x in // low die let b = high 1 low 2 x in // middle die let c = high 1 x in // high die if ==a ==b c then a+b+c // all equal else if ==a a ==c b then b+c // two high equal else b // all different Documentation ------------- A more in-depth documentation of dicelab and the language can be found in the "Dicelab Manual" that should have been included in your copy of dicelab, or can be gotten from the web site. Credits ------- Dicelab is based on the excellent work "roll" by Torben Mogensen (http://www.diku.dk/~torbenm/Dice.zip). Without his work and comments, this would hardly ever have happened. The current language specification and the extensions to the original language are derived from the work of Joel Uckelman (http://dice.nomic.net/bones.html), most of the documentation is stolen from him as well. This code was written by Robert Lemmen , who would be glad to hear your questions and remarks. dicelab-0.7/INSTALL0000644000175000017500000002245010753463634010733 00000000000000Installation Instructions ************************* Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007 Free Software Foundation, Inc. This file is free documentation; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. Basic Installation ================== Briefly, the shell commands `./configure; make; make install' should configure, build, and install this package. The following more-detailed instructions are generic; see the `README' file for instructions specific to this package. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell script `config.status' that you can run in the future to recreate the current configuration, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). It can also use an optional file (typically called `config.cache' and enabled with `--cache-file=config.cache' or simply `-C') that saves the results of its tests to speed up reconfiguring. Caching is disabled by default to prevent problems with accidental use of stale cache files. If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If you are using the cache, and at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.ac' (or `configure.in') is used to create `configure' by a program called `autoconf'. You need `configure.ac' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. Running `configure' might take a while. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package. 4. Type `make install' to install the programs and any data files and documentation. 5. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. 6. Often, you can also type `make uninstall' to remove the installed files again. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' script does not know about. Run `./configure --help' for details on some of the pertinent environment variables. You can give `configure' initial values for configuration parameters by setting variables in the command line or in the environment. Here is an example: ./configure CC=c99 CFLAGS=-g LIBS=-lposix *Note Defining Variables::, for more details. Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you can use GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' script. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. With a non-GNU `make', it is safer to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. Installation Names ================== By default, `make install' installs the package's commands under `/usr/local/bin', include files under `/usr/local/include', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PREFIX'. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you pass the option `--exec-prefix=PREFIX' to `configure', the package uses PREFIX as the prefix for installing programs and libraries. Documentation and other data files still use the regular prefix. In addition, if you use an unusual directory layout you can give options like `--bindir=DIR' to specify different values for particular kinds of files. Run `configure --help' for a list of the directories you can set and what kinds of files go in them. If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Optional Features ================= Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Specifying the System Type ========================== There may be some features `configure' cannot figure out automatically, but needs to determine by the type of machine the package will run on. Usually, assuming the package is built to be run on the _same_ architectures, `configure' can figure that out, but if it prints a message saying it cannot guess the machine type, give it the `--build=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name which has the form: CPU-COMPANY-SYSTEM where SYSTEM can have one of these forms: OS KERNEL-OS See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the machine type. If you are _building_ compiler tools for cross-compiling, you should use the option `--target=TYPE' to select the type of system they will produce code for. If you want to _use_ a cross compiler, that generates code for a platform different from the build platform, you should specify the "host" platform (i.e., that on which the generated programs will eventually be run) with `--host=TYPE'. Sharing Defaults ================ If you want to set default values for `configure' scripts to share, you can create a site shell script called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site script. A warning: not all `configure' scripts look for a site script. Defining Variables ================== Variables not defined in a site shell script can be set in the environment passed to `configure'. However, some packages may run configure again during the build, and the customized values of these variables may be lost. In order to avoid this problem, you should set them in the `configure' command line, using `VAR=value'. For example: ./configure CC=/usr/local2/bin/gcc causes the specified `gcc' to be used as the C compiler (unless it is overridden in the site shell script). Unfortunately, this technique does not work for `CONFIG_SHELL' due to an Autoconf bug. Until the bug is fixed you can use this workaround: CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash `configure' Invocation ====================== `configure' recognizes the following options to control how it operates. `--help' `-h' Print a summary of the options to `configure', and exit. `--version' `-V' Print the version of Autoconf used to generate the `configure' script, and exit. `--cache-file=FILE' Enable the cache: use and save the results of the tests in FILE, traditionally `config.cache'. FILE defaults to `/dev/null' to disable caching. `--config-cache' `-C' Alias for `--cache-file=config.cache'. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to `/dev/null' (any error messages will still be shown). `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `configure' also accepts some other, not widely useful, options. Run `configure --help' for more details. dicelab-0.7/NEWS0000644000175000017500000000004611303206024010352 00000000000000see "ChangeLog" for a list of changes dicelab-0.7/par.c0000644000175000017500000017756111303206450010625 00000000000000/* A Bison parser, made by GNU Bison 2.3. */ /* Skeleton implementation for Bison's Yacc-like parsers in C Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ /* As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception. This special exception was added by the Free Software Foundation in version 2.2 of Bison. */ /* C LALR(1) parser skeleton written by Richard Stallman, by simplifying the original so-called "semantic" parser. */ /* All symbols defined below should begin with yy or YY, to avoid infringing on user name space. This should be done even for local variables, as they might otherwise be expanded by user macros. There are some unavoidable exceptions within include files to define necessary library symbols; they are noted "INFRINGES ON USER NAME SPACE" below. */ /* Identify Bison output. */ #define YYBISON 1 /* Bison version. */ #define YYBISON_VERSION "2.3" /* Skeleton name. */ #define YYSKELETON_NAME "yacc.c" /* Pure parsers. */ #define YYPURE 0 /* Using locations. */ #define YYLSP_NEEDED 0 /* Tokens. */ #ifndef YYTOKENTYPE # define YYTOKENTYPE /* Put the tokens into the symbol table, so that GDB and other debuggers know about them. */ enum yytokentype { NUMBER = 258, VARIABLE = 259, IN = 260, DO = 261, WHILE = 262, ELSE = 263, RANGE = 264, EQ = 265, NE = 266, LT = 267, GT = 268, LE = 269, GE = 270, SUM = 271, PROD = 272, COUNT = 273, LOW = 274, HIGH = 275, DICE = 276, PERM = 277, SORT = 278, REV = 279, DROP = 280, KEEP = 281, FIRST = 282, LAST = 283, LET = 284, FOREACH = 285, IF = 286, THEN = 287 }; #endif /* Tokens. */ #define NUMBER 258 #define VARIABLE 259 #define IN 260 #define DO 261 #define WHILE 262 #define ELSE 263 #define RANGE 264 #define EQ 265 #define NE 266 #define LT 267 #define GT 268 #define LE 269 #define GE 270 #define SUM 271 #define PROD 272 #define COUNT 273 #define LOW 274 #define HIGH 275 #define DICE 276 #define PERM 277 #define SORT 278 #define REV 279 #define DROP 280 #define KEEP 281 #define FIRST 282 #define LAST 283 #define LET 284 #define FOREACH 285 #define IF 286 #define THEN 287 /* Copy the first part of user declarations. */ #line 1 "par.y" #include #include #include #include "util.h" #include "tree.h" int yylex(); int yyerror(char *s); int yyget_lineno(); char *filename = ""; extern int cmd_parse_tree; extern int cmd_roll; extern int cmd_rolleval; extern int cmd_calc; extern int cmd_count; int cmplist(const void *p1, const void *p2) { return ((struct val_list*)p1)->values[0] - ((struct val_list*)p2)->values[0]; } /* XXX use qsort from libc, but for some reason this segfaults void list_quicksort(struct val_list **data, int start, int end) { qsort(&data[start], end-start+1, sizeof(struct val_list*), cmplist); }*/ void list_quicksort(struct val_list **data, int start, int end) { if (end > start) { int i=start-1; int j = end; struct val_list *t; for(;;) { while(cmplist(data[++i], data[end]) < 0); while(cmplist(data[--j >= 0 ? j : end], data[end]) > 0); if (i>=j) break; t = data[i]; data[i] = data[j]; data[j] = t; } t = data[i]; data[i] = data[end]; data[end] = t; list_quicksort(data, start, i-1); list_quicksort(data, i+1, end); } } struct val_list *list_sort(struct val_list *list) { int count = 0; struct val_list *cl = list; // count the list while (cl) { count++; cl = cl->next; } // create an array struct val_list **hash = (struct val_list**)malloc( sizeof(struct val_list*) * count); int i = 0; cl = list; while (cl) { hash[i] = cl; cl = cl->next; i++; } // now sort the hash list_quicksort(hash, 0, count-1); for (i = 0; i < count-1; i++) { hash[i]->next = hash[i+1]; } hash[count-1]->next = NULL; cl = hash[0]; free(hash); return cl; } /* Enabling traces. */ #ifndef YYDEBUG # define YYDEBUG 0 #endif /* Enabling verbose error messages. */ #ifdef YYERROR_VERBOSE # undef YYERROR_VERBOSE # define YYERROR_VERBOSE 1 #else # define YYERROR_VERBOSE 1 #endif /* Enabling the token table. */ #ifndef YYTOKEN_TABLE # define YYTOKEN_TABLE 0 #endif #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED typedef union YYSTYPE #line 88 "par.y" { int ival; char *tval; expression *expr; } /* Line 187 of yacc.c. */ #line 252 "par.c" YYSTYPE; # define yystype YYSTYPE /* obsolescent; will be withdrawn */ # define YYSTYPE_IS_DECLARED 1 # define YYSTYPE_IS_TRIVIAL 1 #endif /* Copy the second part of user declarations. */ /* Line 216 of yacc.c. */ #line 265 "par.c" #ifdef short # undef short #endif #ifdef YYTYPE_UINT8 typedef YYTYPE_UINT8 yytype_uint8; #else typedef unsigned char yytype_uint8; #endif #ifdef YYTYPE_INT8 typedef YYTYPE_INT8 yytype_int8; #elif (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) typedef signed char yytype_int8; #else typedef short int yytype_int8; #endif #ifdef YYTYPE_UINT16 typedef YYTYPE_UINT16 yytype_uint16; #else typedef unsigned short int yytype_uint16; #endif #ifdef YYTYPE_INT16 typedef YYTYPE_INT16 yytype_int16; #else typedef short int yytype_int16; #endif #ifndef YYSIZE_T # ifdef __SIZE_TYPE__ # define YYSIZE_T __SIZE_TYPE__ # elif defined size_t # define YYSIZE_T size_t # elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) # include /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # else # define YYSIZE_T unsigned int # endif #endif #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) #ifndef YY_ # if YYENABLE_NLS # if ENABLE_NLS # include /* INFRINGES ON USER NAME SPACE */ # define YY_(msgid) dgettext ("bison-runtime", msgid) # endif # endif # ifndef YY_ # define YY_(msgid) msgid # endif #endif /* Suppress unused-variable warnings by "using" E. */ #if ! defined lint || defined __GNUC__ # define YYUSE(e) ((void) (e)) #else # define YYUSE(e) /* empty */ #endif /* Identity function, used to suppress warnings about constant conditions. */ #ifndef lint # define YYID(n) (n) #else #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static int YYID (int i) #else static int YYID (i) int i; #endif { return i; } #endif #if ! defined yyoverflow || YYERROR_VERBOSE /* The parser invokes alloca or malloc; define the necessary symbols. */ # ifdef YYSTACK_USE_ALLOCA # if YYSTACK_USE_ALLOCA # ifdef __GNUC__ # define YYSTACK_ALLOC __builtin_alloca # elif defined __BUILTIN_VA_ARG_INCR # include /* INFRINGES ON USER NAME SPACE */ # elif defined _AIX # define YYSTACK_ALLOC __alloca # elif defined _MSC_VER # include /* INFRINGES ON USER NAME SPACE */ # define alloca _alloca # else # define YYSTACK_ALLOC alloca # if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) # include /* INFRINGES ON USER NAME SPACE */ # ifndef _STDLIB_H # define _STDLIB_H 1 # endif # endif # endif # endif # endif # ifdef YYSTACK_ALLOC /* Pacify GCC's `empty if-body' warning. */ # define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0)) # ifndef YYSTACK_ALLOC_MAXIMUM /* The OS might guarantee only one guard page at the bottom of the stack, and a page size can be as small as 4096 bytes. So we cannot safely invoke alloca (N) if N exceeds 4096. Use a slightly smaller number to allow for a few compiler-allocated temporary stack slots. */ # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ # endif # else # define YYSTACK_ALLOC YYMALLOC # define YYSTACK_FREE YYFREE # ifndef YYSTACK_ALLOC_MAXIMUM # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM # endif # if (defined __cplusplus && ! defined _STDLIB_H \ && ! ((defined YYMALLOC || defined malloc) \ && (defined YYFREE || defined free))) # include /* INFRINGES ON USER NAME SPACE */ # ifndef _STDLIB_H # define _STDLIB_H 1 # endif # endif # ifndef YYMALLOC # define YYMALLOC malloc # if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ # endif # endif # ifndef YYFREE # define YYFREE free # if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) void free (void *); /* INFRINGES ON USER NAME SPACE */ # endif # endif # endif #endif /* ! defined yyoverflow || YYERROR_VERBOSE */ #if (! defined yyoverflow \ && (! defined __cplusplus \ || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) /* A type that is properly aligned for any stack member. */ union yyalloc { yytype_int16 yyss; YYSTYPE yyvs; }; /* The size of the maximum gap between one aligned stack and the next. */ # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) /* The size of an array large to enough to hold all stacks, each with N elements. */ # define YYSTACK_BYTES(N) \ ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ + YYSTACK_GAP_MAXIMUM) /* Copy COUNT objects from FROM to TO. The source and destination do not overlap. */ # ifndef YYCOPY # if defined __GNUC__ && 1 < __GNUC__ # define YYCOPY(To, From, Count) \ __builtin_memcpy (To, From, (Count) * sizeof (*(From))) # else # define YYCOPY(To, From, Count) \ do \ { \ YYSIZE_T yyi; \ for (yyi = 0; yyi < (Count); yyi++) \ (To)[yyi] = (From)[yyi]; \ } \ while (YYID (0)) # endif # endif /* Relocate STACK from its old location to the new one. The local variables YYSIZE and YYSTACKSIZE give the old and new number of elements in the stack, and YYPTR gives the new location of the stack. Advance YYPTR to a properly aligned location for the next stack. */ # define YYSTACK_RELOCATE(Stack) \ do \ { \ YYSIZE_T yynewbytes; \ YYCOPY (&yyptr->Stack, Stack, yysize); \ Stack = &yyptr->Stack; \ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ yyptr += yynewbytes / sizeof (*yyptr); \ } \ while (YYID (0)) #endif /* YYFINAL -- State number of the termination state. */ #define YYFINAL 81 /* YYLAST -- Last index in YYTABLE. */ #define YYLAST 349 /* YYNTOKENS -- Number of terminals. */ #define YYNTOKENS 46 /* YYNNTS -- Number of nonterminals. */ #define YYNNTS 7 /* YYNRULES -- Number of rules. */ #define YYNRULES 65 /* YYNRULES -- Number of states. */ #define YYNSTATES 173 /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ #define YYUNDEFTOK 2 #define YYMAXUTOK 287 #define YYTRANSLATE(YYX) \ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ static const yytype_uint8 yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 28, 2, 22, 2, 2, 43, 44, 20, 17, 10, 18, 19, 21, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 42, 2, 45, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 29, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41 }; #if YYDEBUG /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in YYRHS. */ static const yytype_uint16 yyprhs[] = { 0, 0, 3, 5, 9, 12, 14, 16, 18, 20, 22, 26, 29, 33, 37, 41, 45, 49, 53, 57, 60, 63, 66, 69, 73, 77, 80, 84, 88, 91, 94, 97, 99, 106, 113, 120, 127, 132, 137, 141, 146, 151, 155, 160, 165, 169, 174, 179, 183, 188, 193, 197, 202, 207, 211, 216, 221, 225, 230, 235, 239, 244, 249, 253, 258, 263 }; /* YYRHS -- A `-1'-separated list of the rules' RHS. */ static const yytype_int8 yyrhs[] = { 47, 0, -1, 48, -1, 47, 42, 48, -1, 47, 42, -1, 49, -1, 50, -1, 51, -1, 3, -1, 4, -1, 43, 50, 44, -1, 18, 50, -1, 50, 17, 50, -1, 50, 18, 50, -1, 50, 20, 50, -1, 50, 21, 50, -1, 50, 22, 50, -1, 50, 29, 50, -1, 50, 19, 50, -1, 30, 50, -1, 23, 49, -1, 24, 49, -1, 25, 49, -1, 50, 28, 49, -1, 43, 51, 44, -1, 43, 44, -1, 50, 9, 50, -1, 49, 10, 49, -1, 31, 49, -1, 32, 49, -1, 33, 49, -1, 52, -1, 40, 49, 41, 49, 8, 49, -1, 38, 4, 45, 49, 5, 49, -1, 7, 4, 45, 49, 6, 49, -1, 39, 4, 5, 49, 6, 49, -1, 34, 36, 49, 49, -1, 35, 36, 49, 49, -1, 36, 49, 49, -1, 34, 37, 49, 49, -1, 35, 37, 49, 49, -1, 37, 49, 49, -1, 34, 27, 49, 49, -1, 35, 27, 49, 49, -1, 27, 49, 49, -1, 34, 26, 49, 49, -1, 35, 26, 49, 49, -1, 26, 49, 49, -1, 34, 11, 49, 49, -1, 35, 11, 49, 49, -1, 11, 49, 49, -1, 34, 12, 49, 49, -1, 35, 12, 49, 49, -1, 12, 49, 49, -1, 34, 14, 49, 49, -1, 35, 14, 49, 49, -1, 14, 49, 49, -1, 34, 13, 49, 49, -1, 35, 13, 49, 49, -1, 13, 49, 49, -1, 34, 16, 49, 49, -1, 35, 16, 49, 49, -1, 16, 49, 49, -1, 34, 15, 49, 49, -1, 35, 15, 49, 49, -1, 15, 49, 49, -1 }; /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ static const yytype_uint16 yyrline[] = { 0, 117, 117, 118, 119, 122, 193, 194, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258 }; #endif #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { "$end", "error", "$undefined", "NUMBER", "VARIABLE", "IN", "DO", "WHILE", "ELSE", "RANGE", "','", "EQ", "NE", "LT", "GT", "LE", "GE", "'+'", "'-'", "'.'", "'*'", "'/'", "'%'", "SUM", "PROD", "COUNT", "LOW", "HIGH", "'#'", "'^'", "DICE", "PERM", "SORT", "REV", "DROP", "KEEP", "FIRST", "LAST", "LET", "FOREACH", "IF", "THEN", "';'", "'('", "')'", "'='", "$accept", "input", "pexpr", "expr", "scalar", "list", "filter", 0 }; #endif # ifdef YYPRINT /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to token YYLEX-NUM. */ static const yytype_uint16 yytoknum[] = { 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, 44, 265, 266, 267, 268, 269, 270, 43, 45, 46, 42, 47, 37, 271, 272, 273, 274, 275, 35, 94, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 59, 40, 41, 61 }; # endif /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ static const yytype_uint8 yyr1[] = { 0, 46, 47, 47, 47, 48, 49, 49, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52 }; /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ static const yytype_uint8 yyr2[] = { 0, 2, 1, 3, 2, 1, 1, 1, 1, 1, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 2, 1, 6, 6, 6, 6, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3 }; /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state STATE-NUM when YYTABLE doesn't specify something else to do. Zero means the default is an error. */ static const yytype_uint8 yydefact[] = { 0, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 5, 6, 7, 31, 0, 0, 0, 0, 0, 0, 0, 0, 11, 20, 21, 22, 0, 0, 19, 28, 29, 30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 0, 6, 7, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 50, 53, 59, 56, 65, 62, 0, 47, 44, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 41, 0, 0, 0, 10, 24, 3, 27, 26, 12, 13, 18, 14, 15, 16, 23, 17, 0, 48, 51, 57, 54, 63, 60, 45, 42, 36, 39, 49, 52, 58, 55, 64, 61, 46, 43, 37, 40, 0, 0, 0, 0, 0, 0, 0, 34, 33, 35, 32 }; /* YYDEFGOTO[NTERM-NUM]. */ static const yytype_int8 yydefgoto[] = { -1, 28, 29, 30, 31, 32, 33 }; /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing STATE-NUM. */ #define YYPACT_NINF -5 static const yytype_int16 yypact[] = { 237, -5, -5, 2, 237, 237, 237, 237, 237, 237, 275, 237, 237, 237, 237, 237, 275, 237, 237, 237, 115, 270, 237, 237, 22, 26, 237, 142, 28, -5, 30, 306, -5, -5, -1, 199, 199, 199, 199, 199, 199, 275, 17, 30, 30, 30, 199, 199, -5, 30, 30, 30, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 237, 199, 199, 0, 36, 6, -5, 30, 292, 33, -5, 237, 237, 275, 275, 275, 275, 275, 275, 275, 237, 275, 237, 30, 30, 30, 30, 30, 30, 54, 30, 30, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 199, 30, 30, 237, 237, 237, -5, -5, -5, 30, 320, 17, 17, 17, 49, 49, 49, -5, 49, 14, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 7, 15, 19, 237, 237, 237, 237, 30, 30, 30, 30 }; /* YYPGOTO[NTERM-NUM]. */ static const yytype_int8 yypgoto[] = { -5, -5, -2, -4, 109, 55, -5 }; /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If positive, shift that token. If negative, reduce the rule which number is the opposite. If zero, do what YYDEFACT says. If YYTABLE_NINF, syntax error. */ #define YYTABLE_NINF -1 static const yytype_uint8 yytable[] = { 35, 36, 37, 38, 39, 40, 34, 43, 44, 45, 46, 47, 166, 49, 50, 51, 83, 83, 72, 73, 165, 167, 76, 78, 83, 83, 74, 168, 81, 83, 75, 94, 95, 96, 97, 98, 99, 88, 89, 90, 83, 126, 101, 102, 93, 125, 92, 127, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 82, 85, 86, 87, 88, 89, 90, 129, 92, 131, 130, 0, 80, 92, 0, 0, 0, 139, 0, 141, 0, 0, 0, 0, 0, 0, 0, 0, 128, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 42, 0, 162, 163, 164, 0, 48, 52, 53, 54, 55, 56, 57, 0, 0, 0, 0, 79, 0, 0, 0, 0, 58, 59, 0, 0, 1, 2, 0, 0, 3, 100, 60, 61, 4, 5, 6, 7, 8, 9, 0, 10, 169, 170, 171, 172, 11, 12, 13, 14, 15, 0, 0, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 0, 0, 27, 77, 0, 0, 0, 0, 0, 0, 132, 133, 134, 135, 136, 137, 138, 0, 140, 1, 2, 0, 0, 3, 0, 0, 83, 4, 5, 6, 7, 8, 9, 0, 10, 0, 0, 0, 0, 11, 12, 13, 14, 15, 0, 0, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 1, 2, 27, 0, 3, 0, 0, 0, 4, 5, 6, 7, 8, 9, 0, 10, 0, 0, 0, 0, 11, 12, 13, 14, 15, 0, 0, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 1, 2, 27, 62, 63, 64, 65, 66, 67, 0, 0, 0, 0, 0, 0, 10, 0, 0, 68, 69, 11, 12, 13, 84, 0, 0, 0, 16, 70, 71, 0, 85, 86, 87, 88, 89, 90, 84, 0, 0, 41, 0, 91, 92, 0, 85, 86, 87, 88, 89, 90, 0, 0, 0, 0, 0, 91, 92, 128, 85, 86, 87, 88, 89, 90, 0, 0, 0, 0, 0, 0, 92 }; static const yytype_int16 yycheck[] = { 4, 5, 6, 7, 8, 9, 4, 11, 12, 13, 14, 15, 5, 17, 18, 19, 10, 10, 22, 23, 6, 6, 26, 27, 10, 10, 4, 8, 0, 10, 4, 35, 36, 37, 38, 39, 40, 20, 21, 22, 10, 5, 46, 47, 45, 45, 29, 41, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 42, 17, 18, 19, 20, 21, 22, 44, 29, 83, 82, -1, 27, 29, -1, -1, -1, 91, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 44, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 10, -1, 125, 126, 127, -1, 16, 11, 12, 13, 14, 15, 16, -1, -1, -1, -1, 27, -1, -1, -1, -1, 26, 27, -1, -1, 3, 4, -1, -1, 7, 41, 36, 37, 11, 12, 13, 14, 15, 16, -1, 18, 165, 166, 167, 168, 23, 24, 25, 26, 27, -1, -1, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, -1, -1, 43, 44, -1, -1, -1, -1, -1, -1, 84, 85, 86, 87, 88, 89, 90, -1, 92, 3, 4, -1, -1, 7, -1, -1, 10, 11, 12, 13, 14, 15, 16, -1, 18, -1, -1, -1, -1, 23, 24, 25, 26, 27, -1, -1, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 3, 4, 43, -1, 7, -1, -1, -1, 11, 12, 13, 14, 15, 16, -1, 18, -1, -1, -1, -1, 23, 24, 25, 26, 27, -1, -1, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 3, 4, 43, 11, 12, 13, 14, 15, 16, -1, -1, -1, -1, -1, -1, 18, -1, -1, 26, 27, 23, 24, 25, 9, -1, -1, -1, 30, 36, 37, -1, 17, 18, 19, 20, 21, 22, 9, -1, -1, 43, -1, 28, 29, -1, 17, 18, 19, 20, 21, 22, -1, -1, -1, -1, -1, 28, 29, 44, 17, 18, 19, 20, 21, 22, -1, -1, -1, -1, -1, -1, 29 }; /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing symbol of state STATE-NUM. */ static const yytype_uint8 yystos[] = { 0, 3, 4, 7, 11, 12, 13, 14, 15, 16, 18, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 43, 47, 48, 49, 50, 51, 52, 4, 49, 49, 49, 49, 49, 49, 43, 50, 49, 49, 49, 49, 49, 50, 49, 49, 49, 11, 12, 13, 14, 15, 16, 26, 27, 36, 37, 11, 12, 13, 14, 15, 16, 26, 27, 36, 37, 49, 49, 4, 4, 49, 44, 49, 50, 51, 0, 42, 10, 9, 17, 18, 19, 20, 21, 22, 28, 29, 45, 49, 49, 49, 49, 49, 49, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 45, 5, 41, 44, 44, 48, 49, 50, 50, 50, 50, 50, 50, 50, 49, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 6, 5, 6, 8, 49, 49, 49, 49 }; #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY (-2) #define YYEOF 0 #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrorlab /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { \ yychar = (Token); \ yylval = (Value); \ yytoken = YYTRANSLATE (yychar); \ YYPOPSTACK (1); \ goto yybackup; \ } \ else \ { \ yyerror (YY_("syntax error: cannot back up")); \ YYERROR; \ } \ while (YYID (0)) #define YYTERROR 1 #define YYERRCODE 256 /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. If N is 0, then set CURRENT to the empty location which ends the previous symbol: RHS[0] (always defined). */ #define YYRHSLOC(Rhs, K) ((Rhs)[K]) #ifndef YYLLOC_DEFAULT # define YYLLOC_DEFAULT(Current, Rhs, N) \ do \ if (YYID (N)) \ { \ (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ } \ else \ { \ (Current).first_line = (Current).last_line = \ YYRHSLOC (Rhs, 0).last_line; \ (Current).first_column = (Current).last_column = \ YYRHSLOC (Rhs, 0).last_column; \ } \ while (YYID (0)) #endif /* YY_LOCATION_PRINT -- Print the location on the stream. This macro was not mandated originally: define only if we know we won't break user code: when these are the locations we know. */ #ifndef YY_LOCATION_PRINT # if YYLTYPE_IS_TRIVIAL # define YY_LOCATION_PRINT(File, Loc) \ fprintf (File, "%d.%d-%d.%d", \ (Loc).first_line, (Loc).first_column, \ (Loc).last_line, (Loc).last_column) # else # define YY_LOCATION_PRINT(File, Loc) ((void) 0) # endif #endif /* YYLEX -- calling `yylex' with the right arguments. */ #ifdef YYLEX_PARAM # define YYLEX yylex (YYLEX_PARAM) #else # define YYLEX yylex () #endif /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF # include /* INFRINGES ON USER NAME SPACE */ # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (YYID (0)) # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ do { \ if (yydebug) \ { \ YYFPRINTF (stderr, "%s ", Title); \ yy_symbol_print (stderr, \ Type, Value); \ YYFPRINTF (stderr, "\n"); \ } \ } while (YYID (0)) /*--------------------------------. | Print this symbol on YYOUTPUT. | `--------------------------------*/ /*ARGSUSED*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) #else static void yy_symbol_value_print (yyoutput, yytype, yyvaluep) FILE *yyoutput; int yytype; YYSTYPE const * const yyvaluep; #endif { if (!yyvaluep) return; # ifdef YYPRINT if (yytype < YYNTOKENS) YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); # else YYUSE (yyoutput); # endif switch (yytype) { default: break; } } /*--------------------------------. | Print this symbol on YYOUTPUT. | `--------------------------------*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) #else static void yy_symbol_print (yyoutput, yytype, yyvaluep) FILE *yyoutput; int yytype; YYSTYPE const * const yyvaluep; #endif { if (yytype < YYNTOKENS) YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); else YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); yy_symbol_value_print (yyoutput, yytype, yyvaluep); YYFPRINTF (yyoutput, ")"); } /*------------------------------------------------------------------. | yy_stack_print -- Print the state stack from its BOTTOM up to its | | TOP (included). | `------------------------------------------------------------------*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void yy_stack_print (yytype_int16 *bottom, yytype_int16 *top) #else static void yy_stack_print (bottom, top) yytype_int16 *bottom; yytype_int16 *top; #endif { YYFPRINTF (stderr, "Stack now"); for (; bottom <= top; ++bottom) YYFPRINTF (stderr, " %d", *bottom); YYFPRINTF (stderr, "\n"); } # define YY_STACK_PRINT(Bottom, Top) \ do { \ if (yydebug) \ yy_stack_print ((Bottom), (Top)); \ } while (YYID (0)) /*------------------------------------------------. | Report that the YYRULE is going to be reduced. | `------------------------------------------------*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void yy_reduce_print (YYSTYPE *yyvsp, int yyrule) #else static void yy_reduce_print (yyvsp, yyrule) YYSTYPE *yyvsp; int yyrule; #endif { int yynrhs = yyr2[yyrule]; int yyi; unsigned long int yylno = yyrline[yyrule]; YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", yyrule - 1, yylno); /* The symbols being reduced. */ for (yyi = 0; yyi < yynrhs; yyi++) { fprintf (stderr, " $%d = ", yyi + 1); yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], &(yyvsp[(yyi + 1) - (yynrhs)]) ); fprintf (stderr, "\n"); } } # define YY_REDUCE_PRINT(Rule) \ do { \ if (yydebug) \ yy_reduce_print (yyvsp, Rule); \ } while (YYID (0)) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) # define YY_SYMBOL_PRINT(Title, Type, Value, Location) # define YY_STACK_PRINT(Bottom, Top) # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif #if YYERROR_VERBOSE # ifndef yystrlen # if defined __GLIBC__ && defined _STRING_H # define yystrlen strlen # else /* Return the length of YYSTR. */ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static YYSIZE_T yystrlen (const char *yystr) #else static YYSIZE_T yystrlen (yystr) const char *yystr; #endif { YYSIZE_T yylen; for (yylen = 0; yystr[yylen]; yylen++) continue; return yylen; } # endif # endif # ifndef yystpcpy # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE # define yystpcpy stpcpy # else /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in YYDEST. */ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static char * yystpcpy (char *yydest, const char *yysrc) #else static char * yystpcpy (yydest, yysrc) char *yydest; const char *yysrc; #endif { char *yyd = yydest; const char *yys = yysrc; while ((*yyd++ = *yys++) != '\0') continue; return yyd - 1; } # endif # endif # ifndef yytnamerr /* Copy to YYRES the contents of YYSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for yyerror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). YYSTR is taken from yytname. If YYRES is null, do not copy; instead, return the length of what the result would have been. */ static YYSIZE_T yytnamerr (char *yyres, const char *yystr) { if (*yystr == '"') { YYSIZE_T yyn = 0; char const *yyp = yystr; for (;;) switch (*++yyp) { case '\'': case ',': goto do_not_strip_quotes; case '\\': if (*++yyp != '\\') goto do_not_strip_quotes; /* Fall through. */ default: if (yyres) yyres[yyn] = *yyp; yyn++; break; case '"': if (yyres) yyres[yyn] = '\0'; return yyn; } do_not_strip_quotes: ; } if (! yyres) return yystrlen (yystr); return yystpcpy (yyres, yystr) - yyres; } # endif /* Copy into YYRESULT an error message about the unexpected token YYCHAR while in state YYSTATE. Return the number of bytes copied, including the terminating null byte. If YYRESULT is null, do not copy anything; just return the number of bytes that would be copied. As a special case, return 0 if an ordinary "syntax error" message will do. Return YYSIZE_MAXIMUM if overflow occurs during size calculation. */ static YYSIZE_T yysyntax_error (char *yyresult, int yystate, int yychar) { int yyn = yypact[yystate]; if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) return 0; else { int yytype = YYTRANSLATE (yychar); YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); YYSIZE_T yysize = yysize0; YYSIZE_T yysize1; int yysize_overflow = 0; enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; int yyx; # if 0 /* This is so xgettext sees the translatable formats that are constructed on the fly. */ YY_("syntax error, unexpected %s"); YY_("syntax error, unexpected %s, expecting %s"); YY_("syntax error, unexpected %s, expecting %s or %s"); YY_("syntax error, unexpected %s, expecting %s or %s or %s"); YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); # endif char *yyfmt; char const *yyf; static char const yyunexpected[] = "syntax error, unexpected %s"; static char const yyexpecting[] = ", expecting %s"; static char const yyor[] = " or %s"; char yyformat[sizeof yyunexpected + sizeof yyexpecting - 1 + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) * (sizeof yyor - 1))]; char const *yyprefix = yyexpecting; /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. */ int yyxbegin = yyn < 0 ? -yyn : 0; /* Stay within bounds of both yycheck and yytname. */ int yychecklim = YYLAST - yyn + 1; int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; int yycount = 1; yyarg[0] = yytname[yytype]; yyfmt = yystpcpy (yyformat, yyunexpected); for (yyx = yyxbegin; yyx < yyxend; ++yyx) if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) { if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) { yycount = 1; yysize = yysize0; yyformat[sizeof yyunexpected - 1] = '\0'; break; } yyarg[yycount++] = yytname[yyx]; yysize1 = yysize + yytnamerr (0, yytname[yyx]); yysize_overflow |= (yysize1 < yysize); yysize = yysize1; yyfmt = yystpcpy (yyfmt, yyprefix); yyprefix = yyor; } yyf = YY_(yyformat); yysize1 = yysize + yystrlen (yyf); yysize_overflow |= (yysize1 < yysize); yysize = yysize1; if (yysize_overflow) return YYSIZE_MAXIMUM; if (yyresult) { /* Avoid sprintf, as that infringes on the user's name space. Don't have undefined behavior even if the translation produced a string with the wrong number of "%s"s. */ char *yyp = yyresult; int yyi = 0; while ((*yyp = *yyf) != '\0') { if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) { yyp += yytnamerr (yyp, yyarg[yyi++]); yyf += 2; } else { yyp++; yyf++; } } } return yysize; } } #endif /* YYERROR_VERBOSE */ /*-----------------------------------------------. | Release the memory associated to this symbol. | `-----------------------------------------------*/ /*ARGSUSED*/ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) static void yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) #else static void yydestruct (yymsg, yytype, yyvaluep) const char *yymsg; int yytype; YYSTYPE *yyvaluep; #endif { YYUSE (yyvaluep); if (!yymsg) yymsg = "Deleting"; YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); switch (yytype) { default: break; } } /* Prevent warnings from -Wmissing-prototypes. */ #ifdef YYPARSE_PARAM #if defined __STDC__ || defined __cplusplus int yyparse (void *YYPARSE_PARAM); #else int yyparse (); #endif #else /* ! YYPARSE_PARAM */ #if defined __STDC__ || defined __cplusplus int yyparse (void); #else int yyparse (); #endif #endif /* ! YYPARSE_PARAM */ /* The look-ahead symbol. */ int yychar; /* The semantic value of the look-ahead symbol. */ YYSTYPE yylval; /* Number of syntax errors so far. */ int yynerrs; /*----------. | yyparse. | `----------*/ #ifdef YYPARSE_PARAM #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) int yyparse (void *YYPARSE_PARAM) #else int yyparse (YYPARSE_PARAM) void *YYPARSE_PARAM; #endif #else /* ! YYPARSE_PARAM */ #if (defined __STDC__ || defined __C99__FUNC__ \ || defined __cplusplus || defined _MSC_VER) int yyparse (void) #else int yyparse () #endif #endif { int yystate; int yyn; int yyresult; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* Look-ahead token as an internal (translated) token number. */ int yytoken = 0; #if YYERROR_VERBOSE /* Buffer for error messages, and its allocated size. */ char yymsgbuf[128]; char *yymsg = yymsgbuf; YYSIZE_T yymsg_alloc = sizeof yymsgbuf; #endif /* Three stacks and their tools: `yyss': related to states, `yyvs': related to semantic values, `yyls': related to locations. Refer to the stacks thru separate pointers, to allow yyoverflow to reallocate them elsewhere. */ /* The state stack. */ yytype_int16 yyssa[YYINITDEPTH]; yytype_int16 *yyss = yyssa; yytype_int16 *yyssp; /* The semantic value stack. */ YYSTYPE yyvsa[YYINITDEPTH]; YYSTYPE *yyvs = yyvsa; YYSTYPE *yyvsp; #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) YYSIZE_T yystacksize = YYINITDEPTH; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; /* The number of symbols on the RHS of the reduced rule. Keep to zero when no symbol should be popped. */ int yylen = 0; YYDPRINTF ((stderr, "Starting parse\n")); yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss; yyvsp = yyvs; goto yysetstate; /*------------------------------------------------------------. | yynewstate -- Push a new state, which is found in yystate. | `------------------------------------------------------------*/ yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. So pushing a state here evens the stacks. */ yyssp++; yysetstate: *yyssp = yystate; if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; #ifdef yyoverflow { /* Give user a chance to reallocate the stack. Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; yytype_int16 *yyss1 = yyss; /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow (YY_("memory exhausted"), &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ # ifndef YYSTACK_RELOCATE goto yyexhaustedlab; # else /* Extend the stack our own way. */ if (YYMAXDEPTH <= yystacksize) goto yyexhaustedlab; yystacksize *= 2; if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { yytype_int16 *yyss1 = yyss; union yyalloc *yyptr = (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyexhaustedlab; YYSTACK_RELOCATE (yyss); YYSTACK_RELOCATE (yyvs); # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); if (yyss + yystacksize - 1 <= yyssp) YYABORT; } YYDPRINTF ((stderr, "Entering state %d\n", yystate)); goto yybackup; /*-----------. | yybackup. | `-----------*/ yybackup: /* Do appropriate processing given the current state. Read a look-ahead token if we need one and don't already have one. */ /* First try to decide what to do without reference to look-ahead token. */ yyn = yypact[yystate]; if (yyn == YYPACT_NINF) goto yydefault; /* Not known => get a look-ahead token if don't already have one. */ /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = YYLEX; } if (yychar <= YYEOF) { yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } /* If the proper action on seeing token YYTOKEN is to reduce or to detect an error, take that action. */ yyn += yytoken; if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; if (yyn <= 0) { if (yyn == 0 || yyn == YYTABLE_NINF) goto yyerrlab; yyn = -yyn; goto yyreduce; } if (yyn == YYFINAL) YYACCEPT; /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; /* Shift the look-ahead token. */ YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); /* Discard the shifted token unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; yystate = yyn; *++yyvsp = yylval; goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; /* If YYLEN is nonzero, implement the default value of the action: `$$ = $1'. Otherwise, the following line sets YYVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; YY_REDUCE_PRINT (yyn); switch (yyn) { case 5: #line 122 "par.y" { if (cmd_parse_tree) { printtree((yyvsp[(1) - (1)].expr), 0); } if (cmd_roll) { int i; struct symtab *st = NULL; set_symtab((yyvsp[(1) - (1)].expr), st); struct roll_value *rv = roll((yyvsp[(1) - (1)].expr)); for (i = 0; i < rv->count; i++) { printf("%i ", rv->values[i]); } printf("\n"); free_roll(rv); } if (cmd_calc) { struct symtab *st = NULL; (yyvsp[(1) - (1)].expr) = optimize((yyvsp[(1) - (1)].expr)); set_symtab((yyvsp[(1) - (1)].expr), st); // we can use agnostic here as we are getting a scalar anyway. set_ordering((yyvsp[(1) - (1)].expr), agnostic); struct val_list *vl = eval((yyvsp[(1) - (1)].expr)); struct val_list *cl = vl = list_sort(vl); while (cl) { if (cl->count != 1) { yyerror("result is not scalar"); break; } // XXX make output resolution configurable printf("%3i\t%0.6f\t\n", cl->values[0], cl->prob); cl = cl->next; } list_free(vl); } if (cmd_rolleval) { int i; struct result_node *rl = NULL; for (i = 0; i < cmd_count; i++) { struct symtab *st = NULL; set_symtab((yyvsp[(1) - (1)].expr), st); struct roll_value *rv = roll((yyvsp[(1) - (1)].expr)); if (rv->count != 1) { yyerror("Result not a single value"); free_roll(rv); break; } result_add(&rl, rv->values[0]); free_roll(rv); } struct result_node *cl = rl; int sum = 0; while (cl != NULL) { sum += cl->prob; cl = cl->next; } cl = rl; while (cl != NULL) { float fprob; fprob = 1.0*cl->prob; fprob /= sum; // XXX make output resolution configurable printf("%3i\t%0.6f\n", cl->value, fprob); struct result_node *old = cl; cl = cl->next; free(old); } } ;} break; case 6: #line 193 "par.y" { (yyval.expr) = (yyvsp[(1) - (1)].expr); ;} break; case 7: #line 194 "par.y" { (yyval.expr) = (yyvsp[(1) - (1)].expr); ;} break; case 8: #line 197 "par.y" { (yyval.expr) = number_create((yyvsp[(1) - (1)].ival)); ;} break; case 9: #line 198 "par.y" { (yyval.expr) = variable_create((yyvsp[(1) - (1)].tval)); ;} break; case 10: #line 199 "par.y" { (yyval.expr) = (yyvsp[(2) - (3)].expr); ;} break; case 11: #line 200 "par.y" { (yyval.expr) = negate_create((yyvsp[(2) - (2)].expr)); ;} break; case 12: #line 201 "par.y" { (yyval.expr) = plus_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 13: #line 202 "par.y" { (yyval.expr) = minus_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 14: #line 203 "par.y" { (yyval.expr) = multi_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 15: #line 204 "par.y" { (yyval.expr) = divi_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 16: #line 205 "par.y" { (yyval.expr) = mod_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 17: #line 206 "par.y" { (yyval.expr) = expo_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 18: #line 207 "par.y" { (yyval.expr) = scat_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 19: #line 208 "par.y" { (yyval.expr) = dice_create((yyvsp[(2) - (2)].expr)); ;} break; case 20: #line 209 "par.y" { (yyval.expr) = sum_create((yyvsp[(2) - (2)].expr)); ;} break; case 21: #line 210 "par.y" { (yyval.expr) = prod_create((yyvsp[(2) - (2)].expr)); ;} break; case 22: #line 211 "par.y" { (yyval.expr) = count_create((yyvsp[(2) - (2)].expr)); ;} break; case 23: #line 214 "par.y" { (yyval.expr) = rep_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 24: #line 215 "par.y" { (yyval.expr) = (yyvsp[(2) - (3)].expr); ;} break; case 25: #line 216 "par.y" { (yyval.expr) = elist_create(); ;} break; case 26: #line 217 "par.y" { (yyval.expr) = range_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 27: #line 218 "par.y" { (yyval.expr) = lcat_create((yyvsp[(1) - (3)].expr), (yyvsp[(3) - (3)].expr)); ;} break; case 28: #line 219 "par.y" { (yyval.expr) = perm_create((yyvsp[(2) - (2)].expr)); ;} break; case 29: #line 220 "par.y" { (yyval.expr) = sort_create((yyvsp[(2) - (2)].expr)); ;} break; case 30: #line 221 "par.y" { (yyval.expr) = rev_create((yyvsp[(2) - (2)].expr)); ;} break; case 31: #line 222 "par.y" { (yyval.expr) = (yyvsp[(1) - (1)].expr); ;} break; case 32: #line 223 "par.y" { (yyval.expr) = ifthenelse_create((yyvsp[(2) - (6)].expr), (yyvsp[(4) - (6)].expr), (yyvsp[(6) - (6)].expr)); ;} break; case 33: #line 224 "par.y" { (yyval.expr) = let_create((yyvsp[(4) - (6)].expr), (yyvsp[(6) - (6)].expr), (yyvsp[(2) - (6)].tval)); ;} break; case 34: #line 225 "par.y" { (yyval.expr) = whiledo_create((yyvsp[(4) - (6)].expr), (yyvsp[(6) - (6)].expr), (yyvsp[(2) - (6)].tval)); ;} break; case 35: #line 226 "par.y" { (yyval.expr) = foreach_create((yyvsp[(4) - (6)].expr), (yyvsp[(6) - (6)].expr), (yyvsp[(2) - (6)].tval)); ;} break; case 36: #line 229 "par.y" { (yyval.expr) = first_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop); ;} break; case 37: #line 230 "par.y" { (yyval.expr) = first_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep); ;} break; case 38: #line 231 "par.y" { (yyval.expr) = first_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep); ;} break; case 39: #line 232 "par.y" { (yyval.expr) = last_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop); ;} break; case 40: #line 233 "par.y" { (yyval.expr) = last_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep); ;} break; case 41: #line 234 "par.y" { (yyval.expr) = last_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep); ;} break; case 42: #line 235 "par.y" { (yyval.expr) = high_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop); ;} break; case 43: #line 236 "par.y" { (yyval.expr) = high_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep); ;} break; case 44: #line 237 "par.y" { (yyval.expr) = high_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep); ;} break; case 45: #line 238 "par.y" { (yyval.expr) = low_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop); ;} break; case 46: #line 239 "par.y" { (yyval.expr) = low_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep); ;} break; case 47: #line 240 "par.y" { (yyval.expr) = low_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep); ;} break; case 48: #line 241 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop, eq); ;} break; case 49: #line 242 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep, eq); ;} break; case 50: #line 243 "par.y" { (yyval.expr) = comparison_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep, eq); ;} break; case 51: #line 244 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop, ne); ;} break; case 52: #line 245 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep, ne); ;} break; case 53: #line 246 "par.y" { (yyval.expr) = comparison_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep, ne); ;} break; case 54: #line 247 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop, gt); ;} break; case 55: #line 248 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep, gt); ;} break; case 56: #line 249 "par.y" { (yyval.expr) = comparison_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep, gt); ;} break; case 57: #line 250 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop, lt); ;} break; case 58: #line 251 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep, lt); ;} break; case 59: #line 252 "par.y" { (yyval.expr) = comparison_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep, lt); ;} break; case 60: #line 253 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop, ge); ;} break; case 61: #line 254 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep, ge); ;} break; case 62: #line 255 "par.y" { (yyval.expr) = comparison_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep, ge); ;} break; case 63: #line 256 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), drop, le); ;} break; case 64: #line 257 "par.y" { (yyval.expr) = comparison_create((yyvsp[(3) - (4)].expr), (yyvsp[(4) - (4)].expr), keep, le); ;} break; case 65: #line 258 "par.y" { (yyval.expr) = comparison_create((yyvsp[(2) - (3)].expr), (yyvsp[(3) - (3)].expr), keep, le); ;} break; /* Line 1267 of yacc.c. */ #line 1997 "par.c" default: break; } YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; /* Now `shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; /*------------------------------------. | yyerrlab -- here on detecting error | `------------------------------------*/ yyerrlab: /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; #if ! YYERROR_VERBOSE yyerror (YY_("syntax error")); #else { YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) { YYSIZE_T yyalloc = 2 * yysize; if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) yyalloc = YYSTACK_ALLOC_MAXIMUM; if (yymsg != yymsgbuf) YYSTACK_FREE (yymsg); yymsg = (char *) YYSTACK_ALLOC (yyalloc); if (yymsg) yymsg_alloc = yyalloc; else { yymsg = yymsgbuf; yymsg_alloc = sizeof yymsgbuf; } } if (0 < yysize && yysize <= yymsg_alloc) { (void) yysyntax_error (yymsg, yystate, yychar); yyerror (yymsg); } else { yyerror (YY_("syntax error")); if (yysize != 0) goto yyexhaustedlab; } } #endif } if (yyerrstatus == 3) { /* If just tried and failed to reuse look-ahead token after an error, discard it. */ if (yychar <= YYEOF) { /* Return failure if at end of input. */ if (yychar == YYEOF) YYABORT; } else { yydestruct ("Error: discarding", yytoken, &yylval); yychar = YYEMPTY; } } /* Else will try to reuse look-ahead token after shifting the error token. */ goto yyerrlab1; /*---------------------------------------------------. | yyerrorlab -- error raised explicitly by YYERROR. | `---------------------------------------------------*/ yyerrorlab: /* Pacify compilers like GCC when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (/*CONSTCOND*/ 0) goto yyerrorlab; /* Do not reclaim the symbols of the rule which action triggered this YYERROR. */ YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); yystate = *yyssp; goto yyerrlab1; /*-------------------------------------------------------------. | yyerrlab1 -- common code for both syntax error and YYERROR. | `-------------------------------------------------------------*/ yyerrlab1: yyerrstatus = 3; /* Each real token shifted decrements this. */ for (;;) { yyn = yypact[yystate]; if (yyn != YYPACT_NINF) { yyn += YYTERROR; if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) { yyn = yytable[yyn]; if (0 < yyn) break; } } /* Pop the current state because it cannot handle the error token. */ if (yyssp == yyss) YYABORT; yydestruct ("Error: popping", yystos[yystate], yyvsp); YYPOPSTACK (1); yystate = *yyssp; YY_STACK_PRINT (yyss, yyssp); } if (yyn == YYFINAL) YYACCEPT; *++yyvsp = yylval; /* Shift the error token. */ YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); yystate = yyn; goto yynewstate; /*-------------------------------------. | yyacceptlab -- YYACCEPT comes here. | `-------------------------------------*/ yyacceptlab: yyresult = 0; goto yyreturn; /*-----------------------------------. | yyabortlab -- YYABORT comes here. | `-----------------------------------*/ yyabortlab: yyresult = 1; goto yyreturn; #ifndef yyoverflow /*-------------------------------------------------. | yyexhaustedlab -- memory exhaustion comes here. | `-------------------------------------------------*/ yyexhaustedlab: yyerror (YY_("memory exhausted")); yyresult = 2; /* Fall through. */ #endif yyreturn: if (yychar != YYEOF && yychar != YYEMPTY) yydestruct ("Cleanup: discarding lookahead", yytoken, &yylval); /* Do not reclaim the symbols of the rule which action triggered this YYABORT or YYACCEPT. */ YYPOPSTACK (yylen); YY_STACK_PRINT (yyss, yyssp); while (yyssp != yyss) { yydestruct ("Cleanup: popping", yystos[*yyssp], yyvsp); YYPOPSTACK (1); } #ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss); #endif #if YYERROR_VERBOSE if (yymsg != yymsgbuf) YYSTACK_FREE (yymsg); #endif /* Make sure YYID is used. */ return YYID (yyresult); } #line 260 "par.y" int yyerror(char *s) { fprintf(stderr, "%s:%li %s\n", yycurrfilename(), yycurrlinenum(), s); return (1); } extern int yylineno; long yycurrlinenum() { return yylineno; } char *yycurrfilename() { return filename; } void yynodefailed() { exit(1); } dicelab-0.7/Makefile.in0000644000175000017500000005146611303221401011730 00000000000000# Makefile.in generated by automake 1.10.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, # 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ pkgdatadir = $(datadir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : bin_PROGRAMS = dicelab$(EXEEXT) subdir = . DIST_COMMON = README $(am__configure_deps) $(noinst_HEADERS) \ $(srcdir)/Makefile.am $(srcdir)/Makefile.in \ $(srcdir)/config.h.in $(top_srcdir)/configure AUTHORS COPYING \ ChangeLog INSTALL NEWS depcomp install-sh lex.c missing par.c \ par.h ylwrap ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/configure.in am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = config.h CONFIG_CLEAN_FILES = am__installdirs = "$(DESTDIR)$(bindir)" "$(DESTDIR)$(man1dir)" binPROGRAMS_INSTALL = $(INSTALL_PROGRAM) PROGRAMS = $(bin_PROGRAMS) am_dicelab_OBJECTS = main.$(OBJEXT) roll.$(OBJEXT) util.$(OBJEXT) \ par.$(OBJEXT) lex.$(OBJEXT) tree.$(OBJEXT) dicelab_OBJECTS = $(am_dicelab_OBJECTS) dicelab_DEPENDENCIES = DEFAULT_INCLUDES = -I.@am__isrc@ depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) CCLD = $(CC) LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ LEXCOMPILE = $(LEX) $(LFLAGS) $(AM_LFLAGS) YLWRAP = $(top_srcdir)/ylwrap YACCCOMPILE = $(YACC) $(YFLAGS) $(AM_YFLAGS) SOURCES = $(dicelab_SOURCES) DIST_SOURCES = $(dicelab_SOURCES) man1dir = $(mandir)/man1 NROFF = nroff MANS = $(man_MANS) HEADERS = $(noinst_HEADERS) ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ { test ! -d $(distdir) \ || { find $(distdir) -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -fr $(distdir); }; } DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best distuninstallcheck_listfiles = find . -type f -print distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LDFLAGS = @LDFLAGS@ LEX = @LEX@ LEXLIB = @LEXLIB@ LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ OBJEXT = @OBJEXT@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ TREECC = @TREECC@ VERSION = @VERSION@ YACC = @YACC@ YFLAGS = @YFLAGS@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_CC = @ac_ct_CC@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build_alias = @build_alias@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host_alias = @host_alias@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ AUTOMAKE_OPTIONS = gnu BUILT_SOURCES = par.h tree.h AM_YFLAGS = -d dicelab_SOURCES = main.c roll.c util.c par.y lex.l tree.tc roll.tc \ printtree.tc symtab.tc optimize.tc tree.c eval.tc ordering.tc dicelab_LDADD = -lm -ll noinst_HEADERS = roll.h util.h tree.h man_MANS = dicelab.1 EXTRA_DIST = $(man_MANS) test docs CLEANFILES = tree.c tree.h par.h par.c lex.c all: $(BUILT_SOURCES) config.h $(MAKE) $(AM_MAKEFLAGS) all-am .SUFFIXES: .SUFFIXES: .c .l .o .obj .y am--refresh: @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --gnu '; \ cd $(srcdir) && $(AUTOMAKE) --gnu \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \ cd $(top_srcdir) && \ $(AUTOMAKE) --gnu Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) cd $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) config.h: stamp-h1 @if test ! -f $@; then \ rm -f stamp-h1; \ $(MAKE) $(AM_MAKEFLAGS) stamp-h1; \ else :; fi stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status config.h $(srcdir)/config.h.in: $(am__configure_deps) cd $(top_srcdir) && $(AUTOHEADER) rm -f stamp-h1 touch $@ distclean-hdr: -rm -f config.h stamp-h1 install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) test -z "$(bindir)" || $(MKDIR_P) "$(DESTDIR)$(bindir)" @list='$(bin_PROGRAMS)'; for p in $$list; do \ p1=`echo $$p|sed 's/$(EXEEXT)$$//'`; \ if test -f $$p \ ; then \ f=`echo "$$p1" | sed 's,^.*/,,;$(transform);s/$$/$(EXEEXT)/'`; \ echo " $(INSTALL_PROGRAM_ENV) $(binPROGRAMS_INSTALL) '$$p' '$(DESTDIR)$(bindir)/$$f'"; \ $(INSTALL_PROGRAM_ENV) $(binPROGRAMS_INSTALL) "$$p" "$(DESTDIR)$(bindir)/$$f" || exit 1; \ else :; fi; \ done uninstall-binPROGRAMS: @$(NORMAL_UNINSTALL) @list='$(bin_PROGRAMS)'; for p in $$list; do \ f=`echo "$$p" | sed 's,^.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/'`; \ echo " rm -f '$(DESTDIR)$(bindir)/$$f'"; \ rm -f "$(DESTDIR)$(bindir)/$$f"; \ done clean-binPROGRAMS: -test -z "$(bin_PROGRAMS)" || rm -f $(bin_PROGRAMS) par.h: par.c @if test ! -f $@; then \ rm -f par.c; \ $(MAKE) $(AM_MAKEFLAGS) par.c; \ else :; fi dicelab$(EXEEXT): $(dicelab_OBJECTS) $(dicelab_DEPENDENCIES) @rm -f dicelab$(EXEEXT) $(LINK) $(dicelab_OBJECTS) $(dicelab_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lex.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/main.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/par.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/roll.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/tree.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/util.Po@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $< @am__fastdepCC_TRUE@ mv -f $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c $< .c.obj: @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'` @am__fastdepCC_TRUE@ mv -f $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(COMPILE) -c `$(CYGPATH_W) '$<'` .l.c: $(am__skiplex) $(SHELL) $(YLWRAP) $< $(LEX_OUTPUT_ROOT).c $@ -- $(LEXCOMPILE) .y.c: $(am__skipyacc) $(SHELL) $(YLWRAP) $< y.tab.c $@ y.tab.h $*.h y.output $*.output -- $(YACCCOMPILE) install-man1: $(man1_MANS) $(man_MANS) @$(NORMAL_INSTALL) test -z "$(man1dir)" || $(MKDIR_P) "$(DESTDIR)$(man1dir)" @list='$(man1_MANS) $(dist_man1_MANS) $(nodist_man1_MANS)'; \ l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \ for i in $$l2; do \ case "$$i" in \ *.1*) list="$$list $$i" ;; \ esac; \ done; \ for i in $$list; do \ if test -f $(srcdir)/$$i; then file=$(srcdir)/$$i; \ else file=$$i; fi; \ ext=`echo $$i | sed -e 's/^.*\\.//'`; \ case "$$ext" in \ 1*) ;; \ *) ext='1' ;; \ esac; \ inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \ inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ echo " $(INSTALL_DATA) '$$file' '$(DESTDIR)$(man1dir)/$$inst'"; \ $(INSTALL_DATA) "$$file" "$(DESTDIR)$(man1dir)/$$inst"; \ done uninstall-man1: @$(NORMAL_UNINSTALL) @list='$(man1_MANS) $(dist_man1_MANS) $(nodist_man1_MANS)'; \ l2='$(man_MANS) $(dist_man_MANS) $(nodist_man_MANS)'; \ for i in $$l2; do \ case "$$i" in \ *.1*) list="$$list $$i" ;; \ esac; \ done; \ for i in $$list; do \ ext=`echo $$i | sed -e 's/^.*\\.//'`; \ case "$$ext" in \ 1*) ;; \ *) ext='1' ;; \ esac; \ inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \ inst=`echo $$inst | sed -e 's/^.*\///'`; \ inst=`echo $$inst | sed '$(transform)'`.$$ext; \ echo " rm -f '$(DESTDIR)$(man1dir)/$$inst'"; \ rm -f "$(DESTDIR)$(man1dir)/$$inst"; \ done ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES) list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonemtpy = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ mkid -fID $$unique tags: TAGS TAGS: $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ here=`pwd`; \ list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$tags $$unique; \ fi ctags: CTAGS CTAGS: $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \ $(TAGS_FILES) $(LISP) tags=; \ list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | \ $(AWK) '{ files[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in files) print i; }; }'`; \ test -z "$(CTAGS_ARGS)$$tags$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$tags $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && cd $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) $$here distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) $(am__remove_distdir) test -d $(distdir) || mkdir $(distdir) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \ fi; \ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \ else \ test -f $(distdir)/$$file \ || cp -p $$d/$$file $(distdir)/$$file \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook -find $(distdir) -type d ! -perm -777 -exec chmod a+rwx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r $(distdir) dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2 $(am__remove_distdir) dist-lzma: distdir tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma $(am__remove_distdir) dist-tarZ: distdir tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__remove_distdir) dist-shar: distdir shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__remove_distdir) dist dist-all: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gunzip -c $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bunzip2 -c $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lzma*) \ unlzma -c $(distdir).tar.lzma | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gunzip -c $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir); chmod a+w $(distdir) mkdir $(distdir)/_build mkdir $(distdir)/_inst chmod a-w $(distdir) dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && cd $(distdir)/_build \ && ../configure --srcdir=.. --prefix="$$dc_install_base" \ $(DISTCHECK_CONFIGURE_FLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck $(am__remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @cd $(distuninstallcheck_dir) \ && test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) check-am all-am: Makefile $(PROGRAMS) $(MANS) $(HEADERS) config.h installdirs: for dir in "$(DESTDIR)$(bindir)" "$(DESTDIR)$(man1dir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: $(BUILT_SOURCES) $(MAKE) $(AM_MAKEFLAGS) install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ `test -z '$(STRIP)' || \ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install mostlyclean-generic: clean-generic: -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES) distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." -rm -f lex.c -rm -f par.c -rm -f par.h -test -z "$(BUILT_SOURCES)" || rm -f $(BUILT_SOURCES) clean: clean-am clean-am: clean-binPROGRAMS clean-generic mostlyclean-am distclean: distclean-am -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-tags dvi: dvi-am dvi-am: html: html-am info: info-am info-am: install-data-am: install-man install-dvi: install-dvi-am install-exec-am: install-binPROGRAMS install-html: install-html-am install-info: install-info-am install-man: install-man1 install-pdf: install-pdf-am install-ps: install-ps-am installcheck-am: maintainer-clean: maintainer-clean-am -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-binPROGRAMS uninstall-man uninstall-man: uninstall-man1 .MAKE: install-am install-strip .PHONY: CTAGS GTAGS all all-am am--refresh check check-am clean \ clean-binPROGRAMS clean-generic ctags dist dist-all dist-bzip2 \ dist-gzip dist-hook dist-lzma dist-shar dist-tarZ dist-zip \ distcheck distclean distclean-compile distclean-generic \ distclean-hdr distclean-tags distcleancheck distdir \ distuninstallcheck dvi dvi-am html html-am info info-am \ install install-am install-binPROGRAMS install-data \ install-data-am install-dvi install-dvi-am install-exec \ install-exec-am install-html install-html-am install-info \ install-info-am install-man install-man1 install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic pdf pdf-am ps ps-am tags uninstall \ uninstall-am uninstall-binPROGRAMS uninstall-man \ uninstall-man1 dist-hook: rm -rf `find $(distdir) -name .svn` tree.h tree.c: tree.tc roll.tc printtree.tc symtab.tc eval.tc ordering.tc \ optimize.tc $(TREECC) -o tree.c $< # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: dicelab-0.7/util.h0000644000175000017500000000103611303206024011001 00000000000000#ifndef UTIL_H #define UTIL_H struct result_node { int value; int prob; struct result_node *next; }; void result_add(struct result_node **list, int value); void quicksort(int *data, int start, int end); void reverse(int *data, int start, int end); void permute(int *data, int count); void all_permutations(int *data, int count, void (*callback)(int *data, int count, void *arg, float farg), void *arg, float farg); long factorial(int n); #define max(a, b) (a > b ? a : b) #define min(a, b) (a > b ? b : a) #endif /* UTIL_H */ dicelab-0.7/test/0000777000175000017500000000000011303221402010713 500000000000000dicelab-0.7/test/sumdroplow2.test0000644000175000017500000000034711303206024014034 00000000000000[Expression] sum drop low 1 3#d6; [Result] 2 0.004630 3 0.013889 4 0.032407 5 0.055556 6 0.087963 7 0.125000 8 0.157407 9 0.166667 10 0.157407 11 0.125000 12 0.074074 dicelab-0.7/test/comp3d.test0000644000175000017500000000013511303206024012717 00000000000000# comparison [Expression] count drop < 42 d100; [Result] 0 0.410000 1 0.590000 dicelab-0.7/test/high1d.test0000644000175000017500000000037111303206024012700 00000000000000# high and drop [Expression] sum drop high 1 3#d6; [Result] 2 0.074074 3 0.125000 4 0.157407 5 0.166667 6 0.157407 7 0.125000 8 0.087963 9 0.055556 10 0.032407 11 0.013889 12 0.004630 dicelab-0.7/test/neg1.test0000644000175000017500000000015111303206024012362 00000000000000# check that unary minus and the normal minus works as expected [Expression] -3-4 [Result] -7 1.000000 dicelab-0.7/test/perm1.test0000644000175000017500000000023711303206024012561 00000000000000# permutation [Expression] first 1 perm 1..6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/foreach3.test0000644000175000017500000000037311303206024013230 00000000000000# foreach [Expression] sum(foreach x in 2#d6 do x); [Result] 2 0.027778 3 0.055556 4 0.083333 5 0.111111 6 0.138889 7 0.166667 8 0.138889 9 0.111111 10 0.083333 11 0.055556 12 0.027778 dicelab-0.7/test/minus1.test0000644000175000017500000000021711303206024012747 00000000000000# unary minus [Expression] -d6 [Result] -1 0.166667 -2 0.166667 -3 0.166667 -4 0.166667 -5 0.166667 -6 0.166667 dicelab-0.7/test/sumdroplow1.test0000644000175000017500000000022211303206024014023 00000000000000[Expression] sum drop low 2 3#d6; [Result] 1 0.004630 2 0.032407 3 0.087963 4 0.171296 5 0.282407 6 0.421296 dicelab-0.7/test/sumkeephigh1.test0000644000175000017500000000035011303206024014123 00000000000000[Expression] sum keep high 2 3#d6; [Result] 2 0.004630 3 0.013889 4 0.032407 5 0.055556 6 0.087963 7 0.125000 8 0.157407 9 0.166667 10 0.157407 11 0.125000 12 0.074074 dicelab-0.7/test/runtests0000755000175000017500000000010511303206024012443 00000000000000#!/bin/bash for test in $( ls *.test ); do ./runtest.pl $test done dicelab-0.7/test/foreach1.test0000644000175000017500000000043211303206024013222 00000000000000# foreach with a list with only one element [Expression] sum foreach x in 2 do x#d6; [Result] 2 0.027778 3 0.055556 4 0.083333 5 0.111111 6 0.138889 7 0.166667 8 0.138889 9 0.111111 10 0.083333 11 0.055556 12 0.027778 dicelab-0.7/test/first5k.test0000644000175000017500000000013611303206024013122 00000000000000# first with sum and keep [Expression] sum keep first 1 (1,2,3,4); [Result] 1 1.000000 dicelab-0.7/test/last5k.test0000644000175000017500000000013411303206024012734 00000000000000# last with sum and keep [Expression] sum keep last 1 (1,2,3,4); [Result] 4 1.000000 dicelab-0.7/test/first6d.test0000644000175000017500000000013211303206024013110 00000000000000# drop more than available [Expression] sum drop first 4 3#d6; [Result] 0 1.000000 dicelab-0.7/test/list2.test0000644000175000017500000000007611303206024012573 00000000000000# sum and empty list [Expression] sum 6..3 [Result] 0 1.000 dicelab-0.7/test/foreach0.test0000644000175000017500000000014211303206024013217 00000000000000# foreach with an empty list [Expression] sum foreach x in () do 100; [Result] 0 1.000000 dicelab-0.7/test/unusedlet.test0000644000175000017500000000056711303206024013553 00000000000000# we want to make sure that a "let" that is never used does not change the # result of it's inner block [Expression] let a = d6 in sum 3#d6 [Result] 3 0.004630 4 0.013889 5 0.027778 6 0.046296 7 0.069444 8 0.097222 9 0.115741 10 0.125000 11 0.125000 12 0.115741 13 0.097222 14 0.069444 15 0.046296 16 0.027778 17 0.013889 18 0.004630 dicelab-0.7/test/last4.test0000644000175000017500000000024611303206024012564 00000000000000# first without list [Expression] drop first 1 2#d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/ex5.test0000644000175000017500000000064111303206024012235 00000000000000# example from the readme # XXX in the example this reads 6#..., which isnt supported by our syntax [Expression] sum(drop low 1 4#d6) [Result] 3 0.000772 4 0.003086 5 0.007716 6 0.016204 7 0.029321 8 0.047840 9 0.070216 10 0.094136 11 0.114198 12 0.128858 13 0.132716 14 0.123457 15 0.101080 16 0.072531 17 0.041667 18 0.016204 dicelab-0.7/test/comp5d.test0000644000175000017500000000013611303206024012722 00000000000000# comparison [Expression] count drop <= 42 d100; [Result] 0 0.420000 1 0.580000 dicelab-0.7/test/last6d.test0000644000175000017500000000013111303206024012723 00000000000000# drop more than available [Expression] sum drop last 4 3#d6; [Result] 0 1.000000 dicelab-0.7/test/mod1.test0000644000175000017500000000022511303206024012372 00000000000000# extremly simple test using the modulo operator [Expression] d100 % 4 [Result] 0 0.250000 1 0.250000 2 0.250000 3 0.250000 dicelab-0.7/test/sumkeeplow2.test0000644000175000017500000000035011303206024014006 00000000000000[Expression] sum keep low 2 3#d6; [Result] 2 0.074074 3 0.125000 4 0.157407 5 0.166667 6 0.157407 7 0.125000 8 0.087963 9 0.055556 10 0.032407 11 0.013889 12 0.004630 dicelab-0.7/test/runtest.pl0000755000175000017500000000422311303206024012677 00000000000000#!/usr/bin/perl use strict; use warnings; my $testname = shift; if (! -e $testname) { die "Could not find file \"$testname\""; } # load the test file my $fh; open $fh, $testname or die "Could not open \"$testname\""; my $mode = 0; my $line = 1; my $expression = ""; my %results = (); while (<$fh>) { if (/\[[Ee]xpression\]/) { $mode = 1; } elsif (/\[[Rr]esult\]/) { $mode = 2; } elsif (/^#.*/) { # comment } elsif (/^[ \t]*$/) { # empty line } elsif ($mode == 0) { die "Unexpected input on line $line"; } elsif ($mode == 1) { chomp; $expression .= $_; } elsif ($mode == 2) { if (/^[\t ]*-?[0-9]+[\t ]+[01]\.[0-9]+[ \t]*$/) { my ($val, $prop) = split; $results{$val} = $prop; } else { die "Unexpected format on line $line"; } } $line++; } close $fh; # now run dicelab in -c mode my $fail = 0; my %lresults = %results; open $fh, "echo \"$expression\" | ../dicelab -c |"; while (<$fh>) { if (/^[\t ]*-?[0-9]+[\t ]+[01]\.[0-9]+[ \t]*$/) { my ($val, $prop) = split; if ($lresults{$val} == $prop) { delete $lresults{$val}; } else { $fail = 1; last; } } else { $fail = 1; last; } } # see if there is something left if ((scalar keys %lresults) != 0) { $fail = 1; } print "$testname (-c): "; if ($fail) { print "FAILED\n"; } else { print "Ok\n"; } close $fh; # now run dicelab in -e mode $fail = 0; my %eval; my $count = 1000000; # XXX this is completely stupid, do it right. the threshold depends on the # number of results. the following is still stupid, but a wee bit better my $df = keys %results; my $thresh = 5 * $df; open $fh, "echo \"$expression\" | ../dicelab -n $count -e |"; while (<$fh>) { if (/^[\t ]*-?[0-9]+[\t ]+[01]\.[0-9]+[ \t]*$/) { my ($val, $prop) = split; $eval{$val} = $prop; } else { $fail = 1; last; } } # compare my $chisquare = 0; foreach my $val (keys %results) { if ($results{$val} > 0) { $chisquare += (($eval{$val}||0.0) - $results{$val}) * $count * (($eval{$val}||0.0) - $results{$val}) * $count / ($results{$val} * $count) } } if ($chisquare > $thresh) { $fail = 1; } print "$testname (-e): "; if ($fail) { print "FAILED\n"; } else { print "Ok\n"; } close $fh; dicelab-0.7/test/let2.test0000644000175000017500000000041311303206024012377 00000000000000# let with two variables [Expression] let x = d6 in let y = d6 in x+y [Result] 2 0.027778 3 0.055556 4 0.083333 5 0.111111 6 0.138889 7 0.166667 8 0.138889 9 0.111111 10 0.083333 11 0.055556 12 0.027778 dicelab-0.7/test/sub1.test0000644000175000017500000000040411303206024012403 00000000000000# extremly simple test using multiplication [Expression] d6-d6 [Result] -5 0.027778 -4 0.055556 -3 0.083333 -2 0.111111 -1 0.138889 0 0.166667 1 0.138889 2 0.111111 3 0.083333 4 0.055556 5 0.027778 dicelab-0.7/test/prode.test0000644000175000017500000000011111303206024012635 00000000000000# empty arguments [Expression] prod ((), ()); [Result] 1 1.000000 dicelab-0.7/test/sumdrophigh2.test0000644000175000017500000000022411303206024014144 00000000000000[Expression] sum drop high 2 3#d6; [Result] 1 0.421296 2 0.282407 3 0.171296 4 0.087963 5 0.032407 6 0.004630 dicelab-0.7/test/low1k.test0000644000175000017500000000023511303206024012570 00000000000000# low and keep [Expression] keep low 1 3#d6; [Result] 1 0.421296 2 0.282407 3 0.171296 4 0.087963 5 0.032407 6 0.004630 dicelab-0.7/test/comp5.test0000644000175000017500000000013111303206024012551 00000000000000# comparison [Expression] count <= 42 d100; [Result] 0 0.580000 1 0.420000 dicelab-0.7/test/first5d.test0000644000175000017500000000013611303206024013113 00000000000000# first with sum and drop [Expression] sum drop first 1 (1,2,3,4); [Result] 9 1.000000 dicelab-0.7/test/varorder.test0000644000175000017500000000023511303206024013357 00000000000000# ordering of variables [Expression] let x=perm 1..4 in sum((last 1 x), sum x) [Result] 11 0.250000 12 0.250000 13 0.250000 14 0.250000 dicelab-0.7/test/first3.test0000644000175000017500000000024111303206024012742 00000000000000# first and sort [Expression] first 1 sort 3#d6; [Result] 1 0.421296 2 0.282407 3 0.171296 4 0.087963 5 0.032407 6 0.004630 dicelab-0.7/test/lcat1.test0000644000175000017500000000050411303206024012536 00000000000000# list concat [Expression] sum (d6,2#d6) [Result] 3 0.004630 4 0.013889 5 0.027778 6 0.046296 7 0.069444 8 0.097222 9 0.115741 10 0.125000 11 0.125000 12 0.115741 13 0.097222 14 0.069444 15 0.046296 16 0.027778 17 0.013889 18 0.004630 dicelab-0.7/test/ex2.test0000644000175000017500000000060011303206024012225 00000000000000# example from the readme #2 # XXX with some performance improvements, this should work in the same time # without the sort [Expression] let c=sort 5#d10 in (count >7 c)-(count ==1 c) [Result] -5 0.000010 -4 0.000300 -3 0.003750 -2 0.025200 -1 0.098100 0 0.223560 1 0.294300 2 0.226800 3 0.101250 4 0.024300 5 0.002430 dicelab-0.7/test/comp3k.test0000644000175000017500000000013511303206024012726 00000000000000# comparison [Expression] count keep < 42 d100; [Result] 0 0.590000 1 0.410000 dicelab-0.7/test/comp2.test0000644000175000017500000000013111303206024012546 00000000000000# comparison [Expression] count != 42 d100; [Result] 0 0.010000 1 0.990000 dicelab-0.7/test/last3.test0000644000175000017500000000024011303206024012555 00000000000000# last and sort [Expression] last 1 sort 3#d6; [Result] 1 0.004630 2 0.032407 3 0.087963 4 0.171296 5 0.282407 6 0.421296 dicelab-0.7/test/comp1k.test0000644000175000017500000000013611303206024012725 00000000000000# comparison [Expression] count keep == 42 d100; [Result] 0 0.990000 1 0.010000 dicelab-0.7/test/first4.test0000644000175000017500000000024111303206024012743 00000000000000# last with drop [Expression] drop last 1 2#d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/comp1.test0000644000175000017500000000013111303206024012545 00000000000000# comparison [Expression] count == 42 d100; [Result] 0 0.990000 1 0.010000 dicelab-0.7/test/median1.test0000644000175000017500000000014611303206024013052 00000000000000# median [Expression] high 1 low 2 3#d3 [Result] 1 0.259259 2 0.481481 3 0.259259 dicelab-0.7/test/comp4.test0000644000175000017500000000013011303206024012547 00000000000000# comparison [Expression] count > 42 d100; [Result] 0 0.420000 1 0.580000 dicelab-0.7/test/last5.test0000644000175000017500000000011611303206024012561 00000000000000# last with sum [Expression] sum last 1 (1,2,3,4); [Result] 4 1.000000 dicelab-0.7/test/list1.test0000644000175000017500000000007211303206024012566 00000000000000# sum and list [Expression] sum 3..6 [Result] 18 1.000 dicelab-0.7/test/first1.test0000644000175000017500000000022411303206024012741 00000000000000# first [Expression] first 1 3#d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/comp3.test0000644000175000017500000000013011303206024012546 00000000000000# comparison [Expression] count < 42 d100; [Result] 0 0.590000 1 0.410000 dicelab-0.7/test/rep1.test0000644000175000017500000000015411303206024012402 00000000000000# funky repetition of fixed value [Expression] sum ((d2 - 1)#1) [Result] 0 0.500000 1 0.500000 dicelab-0.7/test/high1k.test0000644000175000017500000000024011303206024012702 00000000000000# high and keep [Expression] keep high 1 3#d6; [Result] 1 0.004630 2 0.032407 3 0.087963 4 0.171296 5 0.282407 6 0.421296 dicelab-0.7/test/pow1.test0000644000175000017500000000024611303206024012423 00000000000000[Expression] 2 ^ d8 [Result] 2 0.125000 4 0.125000 8 0.125000 16 0.125000 32 0.125000 64 0.125000 128 0.125000 256 0.125000 dicelab-0.7/test/sum1.test0000644000175000017500000000046211303206024012422 00000000000000# extremly simple test using "sum" and repetition [Expression] sum 3#d6 [Result] 3 0.004630 4 0.013889 5 0.027778 6 0.046296 7 0.069444 8 0.097222 9 0.115741 10 0.125000 11 0.125000 12 0.115741 13 0.097222 14 0.069444 15 0.046296 16 0.027778 17 0.013889 18 0.004630 dicelab-0.7/test/pow2.test0000644000175000017500000000031211303206024012416 00000000000000[Expression] d10 ^ 2 [Result] 1 0.100000 4 0.100000 9 0.100000 16 0.100000 25 0.100000 36 0.100000 49 0.100000 64 0.100000 81 0.100000 100 0.100000 dicelab-0.7/test/sumkeeplow1.test0000644000175000017500000000022311303206024014004 00000000000000[Expression] sum keep low 1 3#d6; [Result] 1 0.421296 2 0.282407 3 0.171296 4 0.087963 5 0.032407 6 0.004630 dicelab-0.7/test/comp6k.test0000644000175000017500000000013611303206024012732 00000000000000# comparison [Expression] count keep >= 42 d100; [Result] 0 0.410000 1 0.590000 dicelab-0.7/test/comp2d.test0000644000175000017500000000013611303206024012717 00000000000000# comparison [Expression] count drop != 42 d100; [Result] 0 0.990000 1 0.010000 dicelab-0.7/test/first2.test0000644000175000017500000000023711303206024012746 00000000000000# first without list [Expression] first 1 d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/risk.test0000644000175000017500000000031311303206024012500 00000000000000# risk example [Expression] let a = 3#d6 in let b = 2#d6 in count( (<(high 1 a) high 1 b), (<(high 1 low 2 a) low 1 b)) [Result] 0 0.292567 1 0.335777 2 0.371656 dicelab-0.7/test/first5.test0000644000175000017500000000012011303206024012740 00000000000000# first with sum [Expression] sum first 1 (1,2,3,4); [Result] 1 1.000000 dicelab-0.7/test/comp2k.test0000644000175000017500000000013611303206024012726 00000000000000# comparison [Expression] count keep != 42 d100; [Result] 0 0.010000 1 0.990000 dicelab-0.7/test/comp5k.test0000644000175000017500000000013611303206024012731 00000000000000# comparison [Expression] count keep <= 42 d100; [Result] 0 0.580000 1 0.420000 dicelab-0.7/test/foreach2.test0000644000175000017500000000041411303206024013223 00000000000000# foreach [Expression] sum foreach x in d3 do x#d4; [Result] 1 0.083333 2 0.104167 3 0.130208 4 0.161458 5 0.114583 6 0.114583 7 0.104167 8 0.083333 9 0.052083 10 0.031250 11 0.015625 12 0.005208 dicelab-0.7/test/comp4d.test0000644000175000017500000000013511303206024012720 00000000000000# comparison [Expression] count drop > 42 d100; [Result] 0 0.580000 1 0.420000 dicelab-0.7/test/ex8.test0000644000175000017500000000204611303206024012241 00000000000000# example from the readme #8 [Expression] sum(while x=3#d6 do ((count ==6 x)#d6)) [Result] 3 0.004630 4 0.013889 5 0.027778 6 0.046296 7 0.069444 8 0.083333 9 0.090278 10 0.090278 11 0.083333 12 0.069444 13 0.062500 14 0.055556 15 0.049383 16 0.043981 17 0.039352 18 0.030864 19 0.025463 20 0.020833 21 0.017190 22 0.014532 23 0.012860 24 0.009859 25 0.007845 26 0.006173 27 0.004898 28 0.004019 29 0.003537 30 0.002679 31 0.002090 32 0.001608 33 0.001245 34 0.001002 35 0.000879 36 0.000661 37 0.000509 38 0.000386 39 0.000294 40 0.000233 41 0.000204 42 0.000153 43 0.000117 44 0.000091 45 0.000072 46 0.000060 47 0.000055 48 0.000045 49 0.000031 50 0.000020 51 0.000011 52 0.000005 53 0.000002 54 0.000001 55 0.000001 56 0.000000 57 0.000000 58 0.000000 59 0.000000 dicelab-0.7/test/cat1.test0000644000175000017500000000040011303206024012355 00000000000000# scalar concatenation [Expression] d3.d4 [Result] 11 0.083333 12 0.083333 13 0.083333 14 0.083333 21 0.083333 22 0.083333 23 0.083333 24 0.083333 31 0.083333 32 0.083333 33 0.083333 34 0.083333 dicelab-0.7/test/rev1.test0000644000175000017500000000022611303206024012410 00000000000000# rev [Expression] first 1 rev 5#d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/prod1.test0000644000175000017500000000137511303206024012566 00000000000000# extremly simple test using "prod" and repetition [Expression] prod 3#d6 [Result] 1 0.004630 2 0.013889 3 0.013889 4 0.027778 5 0.013889 6 0.041667 8 0.032407 9 0.013889 10 0.027778 12 0.069444 15 0.027778 16 0.027778 18 0.041667 20 0.041667 24 0.069444 25 0.013889 27 0.004630 30 0.055556 32 0.013889 36 0.055556 40 0.027778 45 0.013889 48 0.041667 50 0.013889 54 0.013889 60 0.055556 64 0.004630 72 0.041667 75 0.013889 80 0.013889 90 0.027778 96 0.013889 100 0.013889 108 0.013889 120 0.027778 125 0.004630 144 0.013889 150 0.013889 180 0.013889 216 0.004630 dicelab-0.7/test/high1.test0000644000175000017500000000022211303206024012527 00000000000000# high [Expression] high 1 3#d6; [Result] 1 0.004630 2 0.032407 3 0.087963 4 0.171296 5 0.282407 6 0.421296 dicelab-0.7/test/last2.test0000644000175000017500000000023511303206024012560 00000000000000# last without list [Expression] last 1 d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/low1d.test0000644000175000017500000000036711303206024012567 00000000000000# low and drop [Expression] sum drop low 1 3#d6; [Result] 2 0.004630 3 0.013889 4 0.032407 5 0.055556 6 0.087963 7 0.125000 8 0.157407 9 0.166667 10 0.157407 11 0.125000 12 0.074074 dicelab-0.7/test/perm2.test0000644000175000017500000000054611303206024012565 00000000000000# perm taht is useless and gets optimized away [Expression] sum perm 3#d6; [Result] 3 0.004630 4 0.013889 5 0.027778 6 0.046296 7 0.069444 8 0.097222 9 0.115741 10 0.125000 11 0.125000 12 0.115741 13 0.097222 14 0.069444 15 0.046296 16 0.027778 17 0.013889 18 0.004630 dicelab-0.7/test/comp6d.test0000644000175000017500000000013611303206024012723 00000000000000# comparison [Expression] count drop >= 42 d100; [Result] 0 0.590000 1 0.410000 dicelab-0.7/test/mul1.test0000644000175000017500000000025611303206024012414 00000000000000# extremly simple test using multiplication [Expression] d6*3 [Result] 3 0.166667 6 0.166667 9 0.166667 12 0.166667 15 0.166667 18 0.166667 dicelab-0.7/test/sum2.test0000644000175000017500000000125211303206024012421 00000000000000# summing a variable number of dices [Expression] sum d6#d6 [Result] 1 0.027778 2 0.032407 3 0.037809 4 0.044110 5 0.051462 6 0.060039 7 0.042267 8 0.044678 9 0.046711 10 0.048161 11 0.048761 12 0.048161 13 0.045910 14 0.046071 15 0.045625 16 0.044485 17 0.042610 18 0.040034 19 0.036908 20 0.033533 21 0.029621 22 0.025367 23 0.021005 24 0.016779 25 0.012903 26 0.009527 27 0.006702 28 0.004469 29 0.002808 30 0.001650 31 0.000900 32 0.000450 33 0.000200 34 0.000075 35 0.000021 36 0.000004 dicelab-0.7/test/low1.test0000644000175000017500000000021711303206024012415 00000000000000# low [Expression] low 1 3#d6; [Result] 1 0.421296 2 0.282407 3 0.171296 4 0.087963 5 0.032407 6 0.004630 dicelab-0.7/test/elist1.test0000644000175000017500000000011411303206024012730 00000000000000# empty list using repetition [Expression] sum 0#d6 [Result] 0 1.000000 dicelab-0.7/test/if.test0000644000175000017500000000015211303206024012127 00000000000000# if as in the readme [Expression] if >4 2#d6 then 1 else 0; [Result] 0 0.444444 1 0.555556 dicelab-0.7/test/count1.test0000644000175000017500000000024011303206024012740 00000000000000# count and repetition [Expression] count d6#d6 [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/sumdrophigh1.test0000644000175000017500000000035111303206024014144 00000000000000[Expression] sum drop high 1 3#d6; [Result] 2 0.074074 3 0.125000 4 0.157407 5 0.166667 6 0.157407 7 0.125000 8 0.087963 9 0.055556 10 0.032407 11 0.013889 12 0.004630 dicelab-0.7/test/comp1d.test0000644000175000017500000000013611303206024012716 00000000000000# comparison [Expression] count drop == 42 d100; [Result] 0 0.010000 1 0.990000 dicelab-0.7/test/add1.test0000644000175000017500000000051311303206024012343 00000000000000# extremly simple test using addition, result must be the same as sum 3#d6 [Expression] d6+d6+d6 [Result] 3 0.004630 4 0.013889 5 0.027778 6 0.046296 7 0.069444 8 0.097222 9 0.115741 10 0.125000 11 0.125000 12 0.115741 13 0.097222 14 0.069444 15 0.046296 16 0.027778 17 0.013889 18 0.004630 dicelab-0.7/test/rev2.test0000644000175000017500000000034711303206024012415 00000000000000# rev [Expression] sum rev 2#d6; [Result] 2 0.027778 3 0.055556 4 0.083333 5 0.111111 6 0.138889 7 0.166667 8 0.138889 9 0.111111 10 0.083333 11 0.055556 12 0.027778 dicelab-0.7/test/last5d.test0000644000175000017500000000013411303206024012725 00000000000000# last with sum and drop [Expression] sum drop last 1 (1,2,3,4); [Result] 6 1.000000 dicelab-0.7/test/ex1.test0000644000175000017500000000025211303206024012227 00000000000000# example from the readme #1 [Expression] count >7 5#d10 [Result] 0 0.168070 1 0.360150 2 0.308700 3 0.132300 4 0.028350 5 0.002430 dicelab-0.7/test/count2.test0000644000175000017500000000014611303206024012746 00000000000000# extremly simple test using count and an empty list [Expression] count () [Result] 0 1.000000 dicelab-0.7/test/comp4k.test0000644000175000017500000000013511303206024012727 00000000000000# comparison [Expression] count keep > 42 d100; [Result] 0 0.420000 1 0.580000 dicelab-0.7/test/while1.test0000644000175000017500000000142711303206024012730 00000000000000# while (d6 with rerolls on 6s) [Expression] sum while x=d6 do ((count == 6 x)#d6); [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 7 0.027778 8 0.027778 9 0.027778 10 0.027778 11 0.027778 13 0.004630 14 0.004630 15 0.004630 16 0.004630 17 0.004630 19 0.000772 20 0.000772 21 0.000772 22 0.000772 23 0.000772 25 0.000129 26 0.000129 27 0.000129 28 0.000129 29 0.000129 31 0.000021 32 0.000021 33 0.000021 34 0.000021 35 0.000021 37 0.000004 38 0.000004 39 0.000004 40 0.000004 41 0.000004 43 0.000001 44 0.000001 45 0.000001 46 0.000001 47 0.000001 48 0.000001 dicelab-0.7/test/scat1.test0000644000175000017500000000023211303206024012543 00000000000000# scalar concatenation [Expression] 1.d6 [Result] 11 0.166667 12 0.166667 13 0.166667 14 0.166667 15 0.166667 16 0.166667 dicelab-0.7/test/comp6.test0000644000175000017500000000013111303206024012552 00000000000000# comparison [Expression] count >= 42 d100; [Result] 0 0.410000 1 0.590000 dicelab-0.7/test/let1.test0000644000175000017500000000025611303206024012403 00000000000000# let using the variable twice [Expression] let x = d6 in x*x [Result] 1 0.166667 4 0.166667 9 0.166667 16 0.166667 25 0.166667 36 0.166667 dicelab-0.7/test/last1.test0000644000175000017500000000022211303206024012553 00000000000000# last [Expression] last 1 3#d6; [Result] 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 dicelab-0.7/test/sumkeephigh2.test0000644000175000017500000000022311303206024014123 00000000000000[Expression] sum keep high 1 3#d6; [Result] 1 0.004630 2 0.032407 3 0.087963 4 0.171296 5 0.282407 6 0.421296 dicelab-0.7/test/div1.test0000644000175000017500000000023011303206024012371 00000000000000# extremly simple test using division [Expression] d20/5 [Result] 0 0.200000 1 0.250000 2 0.250000 3 0.250000 4 0.050000 dicelab-0.7/docs/0000777000175000017500000000000011303221402010664 500000000000000dicelab-0.7/docs/copyleft.svg0000644000175000017500000000334511303206024013156 00000000000000 BlackCopyleft Icon dicelab-0.7/docs/syntax-filter.svg0000644000175000017500000005014111303206024014136 00000000000000 dicelab-0.7/docs/syntax-filter.bnf0000644000175000017500000000015211303206024014101 00000000000000"Dicelab Full Syntax" { expr = ["drop"|"keep"] ( "==" | "!=" | "<" | ">" | "<=" | ">=" ) expr expr. } dicelab-0.7/docs/syntax-dice.bnf0000644000175000017500000000005711303206024013524 00000000000000"Dicelab Full Syntax" { expr = "d" expr. } dicelab-0.7/docs/syntax-listconcat.pdf0000644000175000017500000000566211303206657015012 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 256 118 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•XI®ìÆÜó<]óp´´4´hH†Ñ!k¡ë+"‡"»_K@ã-^EÖCee$û·-ìüûÿ¯û?~û¯¿o¹¡ô}Ô#ϸÛ/\cÛ ÷#…¼çv„÷1ŽœÆžËQ6ƒçžó°Ë§ÓÚ–üÀSÆùœ·Õéhcì›f ë{r Ôg'½ÒŽ\ âñ§ã ‚™ÍÆò8¹ …I”²,/£¸Ù†Äꖪ㠰Լrä:wGŸsŽ×cÿï†Ã©’Ù&#¸v?nG‘Hüèj˜GP¡8Z[Óv´m}Rt¾QýË—ë-ˆW–˜°¢„c–Êyì˜ïcòÆR¤±%cäGM6ó7Ï#çv-@<æm=¦{’ð½‡~ŒP]ÿÑG›7Ä2íÞšPòmúÉ~†ûÕ£7>cÆáŸ ÷#"X@9LÏÑÒŽQë¾28•¶Rº Àmp:´Dç”ËAbž ¯`!¯{¼ðæ‚ 9óX^±>„ÇR§¾Á–´Ù ´I}p$"_}Öœ„FÜÓs˜*¥å…H?SÔôZ쥄¦.Î o€µ+DÂ]æ×YnñÀ™EÝ©QŠs‡G…´rÝyâ»6©æ5yO¦¿ñåkT¼è˜åÆ+W8ö‹®¡FÒ妳x™@)ÉÂs¯é¨­­ét„!>¡ ÕˆdŽ^åÎ…WÔ°ŽVņ=}Ã+nRŠ¢-Éë›?P)ªN-™=;:ÅðÐ×,®H—Vw³x0„¯òþðOaÜÿØÒþ/Èÿ·ýû§)»ÿg‹aÿnÇ»Àõ~ã8ÆœLá6’TàVŠ$«¯‘ÌÙþ­M1BråÇ @êɨ‰²ÿc  bš£‡Œ†ÍÛVµüÇ/‰3õeÎllxaeCÇU.|LaÃÙ¤V –RË ž¼E>kŸ®k[õOGaC_” í4ƒ'ãK64 D"²Ò44¼A lÈåÈ?থlÄ$sEÑØv 3õÈ^3 :ÊÆ†Ïñ’àщRÒµCÙÐqJ#³M‰§æ¬Vìú´m[ŸoT­ 8ˆÜÁ° wpi‘ÛP6Ä<Ù7¦ÏªÈ†Îʆ«¿ Kn·lxÁ$lˆmʆT 64ý¹!²á`%Ùû„ ¡lxM?ÙÏp¿zôÕç¢p¥‰ ªð!! ÑÒo•„¸’Xѧõ™‘Xðy?BˆŽ—ÿMøoáÍäS!@ÛðŠ%DW§îÁ!D{€6©O„žM°üŒB‰/q`ÂÄH$·È(FÁ—1 ‰ï¥—%¬8Gç…7@Ò"!kÓrBiñŠ’Ò"WÓm!yk¼%¹)ò°ÌP[¨mã³ýï> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 256 118 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000002510 00000 n 0000002238 00000 n 0000000015 00000 n 0000002215 00000 n 0000002310 00000 n 0000002575 00000 n 0000002700 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2752 %%EOF dicelab-0.7/docs/syntax-count.svg0000644000175000017500000001630611303206024014006 00000000000000 dicelab-0.7/docs/dicelab_manual.toc0000644000175000017500000000500211303206701014231 00000000000000\contentsline {section}{\numberline {1}Introduction to Dicelab}{4}{section.1} \contentsline {section}{\numberline {2}Installation and Usage}{5}{section.2} \contentsline {subsection}{\numberline {2.1}Building from Source}{5}{subsection.2.1} \contentsline {subsection}{\numberline {2.2}Packages}{5}{subsection.2.2} \contentsline {subsection}{\numberline {2.3}Windows}{5}{subsection.2.3} \contentsline {subsection}{\numberline {2.4}Running}{5}{subsection.2.4} \contentsline {section}{\numberline {3}The Dicelab Language}{7}{section.3} \contentsline {subsection}{\numberline {3.1}Introduction}{7}{subsection.3.1} \contentsline {subsection}{\numberline {3.2}Reference}{9}{subsection.3.2} \contentsline {subsubsection}{\numberline {3.2.1}Scalars, Lists and Probabilities}{9}{subsubsection.3.2.1} \contentsline {subsubsection}{\numberline {3.2.2}Grammar}{10}{subsubsection.3.2.2} \contentsline {subsubsection}{\numberline {3.2.3}Dice Operator}{10}{subsubsection.3.2.3} \contentsline {subsubsection}{\numberline {3.2.4}Arithmetic Operators}{11}{subsubsection.3.2.4} \contentsline {subsubsection}{\numberline {3.2.5}Scalar Concatenation Operator}{11}{subsubsection.3.2.5} \contentsline {subsubsection}{\numberline {3.2.6}Summation and Product Operators}{12}{subsubsection.3.2.6} \contentsline {subsubsection}{\numberline {3.2.7}List Size Operator}{12}{subsubsection.3.2.7} \contentsline {subsubsection}{\numberline {3.2.8}List Repetition Operator}{12}{subsubsection.3.2.8} \contentsline {subsubsection}{\numberline {3.2.9}Range Operator}{13}{subsubsection.3.2.9} \contentsline {subsubsection}{\numberline {3.2.10}List Concatenation Operator}{13}{subsubsection.3.2.10} \contentsline {subsubsection}{\numberline {3.2.11}List Ordering Operators}{13}{subsubsection.3.2.11} \contentsline {subsubsection}{\numberline {3.2.12}Low and High Operators}{14}{subsubsection.3.2.12} \contentsline {subsubsection}{\numberline {3.2.13}First and Last Operators}{14}{subsubsection.3.2.13} \contentsline {subsubsection}{\numberline {3.2.14}Filtering Operators}{15}{subsubsection.3.2.14} \contentsline {subsubsection}{\numberline {3.2.15}Let Operator}{15}{subsubsection.3.2.15} \contentsline {subsubsection}{\numberline {3.2.16}Foreach Operator}{16}{subsubsection.3.2.16} \contentsline {subsubsection}{\numberline {3.2.17}While Operator}{16}{subsubsection.3.2.17} \contentsline {subsubsection}{\numberline {3.2.18}If Operator}{16}{subsubsection.3.2.18} \contentsline {subsection}{\numberline {3.3}Examples}{17}{subsection.3.3} \contentsline {section}{\numberline {4}Feedback}{18}{section.4} dicelab-0.7/docs/syntax-count.bnf0000644000175000017500000000006311303206024013745 00000000000000"Dicelab Full Syntax" { expr = "count" expr. } dicelab-0.7/docs/syntax-sumprod.pdf0000644000175000017500000001002511303206651014317 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 235 130 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•ZË®-9 ×WÔ•wòHH €!b€6ên¡s ~¯e;É~tKG-õ-;Nb;¶“å}~=îÿýççóÿ¼ÏŸÿ{¤vݹ£]i„óǹèêù5éqÅ;©^w g¸ï+Å~¦|!§gJ×-ó¦@œ3£¯ùàw¹:ÆU|ä«ö~¶ž‘"X®Ð¢ÓBµÑ@õV JÊ aù‡Ó‡0FŒÐ\ÄÀ@½¨˜(ž{vÅ¢Ú5§!sIç%Ë8R=Îg—}¿I÷ΨNœ3@Mº_­P´c¨bæC#it¬uÛÒ6õi£Ç‡­z;ᯞèã¢Häû¹`F‡|2Þúà‘Åms¸zOã)%Rµ8+¥ºIˆKÆ>CZ¤‹²žE»ú]ÄHUBýª£œ“–Bîðx«UuÈi~²A4úåͬ†÷k„îa'†=® *ÝcFj®W/å\‘,Œ˜ëŠí,Ž®w Ã<%‰Ð‡Ó›“„i˜ŒcrFdø|Í%^éœøòÍBÑ'uX2iƒš*bNÐõQ3U²LìÙˆš,³{FÉz|Æ ™pWìbIsW5r,ú²4%%ö–úeäåñÐ=²šSë‚KÝq†½mä9àZØ ª×™(Oª°å=Š$wH<÷ £×Q £ÜY}B¦jã’§BÆÔ5@?ίRëì4LÊR ØÁ«ÞÃé-™Ê½–×í•1ƒÛ—x¥;‹Ó÷ƒçäTå„ÊY7T]FKN=¨üÝæ¨Ô!-î…ÃÜO¾:Ê]ù×?º+Ãù¿#žþ¿¿ÿã”T8ÿ%Ž9ÿ|F¤&EÍg¼Ÿ?± >Bò)¹}rø˜ëÔa§„TøÛ74©ÃVèÁfÛÇs¼®·‚¤#÷;dæ,pàï^wNgÅŸâßñÑÔC>Zþ¦YÐ=d5b@ ”OhÚüßr$ÐÉÙÆ‹‰HëÇa Áйæ»?¤ à0ò"n–Å)Œw-ngÐE/,îLMD(nUpFiÐMÌ—¢ü³ ’ðâSä8ŸÍ#µãpúÁ$Ky °8·B:GMÉΔ;ºB çpÒ‘Oû¤ëZSJèÚÔIèÇ}Lf(<}‘•Uä±R¿#¯n\ cLš·]‡o•æ&Iø¬Ù*y•%ÒrÈ1>¬+é«Ýð†dïË%i2s\œ—é’táõÕ¸P‰Ôß7üdb˜…ã]kä¶Ò-”³â%1‚^# ç=ÊÞË7;ZãºetF¢s:]øEÎÆGNb˜}AU9”ÔkY#538é¾”~ðkŒ89ôX™îšT_t“/ÏzEÛÒ9Çbé¬](1B¨ß]6GŠsj>—«ÆJO›Há toãÉú4Ô稩ɳc¿x ¯Îþp A.ü\ö™ͯÓ¡Rføêô:ÀP£<ÍäÿW¦³•‚ØR—€FB–ÛJÅÝèaam$½LFÈÛr¹Ôö´Å}µw-$‘¢î¡×ô¸zÜö˜Œu¢Ý<¿hŸ‡QìDmÖ£2Å¿¨‰Æ^ÓªFnÊàã"Üæ0¥4'§M ð ÍRÇØœ /D‹3õjï?ºcgU¨šºV?ˆz«1ÄC<¨žfÇAFAÇR5™Û—-Y^×q3&ÏÃe*}ìÆ¸ÈRý9¿o±ù :Ø3E"šqÅ[•ÑK^ v‡âkøàØ¥¨ÃœñáZ`ƒË «€{ç(ä^œÆGdp¤¨»‰Èúv†8˜”§rBªk:¿‹½—•JDßÇš ÖÂÑ`E$çE]%Á«D(ÜÍâÅïÎQ$ÎIA«Þó cR âíµo2@ÍôRTh@h>^C“.†Êß\«G¡‚Oâã}¢‚óũĨ ÕÄÆ¹›vÍà ¨urÖ6¾Äó¶ª|¨¬@¡IÏCQmÈ^7‹ÁuÈ(^`)/I†10Mïƒj¾9f_Ó‚‚öÅHDíØKa;}Úí*R0w{MqN&vÇÑ(x‡B9m"o†ñlÞŒýàà™ÐgüŠC&§ƃVo‘/hJ¼çÆ üÉ༽̄VìÞ Ì/ÎæÑfx~¹«M„¯~M{ç$õÇÚ]͆vÁhfX¹ç¸å ˜zžœÍ+I_»/^b¸ jÌÏŽ3†D l¦—”9lê I-õ)! €}Ò€X›eŠ÷w7*âç1‘«Þqåo;kêå¦tµFã³U ýEŽš!ÛÅ™§)}mwMm¡¦wBg.‚>€3 lµ>€r@ßöz¼(ÅÞÍ*ã±XkÛ¼¶yáÌ›³V>MVµ¦7·K™ZÙàæ¦ÛhiÒ3èn›H»|F9_}¦®~õã·.×êð7|±RÈ×ÞM_nwØ®<š[ûÏnÿ9ç›°¼°þ ]äQÓªö(:jg`ÒÕûí»Ž‘}{Ôý«Aõš ÆÛGÔ|(„•!»Èê¿ò„ìÑA=—ûŒéèðE0HOF&²‰‡F«„KëNEââ:|¸³0´Â'-Ð’BåÒ“®öJ–Û¿*Å3Ê„à+ݤŒß¸¸¬é,4ÞsÖôj7ašWy‘ŠA·ñiŸüÓêùb¿Ð[\.1†ÔÜf=>)Q² !kÉ #è¼í|øÈnvnH°ÍœÎl†Ð0¤x,IÝB[¼ÖùÀFÅÚlYä9:•` “<~ϰÏÀZ7‰%¬]7+ æUŸ äà­82ŸpSçL¨/¤ƒecè~Ç—¾!ŸHænGQ6㑦•ÏL¯Þª#®]ø¸éÓ«È…o¤jŒ÷Úן·Ð 6= ï.ûŽƒ.9ÊE» ÀuêEbT†y‘ÖÖ!¯Ñc H­Íkº“~Ò“˜x>Ýd®?3Ä÷· qílú³ö4˜¹ 2F`†B÷àI±m¨9‚›Ý¦)Ðyút'—AÆÈs¼ªýlWÏõgjøþf®]žÚmÚ4èÓ!Ê ž«l6ÆðÐ òxù£XÝ:ÀIe†3©”j?V¡RÞŽ] ò>š$ó]¡X„I.9CN 78ðu(ëL _”óÌ‰Š›@÷)À_[„Bglj$Ø*rÆL3³þ˜œ_Žmz?8+Wê¤M1[+~êÀå£na!p>ãgŒ)Ué8$—ÉÆÈÚèE7 ľþ ©Vy¬°¨Ü÷w›§e—͇ÙóÑÄïµ¢¾*ƒ‘83ã®F!é¥êCu“Qèj⟚‰øαÂdx ÁÅ:Ñ/v@·>§V@ËBiz“k÷ û²%{>çGØbkù ¼ämàãw%îu<ÿD#»+ým¼8Ö5À yÃý€BF-;lø~av ´~¸€Ð€õPÚ002Y¿àʼnŠHu+ay³`Nò^1òÄùMïpUÑýZÏ@éZ—€m`ÓŸ÷{|RáS“ 7ÓÖ#¨ìÈot¶ä47¨ÚÓb|£A šx °?°ÍIhltaw@v™ÍÄæ€)¢ô6Fek@ÎÀ; )ðjŒžÂ‹}Ÿ]&àµÀüqNF±¦@fSÀÃYðq×Jlá. þ¸?17J5BÉâÔ´àŒåŒAìoŒcqjwèosÞxj’ú®j(a½ÕmmDö>@f`Ž›ÍÁšJ3[ØÐ=Ûݤtd j#]ãeÙ¥ €´0Çñ?È:vc ý/ŸøÇ­ÐitZ«÷mò¹2ÅÕñaÕTÿ8ƨß3íSè/Ȉ ýƘ§( `~0ù‘7Hâá¡?ü ;ÿè|èÊÍó^7‹±’N@¸o` c&ŒÏycdÃùw„<–Nœ]M%À|#jÄÝÖø¸²(bü'©[_œö=„ŸìÎû}Xߪ¡z½Á‰†é§NDÿm@íýÙ¤·óûAà³~œ¼ã/â=¦”öüôÂË·þÕCXëéíûP‘ŸŽ¿ÿ|r³ endstream endobj 4 0 obj 3084 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 235 130 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000003633 00000 n 0000003361 00000 n 0000000015 00000 n 0000003338 00000 n 0000003433 00000 n 0000003698 00000 n 0000003823 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 3875 %%EOF dicelab-0.7/docs/syntax-scalarconcat.pdf0000644000175000017500000000530611303206654015274 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 232 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ¥WI®%5Üûu‚Âóp$$ÐKÄjú,€×'#ÛUï ÔB-õ¯HO™éLG¼?œ?ðïÏ_ޝ~òÇ/¹ÔNŸÛQÒ™F8~?.¡—3út¤zúŽRÏû‘òY9…בÒéi• ǹ,Ú†‡³c\gû³ö~8ÝM!M,ghÑ0¡6Po~¤œ±¶¿ ;2Œá6Mª@1ñôܳ¹­ˆ½®±vsIG‰g*ã0$ù¹Ž{¾>Ž_mŽ3È2ê@ç à‰óÙzâ8dÑÌ @:Ö:‡uk]z;èzsôç—ëÍñì‰sÜC¤ÙŸ#¬h”ƒÆ[¸±àl¦«éiÃþ,1‘ƒYãMãL©® ”±Í§á9=Yî¡Ý;ÿƒ²ÛÏ:6rG¶[­â@NÛðͤûÑ›˜û9B·Š£˜S=Q²%?¬Fs={)Ǭ`Â1×YÒ™\;†}@a ¾*Ìk♬DÅvj #Q3¶à‰©ò<7›'±‘/Ó ¨ƒÒ´K zµQ ’îo„ãž”JngÞs"0žŸ1HùûŠS´S|•ÇÂŽ`i©à–ûeä-åô#K8%ð#€ÚÁV>ÎZ׃¬ðÍ ÷¤;n®¿‰åµh¨†Ä7^0ð] –úÌÍF½\etpéÆÔ¹/NR­s8ž¾sLsV)2}安gÐåØÖr°b+g[ðÄ™Ÿ¢>-r÷ J?¡œå8ñd´dèbÇ}›£Ô2µXøNó>3d9üþkËa8þvñø†ì¿¹~<üéŸ]ðÇ·õEEçEn ÔdôÛWEkào£—"òìõÅcºÞÕÁNTDþé  Òã èMäµô·m0à£èHY3ð|ØÜO/E30hÉQ‡˜!1‚ µLÇ`2œEL˜ÉІ;·8!!!<ö¸&CÃ3þÊÜ7±S¸”ÉO¼à¡d¨Çixä‹¡4A”A$̆b°8Ñ_tY< `‚÷ ‘-3‚Iïð7“Ñ`ÖãÔ–aJ$¿ÆÂŽ Sâ`J\A%®, %b6ESE>b+¼ïZärÐìsC æaäF¹ûÿ.¢wåPåÁMúêOƒ] `F¨ÁW€Ôª€ÌŠábarœ ³#ÐÆÌl¦Oßµ ³&‚Oóu@ÉØÊÜÖ¼(‘ŽO0€$À’8U]M*¼$ßÖxQâ b9’´>’ö%T "bª 1 Wá£yµ”Ì–,$âмÉY?h2b¤1¡6šÝ¶ðÌ=_I-Ä&ÜAíì¶pÑ!V‘¤Û£Òº¢‹1eÅÍÑm™my  ë¡kÓ„Êèk;ÂÐãlB3f“Õ7g9ûOÿ¿(û)hö³ª |ˆT ÿ%ØÜ†Ê6‡kÓß$Òl— ›AôÂ4Hù¨ü¥BÉð³`i†°-]Û^ T6Ø {mÏõ*’°Ü”à&àÑM;¸Í"âW,õ¸É‡yžé8Tµ`dBßÄ„&!Iä”ã÷ÌÎäÛ"QÓ ZpÓ+¯ó…ÓKIÌtùý¼ë o^ÒÒîÜHIßäfÜô=wAá°’b*Š€_Ù»¤@~vM 7QÁex“Ê~Ü å®+àÈ.,žÁÈ-´ÿԔϻ¶0ƒj pÜÒæÝÄ »ºäà&/oúbV2ú®0ܲLIak^ &2ìT ÔÁ«°„à]g ºMgh̦3º–™¨ö4Å%4è{8mWpRÃÍq¿k-[ÎDmð‚%7oèãl9ouŠº3‡ã.8ý[h?‡æ-’aWwÅQûSqÐÉ]qÜG­Åa†Õtµ<‡VÃèšæ8pêR„vÅAð®8Ħ8nŠãž!IkÿŠ£Eå> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 232 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000002274 00000 n 0000002003 00000 n 0000000015 00000 n 0000001980 00000 n 0000002075 00000 n 0000002339 00000 n 0000002464 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2516 %%EOF dicelab-0.7/docs/syntax-listconcat.bnf0000644000175000017500000000006611303206024014763 00000000000000"Dicelab Full Syntax" { expr = expr {"," expr}. } dicelab-0.7/docs/syntax-math.svg0000644000175000017500000004727711303206024013622 00000000000000 dicelab-0.7/docs/syntax-firstlast.svg0000644000175000017500000004414511303206024014673 00000000000000 dicelab-0.7/docs/Makefile0000644000175000017500000000144311303206024012245 00000000000000BNFDIA=./bnfdia dicelab_manual.pdf: dicelab_manual.tex copyleft.pdf syntax1.pdf \ syntax-dice.pdf syntax-math.pdf syntax-sumprod.pdf syntax-count.pdf \ syntax-scalarconcat.pdf syntax-range.pdf syntax-listconcat.pdf \ syntax-ordering.pdf syntax-lowhigh.pdf syntax-firstlast.pdf \ syntax-filter.pdf syntax-let.pdf syntax-foreach.pdf syntax-while.pdf \ syntax-if.pdf syntax-listrep.pdf pdflatex dicelab_manual.tex pdflatex dicelab_manual.tex %.svg: %.bnf $(BNFDIA) < $< && mv test.svg $@ %.pdf: %.svg inkscape --export-pdf=$@ $^ # convert -density 150 $^ $@ %.pdf: %.fig fig2dev -L pdftex_t -p $@ $^ \ > $@_t fig2dev -L pdftex $^ > $@ clean: rm -f dicelab_manual.toc dicelab_manual.aux dicelab_manual.log \ dicelab_manual.ind dicelab_manual.idx dicelab_manual.out rm -f *.pdf *.pdf_t dicelab-0.7/docs/syntax-listconcat.svg0000644000175000017500000001514411303206024015020 00000000000000 dicelab-0.7/docs/dicelab_manual.pdf0000644000175000017500000066544411303206701014243 00000000000000%PDF-1.4 %ÐÔÅØ 5 0 obj << /S /GoTo /D (section.1) >> endobj 8 0 obj (Introduction to Dicelab) endobj 9 0 obj << /S /GoTo /D (section.2) >> endobj 12 0 obj (Installation and Usage) endobj 13 0 obj << /S /GoTo /D (subsection.2.1) >> endobj 16 0 obj (Building from Source) endobj 17 0 obj << /S /GoTo /D (subsection.2.2) >> endobj 20 0 obj (Packages) endobj 21 0 obj << /S /GoTo /D (subsection.2.3) >> endobj 24 0 obj (Windows) endobj 25 0 obj << /S /GoTo /D (subsection.2.4) >> endobj 28 0 obj (Running) endobj 29 0 obj << /S /GoTo /D (section.3) >> endobj 32 0 obj (The Dicelab Language) endobj 33 0 obj << /S /GoTo /D (subsection.3.1) >> endobj 36 0 obj (Introduction) endobj 37 0 obj << /S /GoTo /D (subsection.3.2) >> endobj 40 0 obj (Reference) endobj 41 0 obj << /S /GoTo /D (subsubsection.3.2.1) >> endobj 44 0 obj (Scalars, Lists and Probabilities) endobj 45 0 obj << /S /GoTo /D (subsubsection.3.2.2) >> endobj 48 0 obj (Grammar) endobj 49 0 obj << /S /GoTo /D (subsubsection.3.2.3) >> endobj 52 0 obj (Dice Operator) endobj 53 0 obj << /S /GoTo /D (subsubsection.3.2.4) >> endobj 56 0 obj (Arithmetic Operators) endobj 57 0 obj << /S /GoTo /D (subsubsection.3.2.5) >> endobj 60 0 obj (Scalar Concatenation Operator) endobj 61 0 obj << /S /GoTo /D (subsubsection.3.2.6) >> endobj 64 0 obj (Summation and Product Operators) endobj 65 0 obj << /S /GoTo /D (subsubsection.3.2.7) >> endobj 68 0 obj (List Size Operator) endobj 69 0 obj << /S /GoTo /D (subsubsection.3.2.8) >> endobj 72 0 obj (List Repetition Operator) endobj 73 0 obj << /S /GoTo /D (subsubsection.3.2.9) >> endobj 76 0 obj (Range Operator) endobj 77 0 obj << /S /GoTo /D (subsubsection.3.2.10) >> endobj 80 0 obj (List Concatenation Operator) endobj 81 0 obj << /S /GoTo /D (subsubsection.3.2.11) >> endobj 84 0 obj (List Ordering Operators) endobj 85 0 obj << /S /GoTo /D (subsubsection.3.2.12) >> endobj 88 0 obj (Low and High Operators) endobj 89 0 obj << /S /GoTo /D (subsubsection.3.2.13) >> endobj 92 0 obj (First and Last Operators) endobj 93 0 obj << /S /GoTo /D (subsubsection.3.2.14) >> endobj 96 0 obj (Filtering Operators) endobj 97 0 obj << /S /GoTo /D (subsubsection.3.2.15) >> endobj 100 0 obj (Let Operator) endobj 101 0 obj << /S /GoTo /D (subsubsection.3.2.16) >> endobj 104 0 obj (Foreach Operator) endobj 105 0 obj << /S /GoTo /D (subsubsection.3.2.17) >> endobj 108 0 obj (While Operator) endobj 109 0 obj << /S /GoTo /D (subsubsection.3.2.18) >> endobj 112 0 obj (If Operator) endobj 113 0 obj << /S /GoTo /D (subsection.3.3) >> endobj 116 0 obj (Examples) endobj 117 0 obj << /S /GoTo /D (section.4) >> endobj 120 0 obj (Feedback) endobj 121 0 obj << /S /GoTo /D [122 0 R /Fit ] >> endobj 124 0 obj << /Length 135 /Filter /FlateDecode >> stream xÚ}ι A„἟¢ÂÝÀ¶§çNÅa21X÷a|×PA£*ùKp†`CòÃ;™IATMl'Û+½7ç k 0ì²Ã£Ç@{Zš¯U ŽcŠe€JfŸ>') t8TËKÛÍ©žYk«]s{6c},[Z•ϦOŽÕýM~~},c endstream endobj 122 0 obj << /Type /Page /Contents 124 0 R /Resources 123 0 R /MediaBox [0 0 595.276 841.89] /Parent 128 0 R >> endobj 125 0 obj << /D [122 0 R /XYZ 72 769.89 null] >> endobj 126 0 obj << /D [122 0 R /XYZ 72 769.89 null] >> endobj 123 0 obj << /Font << /F20 127 0 R >> /ProcSet [ /PDF /Text ] >> endobj 132 0 obj << /Length 846 /Filter /FlateDecode >> stream xÚUKoÛ0 ¾çWø(«‡_AO-º¶aCÒðî 8J#À±2[N‘?J”Ó8h°!@D‘ÒG~IÓè5¢Ñㄆ•Á?XTðˆñY2K‹¨ÚNþLh’2.¸·žÊÞ8\ Šë§-‹îÍäüÓ§'ˆw‹Éõg£ÉŒÎX´Xì¬LÃq–åI jV‰`e´ØF¿È"fœlt<ÍIO…(ÈÊTýV5ÖírrjÙÉÖí‚ŬQ{¯+U˥ùBlVAèðh×W›`³ÿé«s¢j%;°úf¥Úø÷â³çt¤T$œ+DRä3¤d7*žò‚«ÚmçDæƒõªÁöøí-ª\^Öhùó”ôËZW¸ÿüš.\“oçøp7.@gZF.yˆEáòܬ­»ó&½ö"™œ&œ2Äyiµin ¬ Jƒx A3²WmÜp·„§­Å ƒ{`jZ<öB3*-ž8˜>šó6†§ds@C-í™Óä"…T$¥ÈÂP ƒ÷7æEFV¸±­^öÓ˜ÝàÁÆŒlÌN *­?dQó¦ë5Ëp¦ïÔº¯(/K°.BhŠì¼)BÀ)‡Â)ù8à7H¯éƒ+_ÌÞ—Ä2iì!€²  Ë¡ÁØô昫ò´E1ï]æg¾]Í«½r+Êð’ ÒÛ]­‡ž€Þcòxù „¯æuæS¯[å*²Ú\êZ_¦xLIV²1Œiÿå=u©éøÚ e©mT稄ö_ûâr> endobj 129 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./copyleft.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 136 0 R /BBox [0 0 157.600006 157.600006] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 137 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 157.600006 157.600006] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 138 0 R >> stream xœmR[NÄ0 üÏ)|'~$Çà¨Ò.ìp 7k·ì‚ú“™dÆc»Ÿ¥Âþ}]áå­Âõ»ØÀ>*Ü  R“€¨5d?ÙÄVl~ô7³q>­hsBúÜÑæBB5 L¢8*¥2áá™DÉz)¿çxȸÁûši…&j8˜×eFÔQ¹ø¬DaF=åºÂ¦¹F+ÜqŠ%&…”iZ–mY/߯0Iÿ‰~ù»ñϨõå}ŸÍ4;ˆ>Qªß×áÐyÝŽl΃• Ó3w˜†¬t ±Ï¶Þ²PÀ &aµ“(Ti½˜¾öÈÏ9¡¾Ui)ùí^nY=p$ÓŠ“÷Ìš¦Ñf Ñna4Êaô‡"]ŽD } IìÑ~/îélI|vÄÞ2;ô9ë§]¬ý=¯çR^Ëœp¥$ endstream endobj 136 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 137 0 obj 319 endobj 138 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 133 0 obj << /D [131 0 R /XYZ 72 769.89 null] >> endobj 130 0 obj << /Font << /F21 134 0 R /F25 135 0 R >> /XObject << /Im1 129 0 R >> /ProcSet [ /PDF /Text ] >> endobj 170 0 obj << /Length 844 /Filter /FlateDecode >> stream xÚí™Ko›@Çïù©Ð}?ŽM›¤©"¥r\åõ°ÁØFÁa¬Týô]`qlãĈF}€O°–½ãýíÌügg¡3s sqíót|òþC #FñÔØLø’(g•väzŠCp™ä™ËA:Yy”&®GyZ=?EAë{k ús·™€ÐìZCPTvpmg™ë8ÖÏFt2©^¾-õ,lÚöòÚÐæÚ )Eˆãaè#Ĭaß,AÉÁé*Š'Q2«ÌMËõ.ªÁMº*†AÓ¾bÀw=a/;«EB‰5ìÚ÷mì6`lu):x0û¸l€”²Ï ÿybÉßFÉ$}j@§âýí¡S }ä" VIR¤”™E¿ÓÆ¿+\^Ý7T…Tª2.dpn«U9¸ÒÉlµWWV@ü†®µ®ìjçŽ).éq÷·v_b¼Fß6ìÈZeFá4,x‡IS®%UÇ€{)àÔ!äXøT‰÷ÒѱÀà&бΖïlhE®ÇÁÒžÛuÜWSPĽ¾â(šÕï°¦–^Z°ºÈŠœ¤ 5œ”Ðá:"6\ì–X°Ez¯íú1¬ çiƒ±àGœ¯â¤ç‡,Êç‹0‚&ÔFØJŒzCŽB¨9¶• +jöhsß8Û¾ê¡Dô•¯ ­LúÛsÒVˆ¢djáwœò3òp:ÂÒ©õÓv ÊÑÏ©(ÑçdÖ©Ü‹t>š¼Ö21"8eÁÌ1©ªb59%@ öDÃ;È•| ÄÐ>b×…,LÂlݦ}UDƒt6lÑ ¨ôiG]?G³yM…ì¯Þhv¤bweµÏ­É]ée›j„19Hr´&çmTPÒK‰`]ø±¨ óÃRÀ%\g XnÓ%¤ekPóÕ £}FÉ» ÊÛy·¨ÅðÉN eòrÚÂ)j#ð Zo«'ÍkÀõ½çÙ½xŒ÷Ü6/>â .àhuW¦Þ0œÜëà¡Ñ¯€Šš­–[ŸïÞ°aŒ}N•ãIj„×·{›?9Ÿü¼÷Q endstream endobj 169 0 obj << /Type /Page /Contents 170 0 R /Resources 168 0 R /MediaBox [0 0 595.276 841.89] /Parent 128 0 R /Annots [ 139 0 R 140 0 R 141 0 R 142 0 R 143 0 R 144 0 R 145 0 R 146 0 R 147 0 R 148 0 R 149 0 R 150 0 R 151 0 R 152 0 R 153 0 R 154 0 R 155 0 R 156 0 R 157 0 R 158 0 R 159 0 R 160 0 R 161 0 R 162 0 R 163 0 R 164 0 R 165 0 R 166 0 R 167 0 R ] >> endobj 139 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [71.004 724.354 210.803 734.715] /Subtype /Link /A << /S /GoTo /D (section.1) >> >> endobj 140 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [71.004 689.534 209.249 702.645] /Subtype /Link /A << /S /GoTo /D (section.2) >> >> endobj 141 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 669.419 226.106 682.53] /Subtype /Link /A << /S /GoTo /D (subsection.2.1) >> >> endobj 142 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 649.304 166.438 662.415] /Subtype /Link /A << /S /GoTo /D (subsection.2.2) >> >> endobj 143 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 631.939 164.166 642.3] /Subtype /Link /A << /S /GoTo /D (subsection.2.3) >> >> endobj 144 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 609.074 160.377 622.185] /Subtype /Link /A << /S /GoTo /D (subsection.2.4) >> >> endobj 145 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [71.004 577.004 210.54 590.115] /Subtype /Link /A << /S /GoTo /D (section.3) >> >> endobj 146 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 559.639 178.776 570] /Subtype /Link /A << /S /GoTo /D (subsection.3.1) >> >> endobj 147 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 539.524 168.267 549.885] /Subtype /Link /A << /S /GoTo /D (subsection.3.2) >> >> endobj 148 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 518.034 316.355 529.77] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.1) >> >> endobj 149 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 499.293 202.59 509.655] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.2) >> >> endobj 150 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 476.429 229.083 489.54] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.3) >> >> endobj 151 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 456.314 262.497 469.425] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.4) >> >> endobj 152 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 436.199 314.718 449.31] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.5) >> >> endobj 153 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 416.084 332.877 429.194] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.6) >> >> endobj 154 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 395.969 250.495 409.079] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.7) >> >> endobj 155 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 375.854 280.729 388.964] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.8) >> >> endobj 156 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 355.739 237.989 368.849] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.9) >> >> endobj 157 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 335.624 300.646 348.734] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.10) >> >> endobj 158 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 315.509 278.613 328.619] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.11) >> >> endobj 159 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 295.393 282.152 308.504] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.12) >> >> endobj 160 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 275.278 282.714 288.389] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.13) >> >> endobj 161 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 255.163 254.894 268.274] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.14) >> >> endobj 162 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 235.048 221.479 248.159] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.15) >> >> endobj 163 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 214.933 246.227 228.044] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.16) >> >> endobj 164 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 194.818 235.443 207.929] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.17) >> >> endobj 165 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [116.433 174.703 212.202 187.814] /Subtype /Link /A << /S /GoTo /D (subsubsection.3.2.18) >> >> endobj 166 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [88.936 154.588 166.557 167.699] /Subtype /Link /A << /S /GoTo /D (subsection.3.3) >> >> endobj 167 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [71.004 125.268 141.38 135.629] /Subtype /Link /A << /S /GoTo /D (section.4) >> >> endobj 171 0 obj << /D [169 0 R /XYZ 72 769.89 null] >> endobj 172 0 obj << /D [169 0 R /XYZ 72 745.465 null] >> endobj 168 0 obj << /Font << /F20 127 0 R /F21 134 0 R >> /ProcSet [ /PDF /Text ] >> endobj 175 0 obj << /Length 2047 /Filter /FlateDecode >> stream xÚ­XK¯ë¶Þß_áÜ¢€ œ£”HIé )Ú$@ÐEOÑE“mÑ6{dɨ{êüú 9C™~œà.º±Èáp^Î|4[íWlõÝFß¿¾|øú“`+^å‚Ërõ²[UbUÉ*¯‹fõÒ®þ“ñõ3gŒeß÷n\«lhç­³C¿~.Š"s~ÿf·¦Ó›õÏ/?€<¾â‘Fëðk>ÚA2m¼â—T£òR6è’ ;Êl‚8:ÞMšLf´ÃôÈlÚš^Ã|µŸ˜dšÆv‡_8”d÷[\ÖýÙl¿¿Ó S ~»&{Àkàÿ tp鲂H7}t&g"ñ§9ãú£»nxB„ÅÌ”D@¼„ˆ`Ö…ItÄh+¬LÛƒ9𧏹ÅA?8dÿï<9ZCÂÎö•¦5?1^ö†ö =% áи¢ª\ª ]¼ña‘,È–<›Nfk½¼-’;Ýïg½7¸ ×£ z`åãÆkú¸nXÑ“¬¢<%Ö°z/ƒÑ\I¤¸ao¡âÆ3RL/K£ûe‘s(Áþm_MwÔ}ÈÝ:&w ÚÝÁªôÞ,ëUv<#ám_‘¢—|©!a§“ÅØââæ|³£éÂÕ–­*ÖŠúA}©²tæɼóRÊèÏÁ³•*ê\UT 0ÇM¸re™ýê'ÓûlUUöÏÉPP5ÍGÌ( œ‡ÙŠ‹W@´$ …ÁѶmg1T-/«ÌΫ¢zÓ™g7œpо˜S§Ï “gû˜e,)jJ”¹  ã“Ì[E2df³\’1Be»ÙÍÑX {€Lë2{; ]d…”ÇèRÓòÃUwzœÔš“éÛ‰äFGýJP]Œíþàî¼aM^!¸Ó IEþ@ø(àbê%„á›îi |_ûP7üÚAÇ5< ¸·m°µätháEöýŽvÛrØ&î’ú³¹V¼4?)âqñ¤*ÈFæ™ä •*ˆº ÷FŠâk[C!5z{x¢¸yƒÃçxxýÕ)†S>âÈôåL¡ŒšÉùúKrÀ-\™O7é´í-$\<7*1Àçóé¾ÔÉšåu#Ð)–ë XtMaéƒ;„Õ ­”[]r &!—Â2‰š¬›c.ªØba'2Ç«í:浪ý¶~YÇÁv˜»ö¶‡J=´TdýÁl_‘TQÊ$˜ic‚Å0Ò´píTA7¾œá—âx vƒïpÔK ¨Xª=Ô÷¾ñ6/À/~¿þVß µ"gJ!Zg{jL"/X¹zæ%:êWÿ v½·æÓã½µWc g$/¡âï~$3ñ.wñ»Výá²|.›\ qmñÛÁn)Foá¤ð¬‰Ã÷"7ÌB÷eQ3+~­NHÈªÈ ‹k„ÂÊtí _xxÓ°ª|—¸ mF4«BùUj¢ßvÇ!„ŒýžJôrKïË­„.žo†HÐJC¿¢³ ¿òªÎþ1â²=ê½uª0@°ô:À-€o¿%ÑÉÝÐï—✴š¢Dñ34€¾ÁXL±ë1(í¡d¿>Q6Â×X/{̶s„¨OHh?!  Ä¸€i Qç—ÞeÊF±ŸéŽthç:‚í 6:` gÿBNPè@³ëBe²–Ù·Þ>©v:äqnîñ‰Âéºò">UÆùä@5n‹é EÈz20Á3öTŠ ÝŽ|™I µ1Ÿ ÿƒýÝå.¥–ãõˆH.)Ï *Wœšj¬eÜ¡PÞTh0H ýkFð¥è=± .E!ý‹-qxS"1ø /°jc"˜^[H)͸'B†ô-2Z³ƒnðPFl­ `…â“sE­Uø=,¾kRØV0Šx:p^êÛ€Œ Kß6ì’È0îÌÎ-¯™"Áã^$TEn¹ß”š›%ž Tf±KyuÚA÷iïOç²)W¢h$¨ÉÞ5“2U\\E®ôŠŸ–72Lf;`¼ov¦&—Ñä"1¹X Åwá½%7°šÀ;QÉ\T*»‹þÙf(œŸÖˈå!Hëtó‡Ab;`7xP<ƒ¬û!m©ÉÖE¼ä"}XŠ7B\nİ*4 ‚ÞØí%]‘'ºHsƒ E© [’o2I-™<¤ÿçÿ¶9›6üEÁÒT“¾ëmé©/¯ÿ9YÄÑý|ܘq±æ Q¢•*/j­Ÿ®ñÌ’Bi¦­)þÉCôyZöå=ÿåÈè AP^B Çö^aëîŒCœ¢¸ü g› !þ¯òÀ,{7W{Åoî• ó9ýèþçœ8®h_Lr·¶AØîu”Þ§âÚ¾;¡eF’Â'ˆÎn•ÐÒÂt„åGHMÕ¹`ÍuHÿý©!ž;OíÿŠÚêR¼ÛD#¤ª~¶AÂWÕCq᩸’êÊ ÛplpÂþѺ,QByµåï/~®–# endstream endobj 174 0 obj << /Type /Page /Contents 175 0 R /Resources 173 0 R /MediaBox [0 0 595.276 841.89] /Parent 128 0 R >> endobj 176 0 obj << /D [174 0 R /XYZ 72 769.89 null] >> endobj 6 0 obj << /D [174 0 R /XYZ 72 769.89 null] >> endobj 173 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R >> /ProcSet [ /PDF /Text ] >> endobj 180 0 obj << /Length 2380 /Filter /FlateDecode >> stream xÚYK“ã6¾Ï¯pnr•[MJÔ+·MÍîÔ¤RI*Ó]Ù­M´Ì¶Y-‹Z=Úã¿ R’Ç™ÌI4 ~øÐls͇ܰwŒ¾?<½{üWÂ7œÇU–%›§— YclÃ7ó,ÝYWi¶y:oþýg[å‘™¶i’FµlmCDu£dß\±wP —“ê·yD¿Æ“ÂÉ­ˆTDÿpêõæit2z™šÅ1vÛ?Ÿ~ܰ¸ªr¯R²)D‹²BuºVÜÊ4ôö!¬xØæ“vwæzÀŽ]²=`£–Ü7 ׌†8­k§ÜyÜÔ¦ž饢ΰÊÍ6{¹×iî׎½ÞO£6íà)z$UÌDŠzhkƒ”Y³u®aw@îÄ!·UÇ`ËŒ-.Æ/µc‘ÄI%´f 2Æ“}‹ºtÛM#Îld{œäÑk²Ùš|uÂ;JqgUJ¡•yæ·u-… gâajÆK4h€Q#~àçÉyQV+žÃ±GÕãE‘èÚôxocsµö"zÚò$:E`ÒY¶“5±Ä›ÝF5Þ_èÃXÌ3Žúx|LíAõÃ@´aè% §ÑÞ´Nhz Çvð\Ø¥ˆž ë¹l— ~ ?°[²}àŒ±èc [5<ÀÑÍσ½-µ"õ¥ä V¢ïU§Úƒn ‚‰ÈÉdÎ{êéÀ[Àn°¡Ÿ4\‡QwÖN‰ÕËß Ée?µ™º†ºCÀ÷ ÿ`<Å…íˆ}y°å ߣ»K–!ê- ÷ø{êî`-g`»øõüÛO$>0ê ̲*‰Kž£*ÈŒ©gF{á ‡†î“ª_o0F§ZP³<|[uÁÆ`ÖRÑ÷è§qì¾|¼\.Û4âA‰³¬n1xù#ÁúqV§"OÌÔ¸KKfãœä›Â.2BªÖtÙ²¿Ò˜1Mà±à9‰ƒ*|ý:Õô^Zb‡ü~‘°N~Ïæ _®_ø~y šloën:fü0p`Ñrlhe}Ò@E»0€ À°eC.i;æµ9üÐcPcˆE•ÅœS^1_´ Ýþ¢­ºVIÇ….3±ØTÔB…R¯ð)ÅÒÀð£“õ+¨$]o想¡„3 àÝï ÷æMY@M”€ãUÄOžZ»•mçV{ׇô›#v Œ`r0­'ƒÜCõ-?ÿüñßžJ2¦bÇH¢Š~Òíôº8.Ajʼn=žVD’ é"Ú[»—‰<ë.1r4¯ÚZ#‰Á%¶ƒ›FˆßÏÈ}œÚM£ ^³ÃQd˜DÌ#²:0/:¶ÈW )P¤iÌ“r}Ìø±6í‹>Ný_‘BÐ0c".Vëí…}eOk• ‚_AÁï,_ÿrï ÀbqVfë…èúßÙÀ.Ç]m±LÇòŽeåÐúðó3αþc]ï°¼?SVÜgÚ#!î2Î<ôT]c¿&\.yõ» ‘1°ÑÎÔÏÁ2<(;4ø ê²;êδÌ<2X eæóâF‡…0¢[Xa^¶ÃÐßÞõÔ¢dIQ’rJ‘̉*´C2î@) ùRµpÓLZAh‡–M5qbkÚ~@œí!$œ"]EA1¾5Z{$É£:áô#æNÝI×.KϳèG9 #ŽÛ³ÜÁÊX¯t ®;4 _¥›åë!~-&ÙšRPåR¢o‰ã>íüu j!ݯ±ÎLÓ*ÎS k˜zÃöIÉ0†Y $E…AÌöZSÚ .vº·#ù¶SâÇQ'ŽxÚ´ÝVo×gˆ“˜íj‚”ˆÆ¶ØP{-Û°ÊO¦YѵB©Až1·NvsbÈnäöL,ÎÏY\¤¡`E:›:lÚÊjÅe.ý&Кƒ/ü‡…6å;˜kBmx2ƒ>`g¦¾´ü ™Ö,¬t'¢%P}E®Y$d{*¼C&N‰ZSýMuî´mÔ%qv–é|Áç‹4zO¾•Þ²öùBäxmË ¼“9)Wjõ×['OJ—¢\’6ßûLoãnÎÑŵ­ðœjIÊ—†jzðm,ßÓ 5vJ©Ë ‰,²³¯Bæ !%Bø]·s¹Ëë8“ð4f©/7C–‘Í^˜fP}õú¨[‰å7ŒIüPÚзˆO]ñ™aÚ?³%•q× }6ý–»;»É\˺( CdVh½(Õà4Ú{¿Èsú𪌳ŠjäåõÂd™î-›d —óÑûɹ)½XÌ-TÓSßõh Œ†Ð×8™GšÑ™n‚¬å‚¢5ÇL»FeM3~ù´£¥Èe÷x€—"æ‚2]$;¬*èbÝ=ÜI9£­Âû_±*|mMà8ËWÌÐ1ÐÛ_5¦ö·ëHV˜èd'ÇÍn¡Ç£3àѯ  u‡‰y^Åã”·¬¤ªaQ,ˆm¶Ò04Câg¡³ˆ><\/@n-ܺᰒ±õîIÉ¢að`pïSîÑQÖj·¬ÚĽ€gYœdc¼×~• ¼·7Šfͺð÷äš‚_`´|:º˜žÞ´d j8f¡AÎÝøÝ7储â·-/#|‡ùûR¿Ì!ûÉoÙbœr<÷‡ktK%ÿ7æÒG9~)b¥»Qˆi1ƒ;Ðøâ”Ôç$ý0Õ>r™i„Y®€âÑï'[ ß!Œ"ñÉÜ Á2:ëãiôb^±sM'"¥Ëe5jèT­‰(ÙAy—Bl–î¹[‹ª¸@¤ÂèԌӕ‘Oʃ&á…€M¿q.*Ƚ¡Ö'½²ÕÔ>½û?/{ endstream endobj 179 0 obj << /Type /Page /Contents 180 0 R /Resources 178 0 R /MediaBox [0 0 595.276 841.89] /Parent 128 0 R >> endobj 181 0 obj << /D [179 0 R /XYZ 72 769.89 null] >> endobj 10 0 obj << /D [179 0 R /XYZ 72 679.034 null] >> endobj 14 0 obj << /D [179 0 R /XYZ 72 573.044 null] >> endobj 18 0 obj << /D [179 0 R /XYZ 72 388.668 null] >> endobj 22 0 obj << /D [179 0 R /XYZ 72 262.076 null] >> endobj 26 0 obj << /D [179 0 R /XYZ 72 135.483 null] >> endobj 178 0 obj << /Font << /F21 134 0 R /F20 127 0 R /F46 177 0 R >> /ProcSet [ /PDF /Text ] >> endobj 184 0 obj << /Length 2677 /Filter /FlateDecode >> stream xÚYI“Û¸¾Ï¯Ðx.ìJ“píTRÉTœrÉ!=UIy| HHbL.-÷¿ÏÛÀE­žÄzðöï¡Õî´S»¿~§äûç§ï~üêÖAž$áîé¸Ó aNíô. wY’y”ìžÚÝgoLÿàGIìÕ݈ÃÔ;¥˜j¯e''°i°NfŸMÿ£‹½ “©i˜Ttï+bb™|-dKimcúïüDï½Z^ûb'Yf§¦âá¹x6<í×§¿íTïWbÅQïsk º^0R^U—¦)øC{SW‘Ì@/øSÚ¶åkÂô¥H=Û^d+I ßkÝUö:ð»Ý?œ I»eþóß?ý+`ê'wkÙY–†ÐÀåŽ4a¨8biŽæ +ÃÐ]´©;Ã{kÛ!ÏP‹¦:\ë±<³CPÂÙð1 ®xéÆâQ‰ºžëòÌ?Yõ°º,:¦¬ ¿NfäÁá…¿§îN(x^²ñ¼•D:’‹Š¿ðÜgÿÈôßëÆüá ›nçƒpq,¼þÁ;è6;‘Š· |æÂ ý3ó%øa’Eà‰<7žëgGóm¼w”ïCì pš0{¾e’°õqòÒÛS_´LuÛîò¤ÝþØÙéÃ]µ¯½ˆ#AVˆŽÈ’\wû–Grµ…éªWÑšÔ…¯å«4™1ÐÀ½–¿¢®ˆQ'~;áI¾ŒÌ¾ÖY‘× l `x­­HÌ8õþ4Ì"­àU”EAž ¼*†ý:ÕåWxâ¡r·„òv( ã‘ð.ÎlÐ÷x„áÔ±m‡CA!¸Î¢íé´áƒÙË{>¸¾?("Hó6îB¦ã‘a<2 »Té‡w77H)(o˜w¯7¿†¥Q’I¼ç#¿šò%íýû!ÌLŠŠWŠ‚±1<(øÓ°ºFþÅ6ŒÙ§$™âï#Cpþ¡ùÃN{)~¨™€bÈch Ä©b'œ\´2b@˜31Ò™¨@§ð/C<̲ÆÛHâ$ÐÐ=‘À‹˜qXœ¥ŒC§t :¥±è¤D!$ärD¿ñ|œP}iÄöI>¼c GŠh¡Ž;ˆ›f:ŒöÂ,(X¼Ç@Ë“ÍáKxm1ò Òï»'Ú7R vÊâþ4öÿÓÿȈZíƒ\ßì XËŸ:±…u¶ÀD(Fžƒ|Έs#‰v¬[x©¦v±­¸@eolÝãÙ¹·fâp‘”çd®ÊÐ¥ È[óè²ÃªAŽ â¼$ ‡œK71v¢D³vÎÝ8iùûŸi -ò7‡º¸f‚‚L£çÝÎK§Ë|îúX‰˜`cçR¿E®äQ:ÈÒ˜’fpÏ5Ä`NsÈ¢ÃÈYf(,Ãüfi)K¹Ü çF¹÷éÈ+¤iÌÙ6@032EÊÑ “ zã·¢½4$:LûlyVxí]eÂ3¹c§pŸ‘Þ/uÉN§3EJêœ#M\"H×iOÊb)–©Co8j–|˜"²,').˜ê óIµŸ±gÀÞƒœS@ÐF¦’ýEnÂPŸ-‹ëî$Ø0d‘INo¨Žž(‰„ÙÜ.-ÓıœÂXÕ[¬{÷+ê`¾B)áÒÅP³„;±`òÔ,P;(ï’{`æ"/; ™#-úÉzPkX§°¹,±’-Ê €Ë é’À:Ï\½’¹°2]®£sqžÚâ«ãc[h\[Þ‡fôµv¬)¹8Ðå!ña¨­º£T[æCC¤Ûëðx@„1ÔÞ½$ ÉäÐ2\çò;ãòºÅLQ¸à¢Œd\âÓ”6•鱈h)IŠ 7úÒ3ÞÔ뇖p†zÚÕ Ù®4Îóup…PéÝ+¡dÚüu-•3‰¤ºÒjÅ“OµX5wí NbäҢナûP½ÞÞCË–Xí² Ï”¦ÝTº‹ƒ1*?©»¼³@h÷W+³7ªÛ¬ È/¾¹Å3H#½4Vmô´x6™«0Ï¥îE^Ûh΋DÝ ˜Æù.Ô \Y7Å482äCtQÀ ôî‚Uß êŸ¥¼¦]^soy°rÆd@<3:çDɾNj:cd Wêyº¸%Aô:W.`ŽÊ,ž“ ç·p– õ¹*G¡Báb‡~.o7± Sö l.â©  lWu(…t²sõV t)ÃÈÂn:!,•4gkžÐmÉKh”mzµÊvÆuX®¹(!Ù“£ËÜ$=½OK‘bpÑ#†ëS¤5ZZ¤àžÒª‚'H]XÔ%¢«dy†•üix0·_‰ø-âå®zä¡hÐ1TùJ‰wíëQB*$gR/)¤®r‡%§RÎ[åžÄ½ÙߤQ Ð;²W­¥r»wÒ&"å俆e9,ð•ò6,(WªÛÒû«±¡ò,å.R¤%r•ÌéE_ÊÜõL9ÝlšDEj|]Ôu”èù/.Ìmùã(Èn@tOû%ñ;õÝòׄX³Z ¸±yiÈ&‚…Ýgᦜ°òqﯸæš2rÞ¢3Q5–Ø[·à ‹·åÁ½ÃÏ>[îQ|] õÒÞ¿¾ÓÉÈwú̆y²w(Ï>ü¢ó»oî™|ÝûЫ•$ÝîÂ=$loqsŪ&+#â þ¿?.Da$a¨lχýðýªËW/ˉ{+»ó]/‰~¨Ì¤6¸/ƒ`ɀ̋‹8¤›yú‚C endstream endobj 183 0 obj << /Type /Page /Contents 184 0 R /Resources 182 0 R /MediaBox [0 0 595.276 841.89] /Parent 128 0 R >> endobj 185 0 obj << /D [183 0 R /XYZ 72 769.89 null] >> endobj 182 0 obj << /Font << /F21 134 0 R /F25 135 0 R /F46 177 0 R /F15 186 0 R /F40 187 0 R >> /ProcSet [ /PDF /Text ] >> endobj 190 0 obj << /Length 2566 /Filter /FlateDecode >> stream xÚ•YK“㶾ﯠ}âÄ+. ¹>9•8e—«rȤR)o”ˆ‘XK‘ŠH­,ÿút£àc¸ëÍ\ýõsÒè¥ÑßÞ¤üýóó›w?Ê4y"…VÑóK”Ë(×yRdeô\G¿ÆÙÓN¤i?? ŸìÓ.˲ø/ÍÁ¶Õž~üRuÇ[u´Oÿyþ¸‰Hˆ¤ÔZ"·4) 8 Nˆr‘d:z>Lãs?Œ8qÝ|H…9ÜÚ‘V.Õõigb^í_hö64Ý‘†u¸¬7H;ÐÂØÓÜ­«íu«®{F:WÄ­¿¾›ì-“Š¸Ú·6ð!#‘¤©òbÁ{ 3e™,ÊôÛåúdb;௒©øÑß®4rk=ð<óRÓñwLžvJ•ñ?»—žD¾uÕhÛ­§ RÏÆŸì•iNr¯yCOßêSßÔoq¬ã¡÷¡Á½i[¿÷“ ½œÅ$§)M¢tIrÖ¶jIÿ÷f<áHz VìtÃl®CøåtF¨sÕÝ<¿áÔßÚšÆ'Û^ˆ”ï›ÅGËL@ŸÄÓ2qõ$âÎLU ~ѱqzy±îÓlòZN€©,#SÈ$Éúƒƒ^á1SÀÖšÆ|Z©« NýÝ‚Zž2¿åM¯Á+@)g Úõ?ýùÒ6‡Š$ƒ ‡ùö}g:º™Ú[i&It©"còD›œ$ñÊÖqÕÞ«Ç@cw¥sE8ÔôT:Þ7î k+Ì_n¿ÿî §è½õLi°‘k™ãŠóМ›¶ºw¸Æ{DMÌh¹¿\ü›ñA*šÁPg‰7ã"ˆ*®W½·´,Þ_ñ™A.#Ž=|fo?qÁVõŸ @aEújí7[¯ŒnÍd€Èx¿V«áÞ2ب`tA€ø¿\ ÐÿÈSN »¨ S Í„ Ή”W2”*@‰CÌxÅ–ñ‹s/gbÑõwší;ú’nI‹Ȓʸ#~ük2~9{tQŠøÍ µ  ·öSÕáVÆým¼ÜFZªÈáÕ7':PÝO°â}8‘Ÿyý‰‹%ÊÌc‰‡@fTRÈlq¥´Pñî°Šfò(i’L-…Ï¥Ó"þ׉|]ª³6Õêú‡©J„`·hÂç[D+øEHÞÓ͞Ɠƒ„ùó¹aOæ£Ð|Ûò©a¢mÈ µ¿±§»´ÕÁ2ïSsê¼Nk'&„èh'T¢àÁ]Ð?ôݦ‚ÊÙP„6‰Îñ-m’$›Ï]@¬0ÈÛÍ*ЦL4&ø†ÿvfn^–2%Ë =5Ú4ÚòåÂu4|÷ÅȇD=¾ª›9Y,­iªVîLqd&UÛ#•t––zîl}>ˆL½XÛ~KË.L/Îì/–.:6`rÞYÌ Ikˆ6NbïYYÍ>78‹3GÓŸÆuÄG÷í~ôôë` s 3Ÿ,T {ì{Î Ü|(o>÷uóR g…è£Ûæx‰›™$fÊ»üž`¬Áž«qmZ¥‰1’İRŠ‹w¯-8‰6¶Wá"¼(Up òéÚÀÂLqƃÅ8ì1Çû‡_:7‡<¾ßFÉü|ùRËä[×5>‡™RC¡w¸XpWŸìgHÑŠëŠpŒ“Ç1åÎ8úê] Ž1 „î¤p=œ|½Ó&ËFúÞ)ÇáÞ//=W®œÅ9Šrj%"ÍU| Í¹ƒ÷ÒÈ=×móÑn¥ R&YÒ…Ú`’¦ãï(W“ßoANA2m”ß/ ’/àp)‹G¢Ò¯µÀYF2âI¹¶À² X“–!g§L§¼B v-וðj7£ f]&SÖõ>Hyx…N®`jJäγÁüÜÎJ,#ë´=Ï—{ÌíÙ© P^ŽäLk*{,Wg5³Äªœ½iÈ6§ÅP³Ä§·œx„œèæñÐå›Ìš9sªÚm e `´an÷° -¤šUuÜqè›nñ§ä; Ä{»ÖacÖO™ÂÆÔNòüûÛñô0…q‘‰ÿ¦^D ™¦!mÎRxNÈRÌP¢TaÙypºƒIº1 ÆjÏSN¦4óeh:Ui0C®E[û¨wîÝ“6üåŽ]ÏSˆ³Ü©XkX”P0xN)š­ºP¢¯-ƒ÷›Õ¢2IaÊÉíl:ðM*Ë=>Ï« ëÍ@Tc~*KLdÜw“/¶(ʰe‚š{²ñvíVÀ*@Š"·v6k&YFÂIf8üþÀ ¤yÐ-Ø'â~ѹª--Ý.ܹºóVI]׌;cO"fVÃìBÚÁµç°Õ’í½å ÿÞÏyJÊYP-“SCkU0x²R.Ô¯ç¹8;—=x)n*,ʰð-ÑL%øÔ­xˆ+fêÜ*^!;Õb‹©˜¢"è7<Áò|w;ï©QÃÛd’XœUÜßõÕEqš#3…IàUß…:x"ƒ¤'W¾ƒçêy],6Ò\wÍáeú펄ïeŸÓ˜{¡ëÜ[<¬:LÀ·bâ˜46s…uo™/Y´.fî[ûö$af –ùH_øÎu´¨Î*o*èÕmrL6;ÍÀiãVÛY„kAhOÄÅÜoÍȦ¶ï¯à[¾ ~{Õò©JJßþ;&[¨\ŠEÏåhŠÿ…–”ØË¾£´hGiÑŸþ ƒ%”ËS,>ã¾Â±ÀI­äz÷G•àɲl¹‰Í{&í«‡©®€Ó³¿±~(¨›ÁµírH.¹Oúúé!­T¾eíajb×­hâÎ÷ô]„eøMŠö3³® Ò̘ûÄ&g ¡Ò¿À[û† ñ±F.6bÓP:9ÒøúØ$7ðS̽š”ëµmÿ^Z5s€+,7x ”@Ü@rÁ,»y¹”\ÊéŸ[Sòè¾.($§DËúv‚L Õ¢*#%!Ø9/“•¿>¿ùK(¢ endstream endobj 189 0 obj << /Type /Page /Contents 190 0 R /Resources 188 0 R /MediaBox [0 0 595.276 841.89] /Parent 193 0 R >> endobj 191 0 obj << /D [189 0 R /XYZ 72 769.89 null] >> endobj 30 0 obj << /D [189 0 R /XYZ 72 769.89 null] >> endobj 34 0 obj << /D [189 0 R /XYZ 72 520.428 null] >> endobj 188 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R /F58 192 0 R /F25 135 0 R >> /ProcSet [ /PDF /Text ] >> endobj 196 0 obj << /Length 3721 /Filter /FlateDecode >> stream xÚZKs¤È¾ï¯wÂa#±ÔXŸfÃXìÃÎÅá±#PSRcÑÐnhÉí_ïÌÊ, P«[ö‰¢¨GfV>¾Ì"»yºÉnþø]ÆÏŸ¾~÷ô½"-‘7_ory“›<-•¹ùZßü-©íí½&ùŒÈßÞþýëŸ~øƒËIYZ–VÌn°»L3XsZe«T]MóâÍD˜£Eª¥ŒçÔß2“ÙÏâú®…Nu±Ú5½½×ºH~înɸuØ0É·LèÃ0R例*zÔ͆;šÛ{› 4çpk“¾m]MŸúnãîxZWOëw4˜w²IwÜ=¸ÆÕ^ûhiàêF¤™°ÌJ_+à¤d¹ÕµßQ–Ɉ3eÁkCRä†c;"›ª$6q (’ÁmúŽg3—Ðk©£ _$uW~9þv-’ãþVÈän5gÚb¢ú'áÌ!P^1Ÿ %êˆ"YXj!,•ôôšÚ Ô|ìùÛ4O*õkƒ*‹å³"-eAËÿüH?õG>¯Àé¬ÐY¿¸n<úS>üñ´§3Γ[Ï"Ÿâ¶z wQÅ•Ò)¨sL[M¶6&’÷T<ð¥¬I¥5ñLk.ëh`­×jl“›Ñâq|ÐÝ>^"u’ªHM©ol‰f&ió×fÜâ,Vƒª¥<OWyÕìm™Â°xÕÚ~®í»ÂôÈ̦҈x*‚QÉ—ºnº'"ô×SŒº@ lžÛ½<¹q Öèê†Oôø‘;·nR–…‰@{Wu§õÊ Ã7b“7¶ÈÒLY¢Å{Gn‚ÔHGÛ˜Åqé Ÿš$¼wc36=;™~³À8« ã‚”%HY–*&äÓUç&ÕÚij˜îã€ò½¤ìB¦Öæñdõéçªtžª|5³îËcÛ¿ºò&éú‘zOkëH``Snh¼ÐêéPôâPÀ˜L9Ÿ‰÷awtŒÇ‘­ª£wðÇv 7ŒJß„ÒK׃çS+ay2lª´æÞŠä{ cô¹é†ÑU5oÇ®%sjÙ‚‚[ÉÙ,½3½$o­dZê2bk8îÈ»(p.—DÄ¢‹"U‰–‹0¯Ûf³];qkD*4‡Ú™}•üóH±Uçߢؼ3¢(Inü+؆¥t|~ß “*[„¡éCå쪬uWÐÉ!æ+Ú iFÆÎj 3ÊBXɀƙ‰,Y¶AãN<øØÕÕ"9;Á”½Ëà[»ìƒ2Že™÷mõ*ô°P² Y;¶“Ê– \`…M ÅÌê™ÎÐï9¢±ÙÍŽˆÔ3Ž ßÅ› ZÙíy(aòäËÚµ-"K1™c4Þm ªCœ«ßbjÇÁà¬wÌd*G3t+m  $±Óa³TÉ®yÚŽ ¯vP5àžq "4¯5ÜÑ›KŸ¾2`Ó?>2ØìºÙ·ì| gø)¿ã3d¥“3'¦ÈS[ÊÈcË"‚Æs׿bËÀ¶÷ÑI@ãµê¸ËŸ<ëžSÅ/³~Â0‰üXEQz^aSu¿á&[",.¬âx:\hÆTÉ_oK„@gP•ÉU*5»äé² O“©&“ر-‘Ãck`sÛC^ÙÎuÃÈ«½5ÚàmgSâ/—}[Ø`·7‚y>¸sPÛ˜"eÕ«ªÎV_µG •?;ºú;çúúŽá3¸‡ÃÉë‹L~égúYÁ.ÅMÀþ…ÐKÂ$¸îs^pÉŠÊ¥OŸÓ&˃³{Y1€X~NK˜g0” 4¢Ü´NA©xíZX×rQÄ3Yt`Ûã¡Iú¥éEXNzp âHXVÇ«cü»†q4P¡"¦j «îPÖt>ô/Lz`N +rŒ†¥Ç »‹Y#Ÿd‚Ë7HßpÎÊ 5*³rJÀ„dQÎy˜,™Ÿ÷WøwÃgE€;dQQ>EÌ}Šˆ}aX³kxhDuº–¿VÅôí}}5m‘ial<EƒÂòd£±$8ó4‹ôƒ/'(CØÕrìßôGð­ÑOeÎ̈½ÍèsŽ/–©f·õ%$`sºÓ‰ÕÇ ®5äA-Bþ•Oýt€!úM‰jž´Õ8†Šyèôáæ f0º‰œØá`-"$d aãž{лÙÒËຜ ÛñLr«2h¼€@qHR|oÍ+É´Äsï€î]Ó9þÜâºÝÓ¸õ‚Ó&ùéÈ»4»ê Æ­ñ¦.å"*Ð’ýq<§ºLm6!JÒ‡À×°9¶>…üÝ:SY¤Z‰°Ò]ànFˆbÂîb‰”d8 !ÊMósé C^¢ 'Y'`r pÄ[¿¡!É>Œ³S©B”—¼ôÌ Wtdö¡ÓñG’³ë«: ©à ã¯ÜBlçÏa.!ô º¼ôÕCÓ6ãD_z<4€î0±]¹L"ôpÖêM*ç³y'cUU-Ë——Ž»Ýú†T3PKØ2¤¼ fœ`BˆA]ýd÷¸ÄH©ý€s¦ZU¹ÊU€ºÔX%+ ï±,<¼ŸGjòRÕ¸®Uä³›Ÿsƒ|v( N[«–R£úD_6ý QQ¯3ã .RÝçºsj)U*DjXæ8:¹ñÇ‹õ!‹´y¼È¯¯¡sC«I”ÀúM'mÖÁEAc××Ƕ§vØk5û{hßïûWwßË„º˜žC’ƒÑ%"éWøÐ€¹bÅÓâ;’³é»M5º® ôF 0ƒx½ôˆºÒ æ^èT#⯽7 y VžÙ àg ÚÌv¦È±¦tq Ïí˜"Ïl˜ÆÂ0ë+J¿J’9vr°Þ#cýõ¹y¦’?SòGc6U7%þÙ¹'Ü ùá5ümj§JJ™G¾uU€ é#{vÃÆ¦^ž©'$zÚ™kY‹5gO¤£ ˆf•S9Â,K¸š73ËdBJìÃ@ä\©ž«ò2Í ×s9‘V‰Êó¿:c÷Ê@øµœ,þG‹r—V©Y¾‘£X¸/1± ­‡jh6w:|Ö #_yTç¼W/òf”ÀãôihÑ_·¼Üì©ýðR´¤z…”† #CÎↃŠdEìÆ•4©ÈÌ›š“Z¹Vð7#‚¹,ô¦º«>^Ý-êj´õ§wƉ^•ÈËxVÀ0jª.Éùªep_Q'NZ‡Á“C*óRË *j_«‰ÈÒ %ǦåE'ý{Ð%½rï'R¥@,E²D©uOüúq9"~ŠJÓk¹M†Ó"š¤(g~Øžäº0å}÷à6Ç`cò\¥ê ¬—¥M¥àR`sÑé&5ÂÆ3¦Ê°¿{¹j§šA(Rñ*Ñåê"…Ÿ°†ñ)e|Ú2à£î8týO— ÔÞæ:&éî#:ÃúJÏâ˜`8&,óýàRÁ9<œÉHd!Ò<àSÌ€ØB…Q¿s8[9V8Ÿ’Ø»Z¿›ƒX¹ˆ‹Þ±)IKNÈó‹OÇd>g¡27”QCßcµ©Î)Ç\›q~Ú¹ªh߉:±*‰O€ø­â5½/­ÝyA™?P¸Q9Zˆ‰Ø]G6ºˆç]) (L.ã9C¯í…Ä¢y«˜…`Çsîl“Ê,µá—úPݲþAƒÜ4&Y†7xfHª¿J™Sâœ}¨@fñ‹"&äà^®°. •jH¢£i«YÆy+„éÁgK–'”0e‚ÊbT‰‹ˆ‰ ðdœS¿I˜@˜ дq Ѳõæh½ÇPƒiø×2àÉÏØ ëP"tIr9ˆ@Ä›>6ø÷È•?R08SÄ3¯¨( RPÑxJ[}`/@[BÙ•h–*z1ÏÒ€óUaÏ1Iq‚ ¼·Ë8ÎG7KÖÍð‚îÙ,Ù[!’W;BgÖĵêyÀ¦õeÂ4¸š`í{Õ€Iouj ‰¨¯’¬ O+KOÃüÅȵ~ÚÅ=½µA ¡·íŸEú~ôŽüÝ£ kp_Å<9þ àmê!1b…^Èd ŒÍH_=0\áÓÂî‹/Û#¤¦¹óS$W“q€O©ü _ÂÖqpÃÔGé7)|ñ¥,?—‡UôXÞžãž“a·AHÓžÖS%¸!Ž»nwl«PJÑ@„;G½H•ðf‡ÇA,¦œ²?Vç£×|=Gøåß;š=†~ï9Ûq­pXë°é™¹NËœ1þ<˯ 2!´«2ž<Á²úÐïÉâ6(ÿ”Þ ð^Ñ>LáÏ¡º¥…õ€T‹Ü'޵׬ý÷Ôã¯(±á…ˆ ŸÝ†ÁÏÎÁÈ2ÃÊþ„¶øS “Ϧ8‰zpˆ¼”áŽÒ–d,yFßÀ;ÝŽBãÕ߉û&Õ› Á%(>ìݦA]u<†tËiŸõ¿«íÐ ‹ŒKXvñ«š]&‚yø= ®Z¼51VŠá•è]Ö6Í FýÕKßðŸTÇny~öNÐç¢4aØŸè3VÄÝž^ÞºßwµX“V{$Ýò {7…¸Å?oËßÁâßÙª³:«ðG†õß G²L«Ã¨µ òïh(B8H:u\\š5Â(‡ðHr ¦ƒÉÒÿ-bBµûKøóÁ=ö FçŸö†ç)SŒÿ´Zþ 8IâRXÑྠ>D»·TŽ¿„¢€è¢Ðñ´+HÓúrÅ'^_ËH¥3[QŸ2OØ|úõu!•ࣟûÇÑu¦:““– …ì`ž J_¾C0 ÐÙŤÉû—`Ûðï’˜Oï^1O4àZDknØo,~ú°“×çx³Á gÃ×jÒ¡ŠëoO®[_7ÝbzøqÄE ù÷Š;ýg½8VZÈA´L…`oXDCÿõ»ÿ“Lˆ endstream endobj 195 0 obj << /Type /Page /Contents 196 0 R /Resources 194 0 R /MediaBox [0 0 595.276 841.89] /Parent 193 0 R >> endobj 197 0 obj << /D [195 0 R /XYZ 72 769.89 null] >> endobj 194 0 obj << /Font << /F46 177 0 R /F21 134 0 R >> /ProcSet [ /PDF /Text ] >> endobj 201 0 obj << /Length 3760 /Filter /FlateDecode >> stream xÚ­ZK“ã6¾Ï¯p&õN7#¾ôH6©Ê¤2©lmU¶’¹%{PÛênÕÈ’cÉÓã¿J¢Z²'©=t‹æAü2Þ!†«Q)¬¦¤Â®Ú–¾Ê-P¨žÚgª+ècéÓéÛUŸ¨àÖ“¸ibôÅâ2*³¾nZŒÖÑgÌÀ jýÏÅ b!µö]Šf·DG)a•ñ¾û<:ŽI·{ð}9v‹R³Ë¡Æó¸,%t<Ì/°Ëö(Ëf¦g°ÞÌ›nʃ³Û¨ë§mò¶5gà‡J%êǧƒkë°Üua“!•„.}îËžŒÊÏÅ™Ûh¥6ê[ÔµõGž¤k÷¾t(·jç–~»éÚûºÜw·CTØ[_h|Iú•)Z8 ÔåÜYÞE–R‹„ ®Á°.ÛºÔ tքæ–ô5žWØE]·Ï•iÈZËßj«+¤O5~p¢ØãŒŒ? unë:¤É½þÚ|,ŽUr|Í-¤¿¸š8›H/‹E¬“™ôˆÿŒ=Î ;¤ÉÙ7Üv@·›D=/œQîÕ:,ª¸´+ ÄÇ3¦pWœ/.ÈC³ƒ¿ì~"‹®õM±²yÃrM ÆjlHþÜmÎìûC]òâýy6nQuž$9Nd˜XaÙÝâ­PZz+Ý%ÿPK¼ªLXpªÞQtì'‡–Ž?øû¼ä(PGêo–Ï,8ùÒ$ô3K2V˜”ÏÄßèd­j´æD³úB­ÐNÝeƒÍÔR†TAÚe±}ºbfÊH‘Å3†œŠÃ´Åáàyòœ¬9ªD£Ü¬T×BJœ°FJô¡£Õ­­jíEC…æ½Æ=Q‘7´‹¸CÂ8™ý,œ$-öÚü=ÕîZúùöšj+«Dœ…ì=WÎ;‡åÇ¢>}I:ôý-Õ²V¨Ü 5U½we%5µÉ­+¶(Œ´Çwä7çÚ´Í ožÊAX—e•Á¡fC ¯¹f'\šÍ¦miVž>޶§ãèÄ •ð’M²èÝŽ ~aiÌØ‰( +YVºKÐ9ÄÃcÊáÛ+Ë26‰JÂA#Ò–ÃÞîÄ ·îDIC~$϶¨£V X¨;íLÚù)ÔNõ%IrÀvÐÑOo$¢­Åõd€R²ÔÏ0°퉵Ò9VÒ«Eš¦BfzƤúÿƒÇsS¯MŸæ vÝóD²Àd¬tÝ\ÚÎÜ )m8¬z¸¦¥Pm‡£¦EޏÊ R†QitO§žð{WÊf‡þÊý$ˆæc(LQ¶?Ð×C°tí ¾3I:Dˆ+ÕÆ&©°iJkx9ÉEô›)³ÈnêúÈ)‘óseè+~Xò”98kE¦gŽZ7‘ [Oå…v™opvBážOé¾½Æ6 ý@ðÅj¯ìÒ%W´Ú„$¿¿ÆˆQ©¬².–¦mÊý¡?ß².‡“^ßÜÜI8L—(bF-ÖM¹FS/Ðü? }Rÿù†*ý|éd><³`ºæŠ Ñºât¶‡å$W¸,R'Iõßé:?y"`‘7~ÁTc>¾@+*£D*~= ÐoÕÆRLè%!Å«¶ 4Ñy8h0æe ªbÆdÆúÒž‚mN24$Ãý‚ Saò!ñF^aX)ˆV²Ù䃘AXd_PXfÁ¾â±ä¹b{l6ÿï/sÝGÀV™|¶ˆåJà æõéÚ<¹¹Ñ/w÷/¨@gS@âšë„"ä|}·4k×·‡ƒÏb„¶`2PÆÔg¬âô).¹«‚ãew)A9t.CBŸ·e×¼4ÆØ4œíä$–E¬"r´Ãl~lÛ7ù¼q䥽WÒ©K07‡š«Ç–G˜þÜúP–ÎTrß!Y Pï”ÉE–g!>9·z{ª!ÊgZЧ&DZpNfŠS]ÞqšØ'‡ë‡b·óu-gð dVvß,錵.fs2ù£—Øc;(<.³¥ºm]ÎHòm_éòøÒŽ÷ÕãSOEìá8Š9é;|øpr©+ á@#TNܺm÷˜ŒéxL30rô5CW PaSUóbiƒnÖ+¯ntG§ªè¾n·°(9Ï­U4n7 8bFZ&ç‚;O[)wŠK¢¶ƒˆ‹j†ŒãªrBD¢äœb¢ÿ®ù§D ¿f«$ýÂ4täQm˺¸' ¶CŸÇ¦ýy(bTÌ%Ódrt28ÕdÁiŸ@ƒ ”  xÿ3÷Õ7Žø¯¥–ç–nž¨±i{Nx`rïF²“>9²-™ I˜'¾JÖ¼0¨ÙÊkAD3K«qÊv@ x[îÊfË¡à¾îÒ†Ät]m«~fCé»]U‡LÿhÅÅn¸ÙËgi+pÃ.¨Ÿ¤­F)Zˆ¬·ýxk7ih›šïéöeá’›xe×QÇ‚¯÷ª¦wþcw¨Œ×y¼ûâ*YÛá~ðÏì?Œ¼¥!à‹‹ŽG¹…=ø[C:”§rÖ>+VU¿ èòŠ:¹ç¯?½Úüî$w 7 \ýàÓ ¥Ã'¢oª¾?ß=ñõ싪ž8QK[4þ6f¢:‰ø>K+³§~.ÎÕž«²ÞQ5Ým¶‰mSx²Cd†•õ©2‰rît"Œ?ÂçÉäÀñÊ΀ÒŠ W!Œ蓽¬iÏ04³"33ÖdH8dšŽÃ§‚+÷°úŠCZJ‡Èu¾u’pÄÁÜN‚Ý5¶ñAžÊp(ºFyG!€ãì¹"0#¯‹Ð$»«,$˜âùŠæ¢(ô4oö\Ü<µ§žÁH> endobj 198 0 obj << /Type /Annot /Border[0 0 0]/H/I/C[1 0 0] /Rect [110.48 373.474 126.986 386.584] /Subtype /Link /A << /S /GoTo /D (subsection.3.2) >> >> endobj 202 0 obj << /D [200 0 R /XYZ 72 769.89 null] >> endobj 38 0 obj << /D [200 0 R /XYZ 72 356.985 null] >> endobj 42 0 obj << /D [200 0 R /XYZ 72 328.063 null] >> endobj 199 0 obj << /Font << /F21 134 0 R /F46 177 0 R /F36 203 0 R /F34 204 0 R /F37 205 0 R /F20 127 0 R /F25 135 0 R >> /ProcSet [ /PDF /Text ] >> endobj 210 0 obj << /Length 2078 /Filter /FlateDecode >> stream xÚXK“㶾ϯˇP•—xñ‘›S›um.)WO± hó!‹äLôïÓnð5Ú™-U `ht7úñÑîyí~~ˆ¸ýçÓç/Rì„3cäîé´‹Â,…±h'v‰c£v‰IÂL™ÝS³ûoð´28ÛýA©$(«ý!ú¡j‹¡êZ"í€ÔWk!jžÕÓxÞ–Ô鋼ίL¥9<0TuMÝ{½—ª¹tWœ4äíðˆ´4h»¦um}ó»ùØ[Z3xA‹„nózÿûÓ¿‚Úk(w‰V¡N3ÒîºÛ5²Õ:hÆÞõTDÞk”@›à8òT`Ž tô5Kk›¼½¹»Ø+Ú/:§7’HrÇ¡î^iÅl ŸPm·y×X^t¢y _uuJ‰0’ dFZ‘N9*õ<6¶úpÐ& ¾ìU8¶J%ú_Þ\j‹¬>}ÑñÒ³•Q&‘^ó.ã¿KZ´v¢…8æ«4Y¯kò?mOÛ÷¶íí#Zó”¡ÖfÍJþøB¨X†Z‰ð—üèhܺ‘HEÞþm ®s 8}æ%·dø…Õ…M–óvlŽÖYŽ©£6§¦·uÜ1BKsûX‰hŽ»ƒJ€-8h lU(C¹?ˆ(Š‚ŸÉ—š&w>ð裞…4FëPÆjW4Mtü¿Gøôµ‘»ÏÝÃ/ðóC`rXp¹“+ÀÂ"^l ÖMàsUØ:?‚†lUöâ€4AÕ^\Ô½èÚ~Ê!Ï<—šÉ€° E¦1ßÚ]E£2½¡òÁ:¿ÿ†{ÌËã$f³ÚNÑjK’éx#yzÛTEWƒðD°yqöq¥ ‹ªDCwÜ2Ũm¨÷JyzGŒl™q0âŸ-FÞ7 \j¥•Õ•I¯-³Ž‚¯ðFg€T>å^K¥ŽÓÖDPãgT-C j°“^,Õ¶ˆ,í|p•“·d§‚ºfØ@“´¥%oÌŽÝß"ÙðÙCL;xiÞ)÷¨Y”†&ÍŒÐÁ¡¸—Ó‡.àÄU’¬YöDÉo—ÉP󯓋ô>\9õ‹ÁÙ‡ÌÖù!' ('8îWÙËgvïýÐù³uð§sœ5U™…ÙŒBa7K}‡aé@Ï.R€Æ®=¯„ Šñ:gD„^©ð R„À—ÙN%inçŸ@s-²Æ=°›»hÚ(ªsŽºÈn>„¶[š¸XBÒKk.5ޝ'$½B›! Ȩ.j£g³â€3ëÖr& MÂ)¯èÇæ”£UP1ÀâBÊÊß”wcåö ¿…)FaŸ)‰Àêÿ,Ðý@&Eêì»ñ˜º‹Çf&\Ý`¿ŽU³GH0¾(Û.ÂÌT —Yƒé¨yä2{¶Û5‹›#9oM|Ëm†pñœÞ x-âÐ|ZI^š<@ÛF_—šHœ’N ñ俤6AaHŠ4£óFnÍè!”.ýѳ3#iIïuÒßö’×#Õté/ÂU9ó¿¸ôzÌU] •¥ › ¾žVž*7G±rléo&k”#—+à,°žÖKÈ_³¨ê»NO*8‡8[oTâÊRãq|ƒO2Ê8ƒt”®×»…NV]oU׫˜¶(5vœÛ–›ÕìJ¿uô©Eüˆ/¼\Uïàr-ýÕÜçE$9«á©Åñ¢ðÔ)ö¼v*¤ø¼àüKK/Vâ¹1Ö­‚k¯òÕ W B > endobj 206 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax1.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 212 0 R /BBox [0 0 260 118] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 213 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 260 118] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 214 0 R >> stream xœ•XÉÎ49¼û)ê Šòn?˜#†͌PÿàÀë‘‹«z™‘Zßás¤—\œ™Žê‡cãß~Ùþðcûå¿!—½–¾¼ÇT·Û…[mÛƒ8—BL1P<&QeËy½nÁàIAÍñ6]ò š)-„óbÒµ‚Çžâ„¢“žíǺáÂÐÁ15Œ´·1xT:²£ gsäÓ0ºD¢Qçöìð¹ý²ú6ÁÂâ²4FŽ5G'1ÃÖôÚ–ü@.ÚÆTSt9ÿÙa†Î-¸#6­vøÖ'+?ÙýóÛå–CÕÁs„ðÇæ¸í]Bì¸ïuBõÄ È ú†l O Ž>ÖtßKÍÜ*AmûTd—køºÜº7y]®aµì±6¼bX:"qßâírÁ]c=DhH,eòúìÜ&%vÂ;CÁbp®i×ü³âüÅqîûÀÕ½ÆÆ0+ì’¯¥íL>Z)p«o+¦…ÕµbJÞ»Ì-mù»y+çÂÂ÷ÙóãØ¸ýX^qÞØS›ºKR_%Ô:éCÕ±¹‡âŸq{rYY0÷`FÙqœ!d@±@I)Ñ‘ãÈÕ1ƒÑº.nóf[°¢¢¸g_ÄÅöqE0@êmVz®¾RŽ<€ŽÑJDƒjT´ Z×j‹_0´\­’Ù¯8Œ)I h „°HO0t.l–yzŸQX÷èÓYRßÞG îumÏ}ÝkðØ%ÇSÌY ¯·à÷ô×?ú=Åí!m‚ü_áoßàíöÏíÏìŸÜ£~µ6¶tÜFRØü÷o&W_#™³ý¡kšIåÿô…èrš™ìÅÿxPc‘ÑCFÃæÆm st-ÿé-9g‘.;³ôŸÛ…«Üµc½ ˆùèÌ&w:£tž`ðô 1<¦oã([_â˜E5ÖêC/ÐN3ˆÃ’<|†x½@Lš‹†ƒ-<þtÌ3xûYEë ˆ—ÄÊqEÑêŠPW†I‰È°'£59ÒøœÛs¼\,(Dôû·Ä…‹P ñ£ê&`µOKÉÓªÛ-ÿlë“¢óƒê÷ÞƒDYb¬Ýiö}‰_—ŽùÎiVúìiäF¡&<Î0AýåÝæv[fp_*Lž¢÷€‚>ªë¨§ó&€‚Xôz¥€’oÓOöK¸_Bu[YLAâs´$©t@òÂ8%·•à,!ÌÒè‚pIH‘„Óøž72B›ìÒªŽZ³ÛOñ*2»}Þ|ŽÒ5†U‡¿âDЋ§0)N»´ Ø®EVOmV@ByhÜÌZp:Ÿäµ'lóž[Ì”öȸó*ÈGòÄw}^ËŸVK‹T¡ßsíC’ÄCˆs¢Š÷.X·AEפ©I˜›Î£€ ¹†aÚ8÷ÚÚZx ñ¨3žx-à¨5Äó¸:ØÜ—K#xò¯=o‚"­K™äµ¬J¹–)’ZÍ$Rmƒ§:qô5X´¡¾DHÂú´oQ>PòˆÅd/  ÉãùM¼ÝSÆ»*÷“}%â=›ø’4ékùW–-;0@M}÷6›ñ`Ç¡öpðtÌÍX®îLsY$âÎÌ7‰¹ãË¿uê5¬¿eª«â²­¡D:pÌù’`†Õ–eÔw±£u2¨zô¸2E¶üƒµüZC›lÝXÊM 4e ¦ÔWÄ—‰J?´ƒíÁ02¿è×äZ®­É=Ta+¾#´¢ ÖÎ4ȵUËš¯òÒ7¥´´ˆ¥y7‰rÙÊoÖäÉZYÜK_5ÚBƒÈ[ÂZ…h´&ÄeÁnÌå%ˆò¢ª RqÛ¤äe †PBqjš‰WÃv˵Àøö'}ç'>´êšäÉg$åÉø„#‹Áe1\AƒÛ´ÖÉï6ð˜%ÜC&KÔûX¦0™kâ3óOá2Т\FÒlÆ á’!læð+î@é ŸY ^‘[xõïS†<ß–˜ ¦R@ROg| ‘Ò\éÎO:Ršµ  {JÃO8<Ïm:¥1Á- YŒ Â%iÉŒò&¨NiL«9hUT,Ø.xŠW¤4kÞ|ÖA‡aU+CÙùîߤ¸‘Ò`LÑôë•Ú¬º”ÒÀ8¡4k¾ ¥!$¥¹œ1JsÅÌ( 7Dé#Jixà‘V)˜¾U)nŽO«¥C)¢ßsíC’4ý-‰9¡”Æ×-B@JC) !Ÿÿ–•Ò†¸KRšµ ¥v´…|Xß<—àVtíX Ì\ㇼ Æ¢4Ôš(JDJC­f)ÁS8ú5Ÿ…ÒÖí%BÖ× }õÂá=Ó—¶O{31èÍ%|<#úž>u£ù`øÔàbúˆ9}!±ºß’þàg~x‡2?X_ä]¼pÇM2ð,s\{´ß> ž"¨¨ÿp[´½ëöK´å†™¾»ñ÷F'ôxÃçRo‚›qºýn»ÜªRc½‹7ú©øqa°Û¨Ö I£ Üx÷üZ5Ï?Dü{)BÖ•±=ëýdÉWI1†&ÅïÒÀfôkÚJôÅà{â§_¾ü«­”ŽÂ~g}û‹“mÂîô›Ü\~S‘5¹¬ŸÃR»õç/ì1n¹ 9ýsøKø?8‚ endstream endobj 212 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 213 0 obj 2177 endobj 214 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 207 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-dice.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 215 0 R /BBox [0 0 195 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 216 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 195 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 217 0 R >> stream xœ•WË®$5 Ýç+òEÞ/@Bb³D,P¡„zÀ‚ßçÛIUw_!î¢ë8qüˆíœû— žñßýü—\îG(Ý×|äýWá›l\²Ïí9úÚŽœ†Ïå¨@Îàés>´ÖrÚjixÊw<×mw8ÚÞÙi±±±§…úìD£Wú‘KáA<þ\ØA0S¢ÛØ'7´0‰R–íe”å¶!ñº¥º°,5ûšŽ\§_Hósúç|=ü‡Ó$³Mfpk?6.G‘HâP¥A…tjm/ÛѦúdèüÀôç·ë-éYrÆ.üí¦ÃþŽ»08XQ'e(nØ#cSw †8Ü’8:B·6¼#·ðßG)hBc¬0‘‚%ÈBåÉåV9§"dî*w„Íí Y)Î`ô*!ù oMøÜìd¤(Îî’ …[:ï‚i¤nYµ@½ŠŠ¥cÛO‰JˆÝZטٸÂÝîV¦²’ÝÒ¤Ü]¾…XM ´fÝ%üŽÎ‘๽ž•áMax·`”âÝr¦OVÓˆœÒnµwuй³—ÕSm(CÿÚE’£²ˆlTf ö-B@ºGÊ“$ŒMM(„Ï0|ÌAßÞ„òÁ'ZšBÑlnž—àjº4¶+#\ c:o¾vBüœX•ç*©­šKä~O "ôk=’ýq@aT¾dHÒúš´oyòøžé›Ç¹ú­äÍ” Ý^¨ßíNÃã‡1ËØâýS˜¤|(¹•Û'—?»ŸÜ71S× endstream endobj 215 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 216 0 obj 1434 endobj 217 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 211 0 obj << /D [209 0 R /XYZ 72 769.89 null] >> endobj 46 0 obj << /D [209 0 R /XYZ 72 697.113 null] >> endobj 50 0 obj << /D [209 0 R /XYZ 72 339.34 null] >> endobj 208 0 obj << /Font << /F21 134 0 R /F46 177 0 R /F20 127 0 R /F25 135 0 R >> /XObject << /Im2 206 0 R /Im3 207 0 R >> /ProcSet [ /PDF /Text ] >> endobj 223 0 obj << /Length 1221 /Filter /FlateDecode >> stream xÚWKoã6¾ûWè²€ÜÆ ŸuÜ>Ñ^Š¢¾u€‘äDX=¼–”4ýõr(Yt”8RœápžßLhôÑè× õëûÍí/œEŒ‘L)í%™X”2’(¥*%™PѾ‰þŽ÷[ÆãÇr»°Uîv"îŽåÉRÌÐÖµõ ÒLž—Ç¡Çã>7µ9ùÓ{ŽÓ6‰Ʀl'6ÓžT?›h¹Êa<µ² È­Hb²ÝI)ãÏu U{‡í?ûßÁ˜Ù¤4E "u†&=™z,­H!âfìÜÝ—¸Ö¨\yÂÏáÑ´¸û¯´„ÎZMìàH:’‹,Ú‰”$Ѿ€wáDnwŒR>UÃcSUŽÂþXø¯·Ò6?ï7³Ò<’‚IU”7›oó¹ý»vpû[#£ŸºÍŸð3‘v d·²yF(•aè%S@Ζ¡¯¶»$vÞRñÁ4•‹²qwÀ³.°Ä æ+úWƃ½ýÜáù9àÃLk˜ psHAü-+ÒÏñ¿±Il5€gÝ©©ÚŒ?ئ(&Юáчú¡z*[”Ùð˜ig³ªÎótí”ec3OÑEu½¨žÐYÕÄyQ%b‘ÞÀïÒil ŸŠE÷ÜÞxGu˜`2 âu¶Gè”ÐD£=ê–û||«°3I×á­—ª¬ñió׿°¸éбî!0äÕ¸ÔDh¾ôéŠv\i—¥Á¥0öl EBcª¶À¥>,Ë@Ü sß÷¨L(Ñ ¨O×¼*µ ,}Ç­Œ\b‘­1‘r’p~ ¯‚ÇÇîmâ×N]xrÔÜ­©Ê(a,›Xf‡âÃôèÊä A-‹Ñ³uìKC¿Ö—y×7þcÕã\+˜”âwzMsÀÉg¦3ñ˜«Äùt'9%iÇ$‘Ò#®E޵G9Q\L⽫j¢töúQ[_…übàbî@_eÙö•‡ý¿ªœ”·®Kæf(ÛUÂN°Ò8ƒä;?ÚÔj#XHùÐÀ)ä¨õêë>À5»À5{â!ßm'ÈçzjÿH‘ÞX¤·›eµ;.çÛ6Í€§KMlîa`Ô[U*L‡& ¥UÿßáZ…+IR-ûyCßlø9bLkâ«+$ó"é²f?,§êUËÍÎy·ûÎNMéIc_F7úí UÔ¼‡qB€Z€² õ ÈÑUà8Û#’ŽÅòVÞu”äÁ+ŽÓSfÓ§1Êõ2^Ys¥£±TTÉY1¿oè6- ¦šÈð.8‚Ý 0ÝŪַ4Ó¾à.7}é;Kå±o 3½9 Ê1€,ÆŒ9ºLíí~nL0søkuõµœNÍ©ž¯ë¡:Ö0aؼñ‡6jΉWœ£2"h6;ç;F¿ÿˆ õt€àºõ››Ù¢ùp%hzKðyp l†s:Â×rïmä©ÏïIH–z—âžÖvnަ(\zXyþ9 l`<²ÑãÙµ–i’@Ó lcœ¬B;t‹ÄqÝb ñå·±‚ÿ |ß6ê+k/Ó¹‘ÀÀ¿ÚH$IÜðé¸ürß ¸›±ÎΪØ_¸p0ÿ›Ò8I¡X¡‹ÀF1ÿ ¸ QüÈ£]ý endstream endobj 222 0 obj << /Type /Page /Contents 223 0 R /Resources 221 0 R /MediaBox [0 0 595.276 841.89] /Parent 193 0 R >> endobj 218 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-math.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 225 0 R /BBox [0 0 262 258] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 226 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 262 258] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 227 0 R >> stream xœ¥IŽìºr†çZE® MQI­À€ž=4<0ÒxïÂ8g`{àí?Fß(«.²Œ Ü£± ±ùõ•Šõß[yÀÿó·Ç?üGyüí·c÷QÕ±Ìq 4ç8¡EGkXÔòzlÎsÕ }X9ö ½\`Öƒî·Ù¬>2± ½žÐ N°þ9• =ó2“böz¤ þzü±­* &p]ý‚¸Z&pü2G޹ƒIÔD+Ù„Ú»% 8{¬ïõ® ½=ý¶"xtŠä^W’VžW;1ÏXúõX)ƼðiÖšÝö眇sl+ÏY©#ÔûãzGwIV|.Ÿe%•âÕðùÀ0œåÔ†¬$óÙ/ïXµìmâ3½SCÚáäÎÀS¸õïMæóÚ§ÌqŒç¾Â·Ì£\:œ[Îó|Øp_ŽÚºM€¶¢Þ'&(½‚¹_=µ5„_æÐ€®I0vulÎSpXý²<7Íœ_V+ut[­ÚÙ†³ÌîÌôjŸÍîKŸWÍë²¹Ùl]¡ÏÂÄö§p]÷“&PéP›Ì®Ò©Ë×rlz•18Á˜®3çÕ|ˆÖ´ºõîÜi¶A¥êTúd¦hsø6·´ãŒ"ëÛ®Ýɹ„ý 1qBuÈS\޳4r¬á¹Ì£óý5«—YIƒì×ã¬Ï³wKPŸeRÖŠvîkðïºn¾Ì¡cä,V5@2ú5ÏÍÑqQ[3j­è¸ÖcYVk\+5釚/ìDv==^ ÖZ™"a½Mâú/ÿ(qÝÿ·ÕÇ?-ÿmÿöï5¼ÿ¹íåñÏ5“`‰þ«“8|K¸<`¬à¬7•²¸K¸½i9ý¢Öàªö¯´dP*a­²”›/~?®\ž˜¹Æß¾4xà9Ìî=*MþIŒ´pQê‡ý‚Æ7Ƚ¯%®~ÑU…+\®åïý±i†{o÷Ri\»Éï!ažGõ^vR°[¯Ç´]mÃl¿×$%ÁŽËò^Vð‹Œ•ĦY ®kZdáuo/…¤{ÀÆmwÙ % Q 6(‘枸ÀCj3œXX`ÀF=±l˜Y\ë&6ö…&˜´õõ„šë Õ&.?Ô‚ûùòÑ~îò‘¤PGCM°ÌÁAƒŒÖ¬“Jl8¬Bì±*¨€\åëm3îËå^í»UÜw÷r’°™ƒƒÒ ²XO—V°½t’êÙ j‹Õ ŠÃ^‰ —­¢ºpŽFòÉ Hƒú‚‰Îs’ÂXO…4$†&¹uŒžKî움ìm°õêmGߢÉ{ØÉ;ªyôi. ðôŽ6ê°×b€…€4vaØ(Fà­ bÜI7ðÚ‹#Q\VíiÕ$N0ÍeóI]5 V^Ñqáã$J rnª¶_Ü¡2\’ù”ç#ÇŒBãøÉ®‹›$n»;>sl5\µ*¾Š«¾xà]|7¤«‹ïnx٪ܦý²4_ .0Zø›¤1îp°|àÆëâ#–çS@R*ƒš/Zä¥45˜=…Ayš‚Lþ£vÀ2Ê@ í j8xÔ°+€šå‹ †jJ  ¦Ô°í@ {¬ŠA ×ðzÛŒ¯A F5‚š•+šõt¨QšÕ j\65ÎÁ fÕ•@4È@÷0¨§ëA%¹ũëì7 †­5«Ôð`WP£³Á@&aT²ìj kÔøˆ2–qá"Ï~õ„eÞy® j¤Ûjtf1¨qsAx4*8{=¨Ñ©müÂŽÅœXjÄt ÆR¨AÛ°¨YaÌ ¦ÔȼaPcK@&àF×j¾ëè7 ÆL5ö4Ԁǃ°¨a‡5ìQP³ªñ ¦7Pãª=­šàqŒsùù¤Õj`R{P•{Pö5š„@ ˜Ôp̨Ñ8~ jŠBÜÉñjÝ%ß~ u¡=to‡^|Øf¡Û¼ÿ¶ûÔ`áï@MÅ!SP<ˆu^SHÊÍ*…ˆQuÖ©œÏ(È)á8‡„®hÝŸÚ£©á8‡»uayÞô²÷,/œ‡å…zÁQ^ìýHúbï5 1š}wÓ,Õ’MW:.Ø­t½E•±l¯26hœh ¡ gVÉ«Œe{•±Y½—RtØ^h˜½+I¡% ÒÒï3 ©Ak€íņ ·.нEµ¡ÕHí®6nMyGAö¬6ú•ÕÆJ“Ô Š¤6V¶¤6úÌjcÅ+ª €UIm¬4Imô‘ÕÆª+©Õ ¤6RLj‚äξ ÈÈjC=¬6–Ô°•¤6–+¨Ñ¢ÚXvRê±ˆŽšÕ{œ¶àlï<¦6¸vU«uAmŒ3«ÕŨ68ª6R”p¸žÔ†8PmŒÕÆ8“ÚX­Œjc9‚Úp= Ò²Ú€¢LA\¸ÄS2yã9n\„»­\Df–p›{ÂEØã¢rD.RÎ.pcGó\¤‹”ãÆE4s‘rD.RŽÌEʸq‘2"‘y#ÕŽÌE47ºG.ò]G¿á"ed.bOS¸H™‘‹”™¸H™™‹°G¹H‹”qã"®ÚÓªIžš¹ˆ›Oêꉋ”¹H‘‹”qã"š„¸H‹”qç"å''âfY””.c—3„.aa½˜|«áào|“wÞî¨0e"ûGÔ´ƒ¾êX1‡Ï{~?Ìsé'@poÇér#yê<‰‹Ä‚”‹€4ZEí´£‹g‡Ÿ­‘ª=Mtý„öw¶_ôù~ï¢I¦eÇ1H…¿ØO¨˜ àäïÃNô©“TÍk,•ÚNŸÀ4úÔ¦4ùRM='~žQÀ¿`¯A0R9P?òÁ ÈþHI¤")BìÆ_¡™çÀ¸"ÖtÇo‹¤²_®’BÚ©EÄ®èg[{ K<óɘ7 X‘úÃÇ´wùf«˜¹ŠÊ®¦{bäYϳVzü¤Yö‚Ÿ*Ùx(òYŸøƒß‹°‰RÛ[|p¼p»'žƒ_„è÷;p]é1¤`ルkoß]>E‹Û?8ò€ˆè¾P2»«…ì—k‡¤vj±+ï»÷œ²õ"k\ñI2—,)ëê’›—OEÈKr¼£WVöÎ#ôñŠÊ¾Ï¨ì Ei€Òiû½7—½¹‘¬Cèãô½¬"£(ð—í>ï$r^èãÌ2yq9ï:t(}<ƒÄÛk|³O£1´ô(FR×>£ÐÇ3È|°½Îw­S=ðB_«‘"Æ]èßšò¶µ,ôá›É(ôGËB>]LB¾ B¾‰BÀfÀ5“Ð_i’Ð% }øæ4 }ø84 ýÔ1¢¹³ï¸QÉB_=,ô—„þ˜7¡¿\Aè…>н(ôÕã"zf¡¯•õšíî1¡¯µ³Ð‡ã£¼Ðçs²Üœ% } ý%‚rWúâ@¡Gƒy¡?fú4ƒÐ_Ž ô]Ï„>Ž,ô!OúPªúR­N,m—$¸¢Ð½zÛÑw£èÌB_=ú4áP+/ô癄þ<³ÐŸ- ýقПÇMè«k:虄¾zt‚i.›OêR¡?[úË BÙYèC‡¼Ð‡£³L觘}ÌqüŒ>^¼¹s„«ÀÙ|,Sà#íÅ$>:ß4øøè7ø¸ò/Ú²4ñàÃÊŸL>ø¨rµõ òñi`V½SŸrÎxçÓÅåß©‡ŒÏïÏùˆñ‘Oñ€ñÁLJ3Îéxñ¡§‹=\|¸³Å©)©ù¨>.mäƒÅGT|ùPñÏáHñ‘g{c7Âyâ#'>t–øHG‰p’øˆ‰|ŽøˆÇˆxŠø¸">¾92“1ÙÈGˆ|‚øÈˆžyàÈLJ»vlæéùdð›cÈÁ˜Z+utð'3…¹ŸÍ$Æ~zŸûÏ߯íèl&²ý á#>nçƒx<øˆ§ƒ|8øÈgƒÒä› ¾Nù`ðÎt &[ßuíkÈ7ò™àöñx"øèŠ¿ðo“Œ|¸& ¼7ÂiàC¿Å‡M:&y®ìÈ'ßrêåÆ\oÄcÀG<|œÚdbz# ”Czã~øøéàCØÝÓº§4Õ…Îuv§\ ¾µ.¦þN唨¦+HHÞüêÐï¹¼_ð™ß+4—žETÄÇ”¤Œó`3ÏJßW@ª|\>Œq)B}¿C„&|F!ð¼8€ë‚$Âj˽Éq[·ºKCŸ?]_ª^ˆL%˜Cèà *~¥ÄT¼G™€¿…b:aï‡e=L) ARArl²„q™¶Ä­n/ø`j «EA,lÎ#À¡±Ð» ZŸºÝèši‚æõ‚š*b 4ô¸c»L‚š— ò—¬tW;k»Ñ ØaÝY4ä&¼ã G ² à*ˆøÆ&ŠXíƒh€ßþ ¢¡Ï(à÷Õ¢hX)¢h€¿?DüòG ðû²A4ÄÎR8þT4¬yEƒ8X4ÀÇN4¬7Ö(–#ˆ†ÑƒhXÿFÑ Žpjy ì1Àyn R«ˆx÷v¢ƒÍ(8lÛ‰é3‹6ÃÎ:f l£h âD|æEÃèQ4,Û‹대ƒžDdð¢ t¢ëÓ™"Í9*8Ñ@Öw]{ Z â°Óª[ ³Ñ0[ ó¢a^4ÀW=A4ˆÃ&÷Dƒ8ì´ìšDƒ8L4@­&æDÃ2£h˜-ˆ &b„ˆ´ÿ‡h˜“ö¼?!CÎÅröS±Ícgbü..Gt¯Jvùë%Ÿ|$¹~éå)¿õ¤]Suû£mþo¹éŸh«þï¶a>»Þ(É_·¿lZàì¼ endstream endobj 225 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 226 0 obj 7036 endobj 227 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 219 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-scalarconcat.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 228 0 R /BBox [0 0 232 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 229 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 232 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 230 0 R >> stream xœ¥WI®%5Üûu‚Âóp$$ÐKÄjú,€×'#ÛUï ÔB-õ¯HO™éLG¼?œ?ðïÏ_ޝ~òÇ/¹ÔNŸÛQÒ™F8~?.¡—3út¤zúŽRÏû‘òY9…בÒéi• ǹ,Ú†‡³c\gû³ö~8ÝM!M,ghÑ0¡6Po~¤œ±¶¿ ;2Œá6Mª@1ñôܳ¹­ˆ½®±vsIG‰g*ã0$ù¹Ž{¾>Ž_mŽ3È2ê@ç à‰óÙzâ8dÑÌ @:Ö:‡uk]z;èzsôç—ëÍñì‰sÜC¤ÙŸ#¬h”ƒÆ[¸±àl¦«éiÃþ,1‘ƒYãMãL©® ”±Í§á9=Yî¡Ý;ÿƒ²ÛÏ:6rG¶[­â@NÛðͤûÑ›˜û9B·Š£˜S=Q²%?¬Fs={)Ǭ`Â1×YÒ™\;†}@a ¾*Ìk♬DÅvj #Q3¶à‰©ò<7›'±‘/Ó ¨ƒÒ´K zµQ ’îo„ãž”JngÞs"0žŸ1HùûŠS´S|•ÇÂŽ`i©à–ûeä-åô#K8%ð#€ÚÁV>ÎZ׃¬ðÍ ÷¤;n®¿‰åµh¨†Ä7^0ð] –úÌÍF½\etpéÆÔ¹/NR­s8ž¾sLsV)2}安gÐåØÖr°b+g[ðÄ™Ÿ¢>-r÷ J?¡œå8ñd´dèbÇ}›£Ô2µXøNó>3d9üþkËa8þvñø†ì¿¹~<üéŸ]ðÇ·õEEçEn ÔdôÛWEkào£—"òìõÅcºÞÕÁNTDþé  Òã èMäµô·m0à£èHY3ð|ØÜO/E30hÉQ‡˜!1‚ µLÇ`2œEL˜ÉІ;·8!!!<ö¸&CÃ3þÊÜ7±S¸”ÉO¼à¡d¨Çixä‹¡4A”A$̆b°8Ñ_tY< `‚÷ ‘-3‚Iïð7“Ñ`ÖãÔ–aJ$¿ÆÂŽ Sâ`J\A%®, %b6ESE>b+¼ïZärÐìsC æaäF¹ûÿ.¢wåPåÁMúêOƒ] `F¨ÁW€Ôª€ÌŠábarœ ³#ÐÆÌl¦Oßµ ³&‚Oóu@ÉØÊÜÖ¼(‘ŽO0€$À’8U]M*¼$ßÖxQâ b9’´>’ö%T "bª 1 Wá£yµ”Ì–,$âмÉY?h2b¤1¡6šÝ¶ðÌ=_I-Ä&ÜAíì¶pÑ!V‘¤Û£Òº¢‹1eÅÍÑm™my  ë¡kÓ„Êèk;ÂÐãlB3f“Õ7g9ûOÿ¿(û)hö³ª |ˆT ÿ%ØÜ†Ê6‡kÓß$Òl— ›AôÂ4Hù¨ü¥BÉð³`i†°-]Û^ T6Ø {mÏõ*’°Ü”à&àÑM;¸Í"âW,õ¸É‡yžé8Tµ`dBßÄ„&!Iä”ã÷ÌÎäÛ"QÓ ZpÓ+¯ó…ÓKIÌtùý¼ë o^ÒÒîÜHIßäfÜô=wAá°’b*Š€_Ù»¤@~vM 7QÁex“Ê~Ü å®+àÈ.,žÁÈ-´ÿԔϻ¶0ƒj pÜÒæÝÄ »ºäà&/oúbV2ú®0ܲLIak^ &2ìT ÔÁ«°„à]g ºMgh̦3º–™¨ö4Å%4è{8mWpRÃÍq¿k-[ÎDmð‚%7oèãl9ouŠº3‡ã.8ý[h?‡æ-’aWwÅQûSqÐÉ]qÜG­Åa†Õtµ<‡VÃèšæ8pêR„vÅAð®8Ħ8nŠãž!IkÿŠ£Eå> endobj 229 0 obj 1727 endobj 230 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 224 0 obj << /D [222 0 R /XYZ 72 769.89 null] >> endobj 54 0 obj << /D [222 0 R /XYZ 72 723.255 null] >> endobj 58 0 obj << /D [222 0 R /XYZ 72 340.692 null] >> endobj 221 0 obj << /Font << /F21 134 0 R /F20 127 0 R /F46 177 0 R /F25 135 0 R >> /XObject << /Im4 218 0 R /Im5 219 0 R >> /ProcSet [ /PDF /Text ] >> endobj 236 0 obj << /Length 1620 /Filter /FlateDecode >> stream xÚ•XKsÛ6¾ûWp&*µ¼ rh§M'Î4­}kz`DØâT$‘ªëþú.°EÊz8M‚‹Å¾ð} Óì1£ÙÏ74>¸¿y÷ÓŒ1b•âÙýCVð¬P±Be÷Uög.'z±d”Òünß4åPwíb)„È˶ÂÁ§—ùn¡ó®Ú¯œûmëv Æórèvýâ¯û_n~º¿a°+ìæ7ÑŒ©²UsóuœöÿŸšx÷±ÑÙÝÍïð/}Z‚ŽåA z¦ž0ByÚ­D¦¬&”Êì¾Çî½uk×;°×ŠÌÖùS‡/ÝÌx˜âùPþ%K|lj¿¢âd+ÛøîÃñ¸o\;Ü.–’Ñ-¯i¿k‡µkP°n‡n¦·_•XD¿<㜫aÁÎGqæÏ”aD)ƒõžº}„%Òæû-<Í»¾7ûÍPo7Ï£ÀÐ=º 5ˆ•›Mœ^; =~®[œ¬²X**ó»Î[óîƒÔ³GË„1Dõ¼ÏTQñ¦Òðd¸þlʤ4„²#1äSCÁ¶¾l¢ÉeÉ(.]Æ*«ôwáwÅÆ5Ი¯õɼ°S”0{´ßv×UßÎ4)¤˜ëHL`$T)ÀO]·–%Ž£ð6ü®X# J›ùZ¨meþiãÊ>ÚÒvƒKæ•Ã%k¤â¤ÐGÖÄᯠ‘b‚0}ænw­`c­‹IœÚ†kdJ'…Tðb¾2¦—ª³K™%L²ùRÒÕ-…!ÔÎÖaÉ‹"•<Œ®dœr8Tø%”‚'è´§GN†)HÿPÖ-ò(|ÃÊ€í¾ùr’¤…†B‚6á餹˜Ð+H¯¦úzUEþ= =v]55g,J˜ž„VAe þ²û;FBdô|•oýπĸ£–pè‹g N*8bõ*LyÀ.-L9CF¢Iü/èctfáK”Ч0]è}hAg =vú~7ìôQA9¤ÑÔ¬éØ[qª š8®(´ ª˜;>út&jše’iô”fuò¾˜x‹¾ ŸŠhù~šüc‹3±*]»ŠZ¦ê|:îë¦ÆÁ‹uGª§©)| ±‚Ópä³w¤€:»™k•¾ ¿k!QHÊÌ×@ x7¸à¦?ŠÜ­»ý&0•Z^yö˜‚Lì[ÃxÊò‹f“ç.BDÚQ}7ý˜ÃéCl\²ã¸iWy‘Á["|Ô&Žñ7çÎ\Ve_˜86ä">ôþñÚuî¢]@ž@ŸÙJö=tôãä@® ¦Èà^ Iã(ÂøLÿjkºS endstream endobj 235 0 obj << /Type /Page /Contents 236 0 R /Resources 234 0 R /MediaBox [0 0 595.276 841.89] /Parent 193 0 R >> endobj 220 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-sumprod.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 238 0 R /BBox [0 0 235 130] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 239 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 235 130] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 240 0 R >> stream xœ•ZË®-9 ×WÔ•wòHH €!b€6ên¡s ~¯e;É~tKG-õ-;Nb;¶“å}~=îÿýççóÿ¼ÏŸÿ{¤vݹ£]i„óǹèêù5éqÅ;©^w g¸ï+Å~¦|!§gJ×-ó¦@œ3£¯ùàw¹:ÆU|ä«ö~¶ž‘"X®Ð¢ÓBµÑ@õV JÊ aù‡Ó‡0FŒÐ\ÄÀ@½¨˜(ž{vÅ¢Ú5§!sIç%Ë8R=Îg—}¿I÷ΨNœ3@Mº_­P´c¨bæC#it¬uÛÒ6õi£Ç‡­z;ᯞèã¢Häû¹`F‡|2Þúà‘Åms¸zOã)%Rµ8+¥ºIˆKÆ>CZ¤‹²žE»ú]ÄHUBýª£œ“–Bîðx«UuÈi~²A4úåͬ†÷k„îa'†=® *ÝcFj®W/å\‘,Œ˜ëŠí,Ž®w Ã<%‰Ð‡Ó›“„i˜ŒcrFdø|Í%^éœøòÍBÑ'uX2iƒš*bNÐõQ3U²LìÙˆš,³{FÉz|Æ ™pWìbIsW5r,ú²4%%ö–úeäåñÐ=²šSë‚KÝq†½mä9àZØ ª×™(Oª°å=Š$wH<÷ £×Q £ÜY}B¦jã’§BÆÔ5@?ίRëì4LÊR ØÁ«ÞÃé-™Ê½–×í•1ƒÛ—x¥;‹Ó÷ƒçäTå„ÊY7T]FKN=¨üÝæ¨Ô!-î…ÃÜO¾:Ê]ù×?º+Ãù¿#žþ¿¿ÿã”T8ÿ%Ž9ÿ|F¤&EÍg¼Ÿ?± >Bò)¹}rø˜ëÔa§„TøÛ74©ÃVèÁfÛÇs¼®·‚¤#÷;dæ,pàï^wNgÅŸâßñÑÔC>Zþ¦YÐ=d5b@ ”OhÚüßr$ÐÉÙÆ‹‰HëÇa Áйæ»?¤ à0ò"n–Å)Œw-ngÐE/,îLMD(nUpFiÐMÌ—¢ü³ ’ðâSä8ŸÍ#µãpúÁ$Ky °8·B:GMÉΔ;ºB çpÒ‘Oû¤ëZSJèÚÔIèÇ}Lf(<}‘•Uä±R¿#¯n\ cLš·]‡o•æ&Iø¬Ù*y•%ÒrÈ1>¬+é«Ýð†dïË%i2s\œ—é’táõÕ¸P‰Ôß7üdb˜…ã]kä¶Ò-”³â%1‚^# ç=ÊÞË7;ZãºetF¢s:]øEÎÆGNb˜}AU9”ÔkY#538é¾”~ðkŒ89ôX™îšT_t“/ÏzEÛÒ9Çbé¬](1B¨ß]6GŠsj>—«ÆJO›Há toãÉú4Ô稩ɳc¿x ¯Îþp A.ü\ö™ͯÓ¡Rføêô:ÀP£<ÍäÿW¦³•‚ØR—€FB–ÛJÅÝèaam$½LFÈÛr¹Ôö´Å}µw-$‘¢î¡×ô¸zÜö˜Œu¢Ý<¿hŸ‡QìDmÖ£2Å¿¨‰Æ^ÓªFnÊàã"Üæ0¥4'§M ð ÍRÇØœ /D‹3õjï?ºcgU¨šºV?ˆz«1ÄC<¨žfÇAFAÇR5™Û—-Y^×q3&ÏÃe*}ìÆ¸ÈRý9¿o±ù :Ø3E"šqÅ[•ÑK^ v‡âkøàØ¥¨ÃœñáZ`ƒË «€{ç(ä^œÆGdp¤¨»‰Èúv†8˜”§rBªk:¿‹½—•JDßÇš ÖÂÑ`E$çE]%Á«D(ÜÍâÅïÎQ$ÎIA«Þó cR âíµo2@ÍôRTh@h>^C“.†Êß\«G¡‚Oâã}¢‚óũĨ ÕÄÆ¹›vÍà ¨urÖ6¾Äó¶ª|¨¬@¡IÏCQmÈ^7‹ÁuÈ(^`)/I†10Mïƒj¾9f_Ó‚‚öÅHDíØKa;}Úí*R0w{MqN&vÇÑ(x‡B9m"o†ñlÞŒýàà™ÐgüŠC&§ƃVo‘/hJ¼çÆ üÉ༽̄VìÞ Ì/ÎæÑfx~¹«M„¯~M{ç$õÇÚ]͆vÁhfX¹ç¸å ˜zžœÍ+I_»/^b¸ jÌÏŽ3†D l¦—”9lê I-õ)! €}Ò€X›eŠ÷w7*âç1‘«Þqåo;kêå¦tµFã³U ýEŽš!ÛÅ™§)}mwMm¡¦wBg.‚>€3 lµ>€r@ßöz¼(ÅÞÍ*ã±XkÛ¼¶yáÌ›³V>MVµ¦7·K™ZÙàæ¦ÛhiÒ3èn›H»|F9_}¦®~õã·.×êð7|±RÈ×ÞM_nwØ®<š[ûÏnÿ9ç›°¼°þ ]äQÓªö(:jg`ÒÕûí»Ž‘}{Ôý«Aõš ÆÛGÔ|(„•!»Èê¿ò„ìÑA=—ûŒéèðE0HOF&²‰‡F«„KëNEââ:|¸³0´Â'-Ð’BåÒ“®öJ–Û¿*Å3Ê„à+ݤŒß¸¸¬é,4ÞsÖôj7ašWy‘ŠA·ñiŸüÓêùb¿Ð[\.1†ÔÜf=>)Q² !kÉ #è¼í|øÈnvnH°ÍœÎl†Ð0¤x,IÝB[¼ÖùÀFÅÚlYä9:•` “<~ϰÏÀZ7‰%¬]7+ æUŸ äà­82ŸpSçL¨/¤ƒecè~Ç—¾!ŸHænGQ6㑦•ÏL¯Þª#®]ø¸éÓ«È…o¤jŒ÷Úן·Ð 6= ï.ûŽƒ.9ÊE» ÀuêEbT†y‘ÖÖ!¯Ñc H­Íkº“~Ò“˜x>Ýd®?3Ä÷· qílú³ö4˜¹ 2F`†B÷àI±m¨9‚›Ý¦)Ðyút'—AÆÈs¼ªýlWÏõgjøþf®]žÚmÚ4èÓ!Ê ž«l6ÆðÐ òxù£XÝ:ÀIe†3©”j?V¡RÞŽ] ò>š$ó]¡X„I.9CN 78ðu(ëL _”óÌ‰Š›@÷)À_[„Bglj$Ø*rÆL3³þ˜œ_Žmz?8+Wê¤M1[+~êÀå£na!p>ãgŒ)Ué8$—ÉÆÈÚèE7 ľþ ©Vy¬°¨Ü÷w›§e—͇ÙóÑÄïµ¢¾*ƒ‘83ã®F!é¥êCu“Qèj⟚‰øαÂdx ÁÅ:Ñ/v@·>§V@ËBiz“k÷ û²%{>çGØbkù ¼ämàãw%îu<ÿD#»+ým¼8Ö5À yÃý€BF-;lø~av ´~¸€Ð€õPÚ002Y¿àʼnŠHu+ay³`Nò^1òÄùMïpUÑýZÏ@éZ—€m`ÓŸ÷{|RáS“ 7ÓÖ#¨ìÈot¶ä47¨ÚÓb|£A šx °?°ÍIhltaw@v™ÍÄæ€)¢ô6Fek@ÎÀ; )ðjŒžÂ‹}Ÿ]&àµÀüqNF±¦@fSÀÃYðq×Jlá. þ¸?17J5BÉâÔ´àŒåŒAìoŒcqjwèosÞxj’ú®j(a½ÕmmDö>@f`Ž›ÍÁšJ3[ØÐ=Ûݤtd j#]ãeÙ¥ €´0Çñ?È:vc ý/ŸøÇ­ÐitZ«÷mò¹2ÅÕñaÕTÿ8ƨß3íSè/Ȉ ýƘ§( `~0ù‘7Hâá¡?ü ;ÿè|èÊÍó^7‹±’N@¸o` c&ŒÏycdÃùw„<–Nœ]M%À|#jÄÝÖø¸²(bü'©[_œö=„ŸìÎû}Xߪ¡z½Á‰†é§NDÿm@íýÙ¤·óûAà³~œ¼ã/â=¦”öüôÂË·þÕCXëéíûP‘ŸŽ¿ÿ|r³ endstream endobj 238 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 239 0 obj 3084 endobj 240 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 231 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-count.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 241 0 R /BBox [0 0 216 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 242 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 216 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 243 0 R >> stream xœ•XËŽ,9Ýû+ò ¿_€„Äb˜%bÍ Ô³üþœgVU éª'ìp<aûÔ¿C<ø÷Ÿ_?ü=¿þ7”qÆ:ŽVβÒñÛqã–úñµq;s,Gég,éhý,y¥ž (¼ŽRÎ-Î[-û‚—|§srÜfdzÏy[Í &¶3ìh¬A4G£¥V.Äå/Ç‚•3ÝÆô´8¡ÇE”‹L¯³ºÛ†Äëž›ãX[9Z>K[‡#ÍÏu¼æëëøgÀâ´Éê‹ÜÄ_×sÌD$q¨ÒΠB :÷¾‡miS}1t}cú—í­ùœEr-$uŠiÆC)¥­ªèŽÁpöÑ®ñö;9Áàåv}Ø|ÌîÓÃãïbøÜ©ã9¢¸ÞÖÄ ý1²«Þ¡ŒfG*«™Å²Ð‚º±4¢¬=Dçž'eñ §„ÐqЬ©s)¸ív1ôuþÆX-óÅuÚð½Æ;hµ»_ᘜ¿6ºäšcÝh 5 k~¾Ž·„ñÄúÈáwiîçj/iV¶®I<[€®ƒ„ÌuAŠ Oºçù•bõ}Ò HŒ6-¥)âŽmÒ5®[ ù 4˜õü÷Œºàªê|XoEÞ“”˜×¼¶é3 ÈK›^s ^"àR{¼Ë8Ë;>°%åÚ‚‡/yÔì¿¥ö›ì§äÅys=0sý%‚4öœßéÉ •°.E®…L ã}LÈZØtÁá®å-À«€çö×öÀ$ÁÞ ×ù4ivI>.'Љ-Ù‚*ûC5ÛŒ&Åé^^[n/ !U÷!ð6s]g„;h­´3á&¹Û7%£ŒZQ<^÷…ÖûNýÈȯ y˜¤<ôeÂ!ܯòÌàGó¡ö˜#•äÓ?Ÿ‰Ô¤'©õ‡@™úy¦Ò„«c+Èdˆ§PMÃHLÉþÑ éVM¾ì%€÷†LQ æšœÃ×4ȹU9»W%»SH;=Ö¾ì¹¥í¢‘äN$ â¾ä=¼í-cîtˆÔ=ì Y¸6Š…Ü}Ãdäý-‰’r˜ )ˆ”C?””¿oANÈ xŠ‹ž×bLFœÖƒÐc®þbïúÎ…oÎòò"U¬¬7h“ÈCG‰ï:Ÿ‚e ß­Z ^%ÅÒ1þ Àî(D%,ßÇ5f6$¯ ƒaw+SÙÏú’&ÅTŸß²—ÐyZ³î²OçÈöïJ÷—ÐýG0Ê÷9SÂ/ J€XaAŒy·‚Ú»;ÅÜÙÃêi–†2ôÿBû¦Hš=)ŠñÚ-Ø»ØôjïÚ¤„vë‘5 û7 ùëFï÷„$üŸ¯ä“?¾¬}n^·ànºº¶+#Ü c:$BbU^Ùü€¨*•r—–>yÜå,o®=žùS@–z¼eHÒúž´ºó ¡w^Ÿ?ÎäM ÚôEû±§+ÚœµfHü æþ”ŸäCi•Ç'‡ ?…ßÜ΃, endstream endobj 241 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 242 0 obj 1899 endobj 243 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 232 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-listrep.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 244 0 R /BBox [0 0 239 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 245 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 239 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 246 0 R >> stream xœ•XI®%5Üûu‚Âóp$$ÐKÄjú,€×'#ÛUï é«]‘ž2ә޸ï/çüûû·ã›_üñÛ?.µÓçv”t¦Ž?…K¨ÇÇÄåŒ>©ž>…£Ô3Å~¤|BNáu¤tzZeÃq.‹¶áÅßáì×Ùþ¬½NwSHËZ4L¨Ô[)gl„í/ÃŽ #F¸MÓÃÀ„êPL<=÷ln+b¯k,†Á\ÒQâ™Ê8 I~®ãž¯ãwG›ã ²Œ:Á¹øcâ|¶€8Y43(ƒŽµÎaÝZ—ÞºÞýõåzs<{â÷iFöçÈ+%äã ñÖn,8›éjzÚ°?KLä`ÖxÓ8Sªkåclói¸ENO–{hg÷ÅÎÿ ìö³ŽÍ@„Ü‘íV«8Ó6|óé~Fô&æ~ŽÐ­â(fÅTO”,BÉ«Ñ\Ï^Ê1+˜pÌu–t¦׎a_#Pƒ/‡ óšx&+Qq†…èHÔ̇-xbª<ÏÍfÇIläK ä´ê ôí¨^mTƒ¤ûḧ¥’Û™÷œŒgÁg Rþ¾âí_%ı°#Xš@*¸å~yËG9ýÈN ü v°•³Öõ +|óBÅ=鎛ëoby­ª!ñÌ0lƒ¥>3F³Q/W\º1u®À‹“TëާïSãœUŠL_¹kâYt9¶µ¬ØÊÙlî——¢ž»²eÂ…… '¾ì>˜ kæw¢7yÇ^G¯ÜÒ6\æ²b^ø.ƒ™Pg—.L¨»)¤‰]˜P0!fÎLH~0-AÅŽ „˜&ÜX„˜ ˜4” ÉfBÁŽ ˜«zfBCA™ðž/Îmç3È"t´VŽLg„%†³ &}à)µ ëÖºôvÐõæè×7aᮼ13!­&¤q0!ݘ´êÈÌ„ 'aBrAâ‘™pMð`Â#3!í/LHÃ̄ݘpaB3Ð`Bʶ0!9&œÃ7ÿ‘îgD¯1˜´ä¨C̘ A†Z¦c0Î"&ÌdhÃ[œÈ{Ü“¡áeî›Ø©\Êä§ ^ðP2Ôã4<òEÈPš€ J‹ fC1Xœè/º¬GP0Á{È–Á¤wø›Éh0ëqjË0%’_caG)q0%® „W–„1›¢©"±Þw-r9hv€¹¡ó0r£ÜýÑ»r¨òà&}õ§Á. 0# T„€à+@jU@æFÅp±09Î …Ù‘hHcf6Ó§ïZ†YÁ§y€: dlenk^ ”áHǧF@’@`Iœª.&^„ok¼‚(q± IZIû U‚ˆ˜ªBŒÂUøh^-%³% I4³|t¢šŒiL¨f·m#<sÏWR ôÊ”ªÂ°ÚfàW&¤Àoþ‘o‹Âí܆k ³LCFæd baùî¢áåši¯0 Nų;—DjÊÏÚÂ3Om[D!°µEDöm‹zÿžîÒD†»Y8F‹9Öç7’%•ãÄ@n4î\*Ç2ºL¹~ ×G':¾Àån­!‹ò¹D]oknwÈ7NsJë$®5l!tV çÊê•‘7;~ªÌ“JºP¼–yñªÉ貤^飨PÙæðé6ýMƒv]¶D˜Mƒ¼32¹I3jÚ‡6 øe‰³PòZš×‹  úÌVûØž‹~JÛ%à¦ÑàÑM¤¹Í"*W,™¸é´yž 58„®usBÙ¥Ú„¦ÕI””·»dÚ‰\›]€›`[y|§—d›Øòöm/.¼¡,º¤›È xæw݆7áP»rsXí6¥[@ví†üìâ nêËð¦ßåú¦ßpÊMÀÁ‘]Á=ƒá[xÆ÷&Í?DœTÄÜD©¤»Šƒa—qþÛtàMÈMÃJFÙ¥œ[–©ÝlÍ«ÁÔœª:x–‚¼ :Šjt³ :…n×?uÜbVtô½):œ¶K:8MçæxÛEÝŒ¨º-g"ëxÁÒuŽ7ôq¶‚œ·:EÝ™ÃcWv‚þ/´wERÒÎ óɰK;‚»´kå)íZ¾I;‚›´ké!ḭ́š®Å‡´SÃj]óbؤN]ÒŽÐ.íÞ¥‚ؤÁMÚÝ3Äi}&íSœ×ôWˆ0ÂçÂÐEìï¾zÝi”ßFhŽüv%¿¯”ýSk)ó',Ù>1üÕýàþô¹€ endstream endobj 244 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 245 0 obj 1831 endobj 246 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 237 0 obj << /D [235 0 R /XYZ 72 769.89 null] >> endobj 62 0 obj << /D [235 0 R /XYZ 72 769.89 null] >> endobj 66 0 obj << /D [235 0 R /XYZ 72 520.737 null] >> endobj 70 0 obj << /D [235 0 R /XYZ 72 304.674 null] >> endobj 234 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R /F25 135 0 R >> /XObject << /Im6 220 0 R /Im7 231 0 R /Im8 232 0 R >> /ProcSet [ /PDF /Text ] >> endobj 251 0 obj << /Length 1403 /Filter /FlateDecode >> stream xÚWYoã6~ϯÐk3¼%½öHÑ¢Àöð[ÛÅbl¡:²–œíö×wÈ¡$2+ÇS¤Èá7×7#ššüxGýøíþîþÓ„1R(Å“ýS’ñ$S)„JöUòg*'ÅfÇ(¥éïew4›"ýølÎÆÓrìÏ›¿÷?ßý°¿c dYZI"Urhï>ÍËömáþ§¶H¾ïï~ƒßôj2v‹ÄÉBœ”ùt#Z‰DKJ(•ɾØ{ î`¹æ)"uØí´±»•Ãy£SSŽfÀyi‘6õf§ÓaôÇžp|)›Ë´Ñ{vÿƒéƺ;âú8]}¬_L÷ ÅæY÷ND|<•/³Ò6R ËQ*G%ÝÅýcùX7õøC3‡RОF—²ð²Fg æã·tàGÜ$UUþ(sAiÏhÿÊ[°Ž`“€Ë„bD@å@=ò”žÖ3¹§v¸¡ñäŽMÏ¥qXìŒhW<‚‘ZÄLæ„ð‰âÎ †U.§ŽÄ•µØLãl•Æ?ZL•9Ïw†>¬08’ðìýÎV |‘²Îß<îS+HÎã>©SD­†ãm ußwÝ|ª±v_¤)÷†„Ý%N':š ª®@ Ì)TŒi°” Eâ CÎg0-Ðet¶|©ûË€…FÌ¢¼.3þ€.aöèw»>x{²¢9TÀøV‹/7ÚëoªˆÈÂÆôÅœ‘Fx1¡Ë#t… ìHd[s )cñàÉöV¿L%)Xö–ûL¨úÖ¡øoBW®* aRO˜|éñ>¹Š /Û²û‚K_…U>)[D¡ä+tP  €+|khc šc2ò¡äöÃeÀå®ÇÚ‘Á|º˜î`lß åío®%TE—ÎD ¡4bƒk+Ï­Ø”‘ð5Jš¨VN‰d°ZÞ®„Rp¢¤Xƒö.@2g$ƒO¢ð¼·Š­^ÊSyp)7/v)€94ô›K›ÎD´hí`ÌA endstream endobj 250 0 obj << /Type /Page /Contents 251 0 R /Resources 249 0 R /MediaBox [0 0 595.276 841.89] /Parent 253 0 R >> endobj 233 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-range.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 254 0 R /BBox [0 0 235 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 255 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 235 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 256 0 R >> stream xœ•XI®%5Üûu‚Âóp$$ÐKÄjú,€×'#ÛUï é«]‘ž2Ó™Žxÿ/çüûû·ã›_üñÛ?.µÓçv”t¦Ž?…K¨ÇÇÄåŒ>©ž>…£Ô3Å~¤|BNáu¤tzZeÃq.‹¶áÅßáì×Ùþ¬½NwSHËZ4L¨Ô[)gl„í/ÃŽ #F¸MÓÃÀ„êPL<=÷ln+b¯k,†Á\ÒQâ™Ê8 I~®ãž¯ãwG›ã ²Œ:Á¹øcâ|¶€8Y43(ƒŽµÎaÝZ—ÞºÞýõåzs<{â÷iFöçÈ+%äã ñÖn,8›éjzÚ°?KLä`ÖxÓ8Sªkåclói¸ENO–{hg÷ÅÎÿ ìö³ŽÍ@„Ü‘íV«8Ó6|óé~Fô&æ~ŽÐ­â(fÅTO”,BÉ«Ñ\Ï^Ê1+˜pÌu–t¦׎a_#Pƒ/‡ óšx&+Qq†…èHÔ̇-xbª<ÏÍfÇIläK ä´ê ôí¨^mTƒ¤ûḧ¥’Û™÷œŒgÁg Rþ¾âí_%ı°#Xš@*¸å~yËG9ýÈN ü v°•³Öõ +|óBÅ=鎛ëoby­ª!ñÌ0lƒ¥>3F³Q/W\º1u®À‹“TëާïSãœUŠL_¹kâYt9¶µ¬ØÊÙlî——¢ž»²eÂ…… '¾ì>˜ kæw¢7yÇ^G¯ÜÒ6\æ²b^ø.ƒ™Pg—.L¨»)¤‰]˜P0!fÎLH~0-AÅŽ „˜&ÜX„˜ ˜4” ÉfBÁŽ ˜«zfBCA™ðž/Îmç3È"t´VŽLg„%†³ &}à)µ ëÖºôvÐõæè×7aᮼ13!­&¤q0!ݘ´êÈÌ„ 'aBrAâ‘™pMð`Â#3!í/LHÃ̄ݘpaB3Ð`Bʶ0!9&œÃ7ÿ‘îgD¯1˜´ä¨C̘ A†Z¦c0Î"&ÌdhÃ[œÈ{Ü“¡áeî›Ø©\Êä§ ^ðP2Ôã4<òEÈPš€ J‹ fC1Xœè/º¬GP0Á{È–Á¤wø›Éh0ëqjË0%’_caG)q0%® „W–„1›¢©"±Þw-r9hv€¹¡ó0r£ÜýÑ»r¨òà&}õ§Á. 0# T„€à+@jU@æFÅp±09Î …Ù‘hHcf6Ó§ïZ†YÁ§y€: dlenk^ ”áHǧF@’@`Iœª.&^„ok¼‚(q± IZIû U‚ˆ˜ªBŒÂUøh^-%³% Iü4’¬CôA“# µÑì¶m„‡`îùJj!6ájfµÍ€‹±Š´ ÝÞ•Ö]Œ)+nŽnËlËK]]›. TF_Û ¼( ;Î&4c6Y}s–³ÿôÿMUGò.õ=Äi_©5!”4š–Ë" «®»¨=[;¡ÅªóXVk$Vó7‰Ep“Xø }“XfXMWûCb©a5Œ®y1l §.‰Eh—Xï Al‹à&±îâ´>“ö)Σ4çõöù?%è¢?¤ï¶zÝiôÃæŒõwްêß<ÂüS–lŸþê~pÿ»  endstream endobj 254 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 255 0 obj 1790 endobj 256 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 247 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-listconcat.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 257 0 R /BBox [0 0 256 118] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 258 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 256 118] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 259 0 R >> stream xœ•XI®ìÆÜó<]óp´´4´hH†Ñ!k¡ë+"‡"»_K@ã-^EÖCee$û·-ìüûÿ¯û?~û¯¿o¹¡ô}Ô#ϸÛ/\cÛ ÷#…¼çv„÷1ŽœÆžËQ6ƒçžó°Ë§ÓÚ–üÀSÆùœ·Õéhcì›f ë{r Ôg'½ÒŽ\ âñ§ã ‚™ÍÆò8¹ …I”²,/£¸Ù†Äꖪ㠰Լrä:wGŸsŽ×cÿï†Ã©’Ù&#¸v?nG‘Hüèj˜GP¡8Z[Óv´m}Rt¾QýË—ë-ˆW–˜°¢„c–Êyì˜ïcòÆR¤±%cäGM6ó7Ï#çv-@<æm=¦{’ð½‡~ŒP]ÿÑG›7Ä2íÞšPòmúÉ~†ûÕ£7>cÆáŸ ÷#"X@9LÏÑÒŽQë¾28•¶Rº Àmp:´Dç”ËAbž ¯`!¯{¼ðæ‚ 9óX^±>„ÇR§¾Á–´Ù ´I}p$"_}Öœ„FÜÓs˜*¥å…H?SÔôZ쥄¦.Î o€µ+DÂ]æ×YnñÀ™EÝ©QŠs‡G…´rÝyâ»6©æ5yO¦¿ñåkT¼è˜åÆ+W8ö‹®¡FÒ妳x™@)ÉÂs¯é¨­­ét„!>¡ ÕˆdŽ^åÎ…WÔ°ŽVņ=}Ã+nRŠ¢-Éë›?P)ªN-™=;:ÅðÐ×,®H—Vw³x0„¯òþðOaÜÿØÒþ/Èÿ·ýû§)»ÿg‹aÿnÇ»Àõ~ã8ÆœLá6’TàVŠ$«¯‘ÌÙþ­M1BråÇ @êɨ‰²ÿc  bš£‡Œ†ÍÛVµüÇ/‰3õeÎllxaeCÇU.|LaÃÙ¤V –RË ž¼E>kŸ®k[õOGaC_” í4ƒ'ãK64 D"²Ò44¼A lÈåÈ?থlÄ$sEÑØv 3õÈ^3 :ÊÆ†Ïñ’àщRÒµCÙÐqJ#³M‰§æ¬Vìú´m[ŸoT­ 8ˆÜÁ° wpi‘ÛP6Ä<Ù7¦ÏªÈ†Îʆ«¿ Kn·lxÁ$lˆmʆT 64ý¹!²á`%Ùû„ ¡lxM?ÙÏp¿zôÕç¢p¥‰ ªð!! ÑÒo•„¸’Xѧõ™‘Xðy?BˆŽ—ÿMøoáÍäS!@ÛðŠ%DW§îÁ!D{€6©O„žM°üŒB‰/q`ÂÄH$·È(FÁ—1 ‰ï¥—%¬8Gç…7@Ò"!kÓrBiñŠ’Ò"WÓm!yk¼%¹)ò°ÌP[¨mã³ýï> endobj 258 0 obj 1961 endobj 259 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 248 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-ordering.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 260 0 R /BBox [0 0 238 162] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 261 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 238 162] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 262 0 R >> stream xœ[Ë®-9 ×WÔlò~|`ˆ BÝ-tîðûØ^¶“]»º¥ƒîàn»œÄvœÄ^Éù×Nþ÷ïŸÏßý=œ?ÿçÈýJ?cš¯<ãùãÜ5¶óË9¾RÈgn¯#‘é•Ó8syU"£¯3çW †.VÓäÝ^ úk°Z1µWÞ§‘$[_±'gÙgrôÊåR¤7å:3Sb¨EœÂha2™2¾—QÖx Å„–*+¤ùUj&ñÊu.>»Î›¿Î_‚GbÖl“ýº1ãË9¼úˆLŠQä+QÑý ZœZ[:€5ïzRá§Ù/é5rƒ'c"‘^³TiÓÉC_'Iô1e6SdµK|‘7ÆAmj‚!°>“rÛDÈ?soB=Á_Eæ‡Ãp„êŠÈxµ¹3h”X†ÌAo Š”¼ ÜáYø°ïÁã5ãðÀ$(ƒüÉ}Dæ0=œ õTë¹Â©´µ y½ -1çĬQ_‹áÍÅÑÇâ¤"aõåm>]VΗª†¤UTšW ‘m#/¶*޲¾›hh •<Öj%WòRØÝ¤ôxUþbÅ G³ÕLžÄ8ü{}Õ®˜›1u–ÝEñfu5bá;¸Ã|)èx¾RLû M)ƒ¤Ò†3b¢²ˆ3l‰QCƒÂ“ÈÜô;­j"S¦¯³¦Wmm P´ XD;Z%Ågô}óZ ‘ÖP@ýÖæƒAŽàMV š„1iZˆ*EG…J³g'/1"ôõö/Ý h¯¼yˆÝúá4óëŸo~çtþøÿ<þú·3¼Âù#†ógâÔ(a-qø¦ðþ“™ÐzÉtœ°äöS>ÞO›ªÍ Ëÿò MÚÔFÔÖúãÇ9ïý­ˆ%°Œ·âˆäµ:ÚÆ!Þ¨\ü;>r=øGhß´‹•/ͬ`5d¿eÅbÊþ«êGùUš}- ý•õã/‡÷ûé”(%Ä:mªœm,Π§ -éo÷4]“ÖdNÒ„Î!§™ ÙR")ƒ4™|Ò !Kå 5‰‡ÀAO‘{¼QŸ#'!´ñ£ÐéÄ'–eBétžÊÈèåUºh[6ò"s›À2—öëÞœ>Ì#¼n¸‘½yÉ8´­K³€†º´}Ó¸2O à$$ú} ¢QÃÜœTuLg9µÃÎ$Žâ£œöDîOÆÃ"²ñ@ÁL  ‹Ìõ¥Ó¡²y7“žÍüÜwcÀ™À2l8»bq²ÌÉâ 1–V‚µ!Ô eN#nAC–ÌÑ81Ð^'¹˜ua´©{,VUµ ŸYd›û*‡©qV¬ÈnRtòB™§%I‹Å¨ILkPt"6Xb3rÝÍ]ÍM¢h6Þ$âÅ€G¯óîã/™›öª’ôwQõǹ·k"µ8”ª ÅÙœÁòû'¿%nqbÃXïÃ^ª<„ILrÄp¿©V×8¾Ò™#ê2‡b2Æè1ÀGïÁŒ¾D"èæ#‡sDáÚ&¢ž—G‰±Ö°aÞ1Žn"_[GÆYñ r!Ô Sm"§z;÷)Ê"¸@_0ˆ“»]Ä6G>$ï^oxòÉÛÓ75Ö½mœ!YÐׯ±±tkôE‡ÔXÛ¢Œ+Ì%Ñ9AÝNómqLICÄÀ&µH°aDç}YÇ*õå>F•ŒjS£¸$9"Úb£8g‹¤ŒÝÎ9‡³¶9-¾Ü9CŽ*p°Ò`Iµ±’ìÔµÓi€MÅ$šÏ¯÷c10×&²4é·x[›ÀcgÉÚdZ÷t™Ž.õl™Q§Ï΀4 ß+Žh:àúÍêiã0m3,{—ÒÇn‹‰,Í߃Qv¯ýNV…”GÂ:wÍÔäW+ŠÙã_É¿¦]N´ð6‰•,A75À.;¸ËâLÙꩯ‹ƒ“ݺ1È=eíq²tJÜšGïüR ËãðfYƒu¬4‹ 0.Q<Á2ˤœ¥(Yv@iq¼ 0A4²˜*É2H0Hv å0M° ³è®Ṗke*h$€%]¡½!à˜ÅØTù˜p?·Ý´›ZgŠ­9g c]¼{=ªò°ÁÖØ‚½+°E,¸ µ.Ã2ÌÐT£ŒT 2㜃›šê‹ÈpFn{3ò×ÌoŒt†ÆRt†ežQ…X¨ŸÙ8 M Vˆù0LææÃØ'‡tÅdº–è‹3¥aZ`‹üZÓøÚ8˜ÅHÍ)ExçŒhÀS¡çl¥ªX°™ÍíÉñ€3«£ONU¼æðÑÕlÖ.*-+¬Vÿ®kLÌF9›WôL¸yI­6€ËqÊ ¬J %zÎÔú²)È k èÆ% °¦y#Þ,x³»è´aPJ’Q´(~£ëƆõ…åz™€*=}·êÑЇ(jI!€©€„sÖlGpæðÒ&Z`¦¥""FÒ‚°HlÇ—r˜–3%ŸlAa—ið´³¶ šk˜wÎZ`ÞÑZOÎ éÈàz*ótYìPÝêLÕ…¾‰¤—µ¨çÝgâê?~ëxmÍŽWd¬u7c›µ‘ÊWåþ‘=¦Ç§hÊjó]8% ò+Úpb†Â:"#œ¢°Îâ ‡uÂw׃~ôò :±Àˆ©ÍlHñìÇ<-uY|‹²/ñ–Ž J;2DGú|Ft¢TÌ´êÓTDœŠe@e¾¤Dó2™Ó?Y» VÈÏÅmí¬›Ô‰äaýÙ¥8¢KnI-x‘3©pï4‡Ñs¯P†à¼iÀOdÇ œÄ6E0˜Äa ø^fj«ÏaÈ”¤ÇJ²~²Û. ù39Æ"›æ²Î >MiÞà&©Zø ?ÕMEÊÁ€$T v,§³ iPcqÆE;€A¤°ÑÄõ–ïŠMQsÆ€ºtT“è.¿ƒ‚diFf÷>Ó©I$†xH‰! ²DÐ=¢€Ü£ì* @Œ¡fÆéÚ3Ÿ*ѧŒ{ë}©©C†òØ»0Ú ³ÅÉ‚8n]˜}6Êò€éa¦§wñn \@«ƒë®Í<ãdA'e¥5½ûÀ ŠèØEhDÁ]¬ £—yÆi"±uaKËFéò˜&azzï¦<›÷„;DE‰º£<Æ^›G] ÃQ9F™6”GÎoe\€uøPRŽ@/iSʆ “¢(³|Ø0îŠ8'Y¥ê­’£<Îj›Ð,º3A¥€àÙ"Vp_8PRZ€—w§ä¹;òÉÙýa™ÿ8wÿÿ%œ85Q±h— ‹(HO”¡`J-Î:#Ù‹. R3öѯM“OΊƒ²¦Ù cME󵑉ÿ` ¹`»@—ItÌtaÆuîÓ%K?q`”áEºàä¢(÷-ÁuõM#hœM&›C£§|Þ& ó|›ÃoåiQvLA,ב_(#ZÐDMû8w)€ Öâ  ¨ÔyÍ+²8‚§;z$ M@Nø7Æ%¥ ʉ¹nÍ«w~)•ñfIAë8YFIµ\Ð[–áú¦ ºÙ8 ‚p£ˆ91¬@@Þhñq³ ¤N~p˜¤‚âIÎZ§ëAÞ]‹©‘·Z€ [CAœcÈjS»‚ ®]·Z hÍ9këâ}ØëQ•‡ ¨Tàì]A2@j¥ ÉBSmàEÑãi,$ëyÔIA¶fA@‘‚ÐX‚€ ª E€ 'áS )Tò&òaª»±Ï¨”÷¿?ÎÅé ‚D€ ùeñµ!ˆ€ .23M?ùaÈÄÞª ˆs66@›»Œ òðfŸœì ˆ³CR0ãôï‚D€ ÊÙ¼’y÷° ØÀæ8eAÀ^^rE1_¶ ‚ðsA\baZe ‚lnT„Û€KJ¯–gr¥ÃúÂr½TÀ”n‚¼YõhèS5Mkº Îñ٬͓(YÚD[„ñ=]©Õ“(AªUr h—\‚8k ›×07Ž/0oµÖ“³š µ"ƒkAˆ,šE™nSónAØ Ð7‘fyWªçÝg†7½ûñ{ H°ÃÕ¡þõVîß00 QqæÃ@6ÞXÈÿƒ=tE~E*¿åv*8Átüát3ð£×14îH¿)ÑôÎÍ~T|á¨Óé“L;ÉâÊŽF2äBº{.ÂÙ«ÕL4{›æš22®™#¨!4/p¥ô5 öybÐñD@_Uôª©¬Ñm½=ñßA‹¼ÓvÃ¥¯3ºDùÄ{ÈŽTï˜ü`#)¨ïJ³5TNçæ}±\òT`Wt•ý)†3ì%†2Š ¼q‘‘Q_LÈã5¥¹RŒ²ˆ]Œ7W2{-ªŒhï ´yÐ2ý+yyjçß‹ìÞD"‘.²;=Úë 0ˆÖÇEr7¢%-Ä{–Ö´Q‹ZÙÂÁ[› D¹ÍîIfØÉì¯.Þ¼‰GE60bÙ› odO.”Q¼¶ä°¯')ppõR¼È­ èe=ØXã]O*<†xÒ¤¡ûCŠÒ¬ ÆK_ÎÏz´ÇºG®h¤µ÷6"¼ï‹à6.îyoª|¯¾©Øê"¥y²sñQp"žz4ÝuèSÛddtØ\2î 9tQØ,†Ö5ƨV—HYC– dÁUã¡ô…»¤Ø–@\M£u{ˆxô -Ž÷±úTò’{.gü;®t‰Ä»¦jÑoöâX)ƒûÜ5ñÇu.‘¨Rt¼èe îrÀ…kOZÅ(™µˆ¹9%Œî(Ù+odŒ2ЏÄíöXÞüZ½zÁ® èÖüm¼ëI…§Ê7šìI.··ÔÆê\Þö¶Õ\¶8Ï&’¢EKÆÍíj“åâv£qoK£XÅ’qm«ŠÈó)X6.mi¬\‘;[¸ƒbåfß“ p©ùãtFE¥Rp]ká\p[»Â½à®öpÜ–òJ—*wŒ> endobj 261 0 obj 4117 endobj 262 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 252 0 obj << /D [250 0 R /XYZ 72 769.89 null] >> endobj 74 0 obj << /D [250 0 R /XYZ 72 769.89 null] >> endobj 78 0 obj << /D [250 0 R /XYZ 72 577.522 null] >> endobj 82 0 obj << /D [250 0 R /XYZ 72 331.119 null] >> endobj 249 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R /F25 135 0 R >> /XObject << /Im9 233 0 R /Im10 247 0 R /Im11 248 0 R >> /ProcSet [ /PDF /Text ] >> endobj 268 0 obj << /Length 1532 /Filter /FlateDecode >> stream xÚ¥]ã4ð}E$^Réêó·“G: }AÀC¶u·áòÑ‹Ó=ñã{œ6î×®„VÚŒÇ3ãñ|»4{ÊhöýßoVoßq–1FJ¥x¶ÚfŒP{4c™á™Q†”Be«6û=ßÔkÛT‹¥Ð4w»þÐlVeÞïǺ­Kÿcq·?Œ¸5î"Æõƒ'';,ϫѣý~ÝM ACìºr–,–JÈüë&à{ÜèúÑN Õ¸øsõ#\DݸˆT%áJ¥· ÚÈw˲(ˆ‘&å[Wªðh=;¬%‘E‰t`7Vݦ/À!Dný•ÿÞÛÎÕÏQ}‡ßªix –-€kaÓºˆnÐ<£#Qy:WžfKaˆÎVÐ@N_,¥4ÿ°`EÞާu~¨Ÿvý4óˆó¢¾[=Ì&’ªlÝ>|:âýÿkˆ·ï[Ƴoû‡_àoÚ[‚”åLࣤ̕,¦#ÑJd*ìF“®¼‚;ëÀ0œ›üÊd3‚Ú°ÒIH9$:·mÿl‘Âõmä´mm7:Äo=]ßâV…¸ÉÌ|’©üÝB@P‘;¸±j÷EHÐ=TÕ“+¸œ£@âfè÷’yã½âQ ×⫾˜´89D–†(&Pl¸AÓL™ÃË\àG/]½±\ø~ƒàÑ4‘£ Ðc-©~1\ᜩhˆ8¯Ã燽7•·¡¤ùo‹Äp³È»ª{Š™””YBµÁûáI’AÒíªçº? qù¿iæAž÷Ûª§îì€O„ûÕ€ EhiR¾ºs£­6¨ÅËG—”0©RÞÿ÷OÔן³“½#¥Šn¹0Å}=DYhX*ð£µû— "“Ä(öL uIŠTÀ&ÄÙ‹g—œˆ÷„Õ‡–)caˆÃ‡Ò¼€§uA4çÈÒÚªóñK¶Žùø¢2¾Cm¸—ÙœR¢©Nå3;Ø1drª€ã÷S{¦®à†0X%²-TµŸõsÕxQõ5WIy ˆêò<$!;&á#)I˜Ñó&' ëO]V}[ùÓ®8z&’i@:•{ÇÕsÖâÝÈ”ªïý9e¤€:›pÝ ê9‡¼"åû÷ Þ³Žvø¼«×¾SJœINFÀ¼*y¦É]ÿupÑdUÄÔ[”ó%ÔB/;NR‚˜«µP”ÄÄRïöv]ûÖUý~ª1Η,á~E’C"B§‡úè)xþscñòPgãPL£E”×op É`ì -Çùàtu{`kÓ‡„â"`C»òÒzü>F¡ë¾óÕ*Ÿö;À$¸’2ÆðdVH òâ_Âqº–ß.ÌKƧcBCaaù”ÉÀá«o¤rY)Ø$ƒ\8ÇÓÉXs{ÕÅx¬'CÁ €Ø9Ãv³•Ï ¶¶CØžQL“·¢™úà[(V#ÒO‡¡‹Ñk¸owHvÅœá1h*÷ÑFlA/¡CÏJÜqÕ ä#úhÂS•÷‹h0-ŸØÂ½á,ˆ‚ÁÅI: 4¢GùTaxñjN“àÍñUMéã)·táD‘DÁù¨îCšðªð»*ËÙÌ.âÌþ®¦±ÿ8±¨&ÔK;3‚hQ¾~bW'ö™˜ëÏE6+T ^Z¬ŒþF¼ÂÔþãàØT.¶•ÛAxƒ«Ýd.œÁ¸ËµNO˜ÊÌõ‚väåÊý9¯·è grxÏiè _S½â@­‰›](ëŸ+ï<{œø%ôó¡¶qùL’·07ã;ðÊ@÷¥yƒ ”×ËÏ$ o²8Ôuz“Ã0qÏQL¯OߥfN·ï]=båÊúD€ÀüŤxþkè:ÒÇb»u¤¯îMXÂh(äeªó± 7=äù£I½f²’àá£`.óÔªgWqU{ñ¶g‚AùTÙî”èA°wÑE¶¾‹„|ž©íúa|áÕÇ}¥ åøûM¦¡-‹ˆ‚É„jÂm¦Kä endstream endobj 267 0 obj << /Type /Page /Contents 268 0 R /Resources 266 0 R /MediaBox [0 0 595.276 841.89] /Parent 253 0 R >> endobj 263 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-lowhigh.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 270 0 R /BBox [0 0 367 162] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 271 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 367 162] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 272 0 R >> stream xœ[KŽ,;ç*r…ÿ¯ ‰0D P¢Çê¶Oüít彨P:ãdØŽNØéúçNúû×ßÏßü5œÿ÷‘û+”~Æ4^yÄóû\€Ûùå@ޝò™Û+äˆbzåg.¯Šâaòuæü XÐÒ,š¼ÚK„þR‘GLíÕÀë4uë+öäŠ}t¡W²(—µQ+×y,ÈH‰|Àq0Р1ey_ ÌöDdZªd*äW©à•똢Äì:· ~¿ØµDÐhƒâ: ðå@¯‘Dv cÅ&z\Eæ ¤Ö¦‚6`Åïí]O&üòÖû%½ 7‰dL¨RÂk”Êe:FèëDƒ{3E2»Ä@^€ËÔ$Žˆ÷ÃÛ¢‚ñkTèIâU¸hB¨nªÀ«ÀVbîƒÞšRò¢°;C½ðæßCà5"øÀÄ(€qŽ>s>œ ÖTë9‡;©´9 F½+„–HŒcH¯á¾&àÍ8Š£ÇDRáaõåeÞÎ3çË[UG´*ªL3Ŷˆy¡Ì÷ììB9[1”4Ö0© ¯JÏ)V™@¡Qk6»B—‡¿¯¯ÚUæâLe Q|…QÄ»e¡vP…!ùTÐö|¦˜9öZ,ÅáI3J¤Ÿºö>H*.1˘¨¤â€õ"5px¢˜›¾ÇYbÊ ƒ„äë¬éU[› 8Z@<­¢á#úºyMÀÇH ³1@ýVæ À@Т†3†ZM ì”JÑVŤѳ‹;ú|ë—.P¸Vn¢°¾ÍâúÇßZ\ãùŸ#¿CüÇŸÿr†W8ÿvÄpþþLÔc€…’Ì%¾)Üi ÓΗŒtBšË#¿>¼ž6Ô@Ïÿô%mh µ´>|Ÿc¯oŽÀñWéx)‘4W¡-êÐBåêŸÄÈí îâOüRã¿ÏØ‚ÄO·Š¦C±&51V0}ÂØ§XóŠ©W³Ì§nñbMþÀŠW,^Öa$hx'R<¼¬þ‰Ú<:LÌôCˆ²¹æÌZ†È’+"–¸þÿe >@ø°ŸÙúÌ@vDšÇL‹9û“¿ÍRBß Cs~´ ¹‡½ò‡q % G i†Dä-i*&ÉÌdÁ¹i„÷ ëÄ99!9Ò”F9-ò…-Ž»²×B£…ÈKäES´9 C&´·t©—(Üä‹êŸ*IšF¹×2Ǫ"æQׂHØ{\8ŽKÁ†¿¹ %›„$¿‘Wi*5ć]fë¯ÌS%ˆô?×Ev÷Áµ?5©‚(šmÔØr+*_Œ%×®! Fr8µÉðëÜ{vøucıuXSåIæHñáœC2R#ˉWŒʕýpñX#4$Ɔù ,µWe) `}’µÍúf…"Þ¥ZÉ&³Û€*a"F£(}$1w™´¹1ùbÏ(:¦ È6' éíáº8Ì{ÂLiå(>,¾Ï‰ä¦E(g*ϧyÓ1gVd{â“rÈöƪpyŽ=EýïK6¹¬Ÿn‡k¨³Š»+,Ä»³Å=E°-1¸¬qæéófiئÚ6ØXS œ,Î*Tžî9’XcVaÃ̃èSËìp ³Ü«¸»òìÞCÓÖlY÷¾Ï‰`ÕC6|rnïaàmÍ­‡qóœû¢‚Kvk¡èæ"Ȉ¥Î¸Äæ V¢•9u ÷jÌ/Vìçj½Îu•w½,CĺeðŒ›ÆŒ -A½{”$ºCã0!¸!¥RØoF|dtÙK­ƒ‡6:õ¦h?ƒ ‡±De<9ä¬ÚÅa\¥š.4®x3•–Á¢í.ÃiH3Š,Îà8£µrsîÙáOÎ$g*–üÐÓ-iYÆe –=•æêAÓ§Xâ “j–ù0ƒK~` r$MäX’Æ™ É’8HŸ††Z5¡'MºdYÅš¾Â}5‚*óáYöÅuþ ùBÚëÍs¯À|Ó‡N!Ò j€´d^´Stà IÌØ· €jep¾ÜmoªoÖV9<qK>5îFKž°ùñ”&à8GÞÀziB~Ÿ ÕU h^œ¡£Qùž’·Cå‹é<Ó°5…ÂÙ‘±ûl5 ë<Óâh³$‰R¿Š’€Ð^ÝßãÌ-^†(£¡5V’?(W ¥ƒdæ—þ’—’âi["^bL§¨›Bå4­ƒæÒ*Jì®s æ—æhH—Uò{-ÓXÅŒ ‰S z:%ážBJ \ë÷Òkk×CûÏ UÌ0 X&É­ƒ*¬ EN—ü}à ËK‹8€6´¸u°T?ûŸÒ˜>ß Z÷£i4xf÷+àÝúójíþ$t`Ý«MÍîGS(¬þžòùêÝo¢wÿ=’_š` îÚÿ³ö¿Öƒ(ÒcÝkÁõîÇ Ñ-Õ{á[kדO NÄ,³Z|Ÿ`­œÞdIƼ?o{–þÎEWƒPˆšÚtÞd h™¾v";ÓžBc"={#eÞf+r’œ_׺ƒ¿7Œ8 °Qs鉻½· tMgD<|˜þÊ)9¾ÄIÐdfð® k”¼VQâD øá ò‡FטqBÑ&†Æ)hC%½É,Ÿ|€Ï/}0HƒËXÜ€½Ws±>N`Tü©‹Ÿå/Mó„Ÿ'-’(”&:„p¦@‹#š+¸úGvhöôý¿ä$}ªžm1ìHnÁÊ<’û8}²#Bl‰N?ä OŸ£ÍôÎAyTɱ!Ì’ÍŽ {_1;6ô2Ù8íášöé9yQšûÃ1Nðñ)…ùú–ŸJ³·ENwÀ­BvÉ+ÑÐ}o®´âcû @ý/Fä«+}Áÿ0ø+Ét®€@á“êª+?!V„W~9å@™Ò¯)7=ç8*Ù–5x“TݤʳŒJfúî„ùª¬EÞz±ÅŠ,äÀN ú8K2Ÿ¾©Ó‡†çò™‡•TÙ€çnKš#CNF‘µŠ¾ Ò2ä Êdr|DùÖá*‘¹ÕkPÑ—5*óŸÞ[Ó{3Â5ÌH«¢êß!÷‹œ*.¾¢ÅQæøg­~iØ6Ÿƒéwj¤W⯵VƒÉÓ9CÀ5¤_ô Š·1l‘v+Lì·’3ÀŸ;÷Þ¹)VÔ/4¿q¢e94Q„¦^ÂIRÙ!jœ(7\+ ¢äP §1^,:A€›f®!¯Q1>¥ïó2 õ®5VÝy±bZ42šå–BwWiÑxwÿ£/hÁ?¡¥ª«,?ÝVÆ%ر몫½Oú„ñJ"¬˜®Ô³ÌÇ+uð•öö0 0æÍXBú†˜cÁ`2G€Oí‘Ã`µG·vñ;ÚC–WIv„ú.òçwR?ì±L²õŠŸVý$§·!ÙÝ‘Æß’¿¤Ë‰ï˜Ÿ"o4pä¡¥À%L¡g™¼”²vYfm¿æ®Ë>}ï˜ ý] ~níìÈA†kj‹­šáôá›d>ìF™?{£•|j¯²Ø= ðw&U‰®n²DçZ·DãuLèׇ@?±H“Ï!OÀ(¸É%$D˜‚GÕï1Y)xè}.V±"LÁ(Kßd¡`—‹S°Cà‹P‘ïH1*v$óZÊ‹+§è³ÑX’œ*ßqšM?v%'{HdÉ®|½[V®e„C‡¬ô2”‚ÒZ‘VT¾Ä4ù^4U8SXª`Y¹neý³ û4f­¨|M;\cZ®UÜ]yv¢\¢5½f$CÀ gNÊH·ók&‰:‹‘ò˜ói¥.òÅŒµjDX™Øt±:“’5Å¢#ââ}~P#¹õÛ°À¬¬O„ÍÌ2ˆ­§'Y?p’¬îF>e™¾:÷ 6xEgé3x-µ÷€Ó£±HÇ ì8Wx_7„ÈJ‰™.Œ‘ý‘›(™„žÄ ¤/•.¶/aCþZzð êÌɵ“/æâé¸|¯¤Z[“ÙLcŒdñ"i¦5ä ›Ê—Ò¢ÿ¢ „ɳ iúέt͵¬•®Ù{[À¶3ÈBÊh×Ñ(ÓewîëÑá§Ùr%È—Ö‰‡MD8,ÑúžëƸw’ó é ݧãCHæOÊa”q^99Ì!g-Êi? N³¢433ƒŒË¨us€¸Œä®á#¢"ûyq.c—@»@Tº«„›l\6‘Å’{p¥Sö€”òUˆfáÏòÀ–†f9Ÿ‘?mM føqÞey)¶”퀟 cÍ6Òü”ümZõ¸u/óàMiz}¹ëç‘ÎL©T!Ì»é›<È8NgrÕË+"×¹P”ÓJIHæk*´Û¤$k¶[õÊ3YƪÉr=¹ñ5”)w½ôüZî lI®%w½t¼”‹ÏÞË‘,.Êý›Åº¡7:ÙÖ™ÍX÷f¯GS°å‚0E—ÏÛR²öc)¹M:|º½j™j;ÐŽT¬ê¦Yb‘èâpnk±Òøô€ÜƒÎÝîA“_„VƒH©Ë¿ Cxì¹ MÑ]hWysŒûæÍÙ§€èWd¿G߇&™¿’ÛȯUnDûÜ8âoÈ®Rä‘£Y’å‚ïÐKÑŽ,­InA/aO~SZ®AÏŠÞ‘ª7£o]Ý&ë¢Ê<Ãjõ÷:ÑŨGUÓcPù~·Úäšñ œtñ‡¹“\9«¦FmBòi²R.I»F‘ë $·qóL®I¯a”{Ò\FŽáä—\+_ñÕycÍúÄr»LAùùÁæÕ£££¨%=®zõבٛˆðé"g|$óæ"—ظÞ;*€Æ¶([CEH–[ÓƒnM§ô‚ó°‚8´ ¢1›¹#s‚yEs>9zyšçgÞ’XŒÔ6¹>=Ôzq(ôE%½¬D=÷˜q¨ßâø½¶fôÚýð†¸ËÁ”Ÿ’¿M«¯^æ^¡ïôº J¯Ž(?BÛèÊN¯ïôª½,ÅÓJ¯,½Z1›ÚVñœÚPïô u£Wh;½.ˆÒ+Ô;½BÝèÕÛuz…|§WÈwzuyÒëZî ¨;½.•^Qn„¼Ñ«[ç«Ô;½z3VE}§×7SÖ‘vza§×‘vzñ^GØéÆN¯Ð7z…ñF¯ÐwzØéu„^GÜéusŒûæÍÙ§€ÀN¯Ž(½¸Óëhoô:Ú^G½Óë¨;½²F4ïô:òN¯£îôêȤ×Qïô:Ú^GÛéuÀF¯¥×-J<ÜFßèÕ¦×Ñïô:ÚF¯£nô:ê^Ï”^—0*½ŽºÑë¨wzµf}b¹]¦Ðïôz÷êÑÑ÷Q”CÞhÁïMBVz%ùF¯Üé5‡t£W’zÍ!îôêÐÒlØèÕŸ*³"ŸO2zåÆ'½’¸Ò+ɽ²C ½’<éuÿ@ò-ŽŸÐ+Ó&ÓkŽãüüwEVŠ~ZÏ}?ÏÅ~ä#Oòó§L¿Ë¸=Ë/o³ÿе—çCT~9þpüׯm endstream endobj 270 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 271 0 obj 4224 endobj 272 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 264 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-firstlast.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 273 0 R /BBox [0 0 365 162] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 274 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 365 162] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 275 0 R >> stream xœ\ËÎä{Ÿ7'þ:ÿzPh Ðl~]…ür ‡W"wŠ|Å&º_Ef'¤Ö–‚6`Å¯í½ŸLøóÇè—ô¹‰'c"•^³T.ÓÉC¿NÒècòh¦³K|‘7à 25IG¤÷™ÜÛ¦Bþ™{RèIüUx|†#T7„Tƫ͠Vb<½51¤äMáÞŒÂGÿ\0^3LräçHî#1‡éá\¨¦ZÏî¤ÒÖ(äõ6X!´1Î)£F!ü^€;4SGŽ…¤ÂaõËË|gÎ/oU;zUQeÌÛ&¾Ñ«8ÊúÝœ@Ã@C¨â±f+¹Saw“ÊãUñœb• Z³ÙštypøïõU»*P`n©³ì.Н0‹ô®FYGa* ɧ‚¶ç3Å̱ŸÅR OÌ(‘þ°kŸARiAˆYb¢BÅEj(Px’˜›þN³šÄ”‡ ä÷YÓ«¶¶(Z†ôˆV´J†Ïèëæ{#5¬Ä<ú­Ì@ŽÀ¢F3­&& I¥h«bÒìÙÅ7w"ôõ;­_º@ÑZyóÜúá4óë¿ü£ù5žÿ{¤óŸÿ¯ãßþý ¯pþçÃù§3aÄJ2—¾)\Èx ù’)@s{䟯§MµfPÏÿõ KÚÔFÔÒúðsÎ{}+bÅ_ ÐñRˆHÌÕÑ6„t°P¹ú7>r;ðÀCüM¿ÔøŸ3¶ ñÓ¥¢Õ¡X“šë0}`ܧXóŽi¯V™o»Å‹5,ü5ðW,ê^Öa$¨{Rܽ¬þÚµÌ×0˽ŠkWž»÷0ÂØšmëÞϹªzʆ¯sûÞÖ\F˜6Ϲo*´dw±vÝ\‰X Æ{ClžP%ºQYSÇPi¯ÆùÅŠ= ÃsZ¯k]åÝC/[h ±n žyÑX^ÁÔÛy÷’xwªVðBR”¢†x3â‘Ñe/µ6:õ¢°Ÿ¡†ÃÜ”K«(¾{Ÿ7gþRA†tY%ö2U ÿ L "§ŒètJÜBŠ£\ë÷Ò{kï‡öŸ Î*V,@#@Â$lÑ8áTa€™.ùï–—q€ZÜXª_ãÓׯ’?møÉ4Ï~|øI¿¯ÖáO’lxµ©5üd Ü꿃ÏW~}ø¯žü¥cJ¸ëø¯B:þ Ø’ˆ%ƆלëÃOROüg©Þ _Z{?ðDp"±Ìj#òs@µ2½ÉBÆ|<'o{¶ñÌEWƒÐ•ÚtÞdhÌF_;);cO¡À±žÄH™O ÙŠœ„óëZwðû†W  6jÅ‘ž¸Ûïæ„®tFÄÃÃô¯LyÐñÍO %3“weT£úà}´Šâ'ðÃä ¢k.?‘hCý”Æé%Ofyå3øüÒƒAÜberö»šKõ1Qñ»øiÊþ˜´Q(Mt€0ScqD¹‚«e‡²§ŸÿûHNèSu¶ÅX°#¹ +ëHîkúdG„ÔN?ä OŸÃfú7ç Url8VÉfdž½ï˜z™¯l\öð Mûöœ ½(ÍûÃ>Lðé)ñ›4~ŠQå§Òì×"§;(ÂV!wÉ+pÑ”‰Kz¥”aÀ†(Uš_{áä¬Þ‘SΘrœ M1å­©"q 9¸¡*03–ùÕ’…CÁÖ5Lò«”''û_«‚„&a1JGVð.÷ñbÔ¼oýD޽m-ö€HvD^lÀ'kÑ·-î5‘ß«éMk,dP:‰Ã‡—˜{ÈH³È»•Š?R—qvƒ.JÑâä¬È¨ID݇°5y QIrnI2¢dÉÍN®ÙÝH¶cÒ}Zhª„ÉLzF#ÈiÆÍ(–‡¦¼ÞZY3Pƒ.¾8Ä…Øk4»Ñ$æ Iêݤb$jg™QáJ–Î]C¨ÎªÁdiã}A¸n©à€Ìg¬ÞF´£K·bi˜ÝRƒÈÇjä©sOñÄ'³@Ï6 Ù†gp[ò"ÈÔ—æ ¼Yƒì‰“˜¿nÒ—_$sjÉS#äphkµ~ءȚÃ^QñSm‡Æ¦Tƒ¶&ÆL¬)Ç—³ëwSO8¹G½¤‹Êœ*ã„óæ4qöÝ‘ŸÎN!“ùýFþœ éì©(Êódë@ Ñüš˜* ¯ÂÆt&3qÒêÒ8i¸-¹³q ‘#|®"ìãy¶èò›Ûm!m‘ê> Ы:•—°‘d±qöJñ ’…·«€˜:cq^5˰$/yx²pˆø&NxQEf ÚUܸÌ6fÕÜ ™Æ•.Y6ï Âïu© ¸žÂôsuD77›ÒRU„•·Kd´ IÅj«Ý0DÞƒy‰òâHXbqÛ›Ô·B+xLÅ‚«r¸ÝÃaû’OaÛå4Û’ÈHI¡É[!Í"ù•æˆ@QI#)TþÈ–ùõm剻dK#Ç‚,A/K>_6¼”#«¢uÏ$÷úˆÞ(¥Px ÀÑŒs¸Î¬ð>wĬ©úÚ'b‰îX¤:Èò‰•£uÛ†Þä×aа{ÞtŽúËÉHßFñ«Ï ¢½ãOÉÞ°óÓ…Þn!íC‚”ìÃù†ijl;¦t{•ùšn§Ë¿±‡©|FÿC3ª/‰é`ÃÆ¢ÿa|k¼ÑS{”i¶s =ïö0å'&ì±èo‘¿¡‚úae혼â'ên¯¬²Ñ¼Ï òÁ$!œ&ÀQ­f(|e€0w+ÂDh5¿ $™‰žËÅÓ¸Axg½¸úURu“²o2>‹´Š1{óÖ“ñ;Xȃ¼4ð]%dáwÒéCÝ iùæ™' T僤ìŒÚ‘jçŽte4º¬‡¡ûâšS_¦[*Ë/ !MeJ© >Ì!ÒÇìŒäÂËDZC?.D!º&"/b Ë>A‡Be®¤È‹W)òM–ˆ¾‰Ò·÷éYITš ¥×&êÚlê. £Â]a²H57¹ ä{t[ˆ¾£‡:¸ìQ>ÌYã+ä‹­³ˆIì÷~dýèáX¿î¾ 6Ϭ­ ~ôb{²ÒmݤÙ<˶Len* ýp•¤ægß®ˆì0@Þ[¾o ÕÇV©¾K̲ëv¢ÑQå¨~Ê”Çepóúæá£¿O9GÇb®QUCªRÕ ìΙþ»RUpš¦ö U•‰0U¨*ÐÕ냷 øæG÷ “ÈS9MVj˯,»3ÙRD.©9K:lJ½qÂüPžº ÍÔ¶JmæJ³Ç>¹ñÔ7•î– O5¹)O5/Ë”§Ù$a¬’´ÂLLãA:'î+¼b0m¯¼D%ª` ¨.Dv*´Ê÷¼E¥wÅ"v”]ƒö>Qçec‘‡$ OÝä ßc¹>¯oµIÔÛˆ%§.6IÉ„/ÚÂR¯‘'ÜåO[õ«£l,uÆRëK¾´ÊÊR‹|Üb9@ {"#+K-òÂ,Õä²XªA}ã|bÉ'2œ¥Z©±XªAÓ9)µÚÇ#2”¥fÍšÝXjrkŒ¥¦û2Ÿ~?!e±Tƒ²²Ô¬|ÁÒ¬]C]ô{–d,YSa©—!“‘¾âW,•‡®Ký#n†qÓÐŒ‡Ê8pê\ØXÜôk.h\™Z}Æ‹§ÂæŸÐòSò_Ӯǭ{™‡Þ”¢÷bºÞœÙ¹:³Ér§¢ARä’*‰rõD;l–øìHÄûJ-n¼Ê‹Tyotx1lZ)’¼b•Qq’ åI/œÈ\<`N†‹&üÕùŽÈ=.¥]ÌWÈüýc®ÌW‡Éá® ‹n/ñ}ã’»Þ¦ùp-µ$÷]ºÞfÙ Êš… Þ”A–.ʇ›uS¯ pZsd5cU\›}?šò°(–)7Oà]~‘“J—«5TJ®Ö@‡ïÖ™ò *C.×8r ˜œ’ õEÂu‡Ü.ÅŠ Ðä‚MîvÁ:œ[Õ (UÉrÒý‘ªWno]» ë¢Ê<Ãpb“ßÜEy¹$Èæ•ʯî^âp«Eî¯,Ç)€/J!È¿ò9µ É—o`¥Ü¾q$ßÁAnóÒ3¹³»Q.àpÞ$f¹âƵÚ9%ž6ëËí25zȽ¶[¯;úE-è{à©wJY£I_Å)²…Ì7cŠ|Í•È)Л-©N¡ÒŠ@–ë8×qˆéÍ™i7 Ú‚¨¯f®Èš`^ÑšO ½•Ãó«L>Ùƒ(×r¦Û&÷r¦Z/ }©l%êy÷»úÃ_¥×V,½v?PêMSe–@ù)ù¯i×ãuÃË<¤W|UvM¯¢éÕÍ£ÜÒëH÷ô:â5½Ž°{zeÉÒ«³©m¯©=ò5½Ž|K¯£ÜÓë†hzE¡=½Ž|K¯Þ®§W|±§WþFeK¯.¯ôzs-µtK¯[AM¯Žhn$ùš^Ý:_Ð=½z3VEþL¯¦<¬xM{M¯8»¦W¼2¿¦W¼¾¥W*vK¯£ßÓ먷ôJ*÷ôJ:·ô:Ú=½ŽqO¯8X»¦×[Çxl>:ûävO¯Žhz%ù’^gùH¯8×ÙÓëÌ×ôŠ“µkz5dó(Ÿ']VFCV2õŠ>‘•^g¾¦W²î’^g¹§W¼‚¼¤W÷¦×›—8Üf½¥W8½ò«Ï-½òÉÏž^qBuI¯8ÜÓëÖ3M¯›5½¢Ì%½¢Ö=½Z³>±Ü.S¨×ôzíÕcG?£(‡xK ŽøhÙÓ+äKzpM¯9„Kz…¼§W>n¹¦Wƒ¶ ÷ôjÈš`^Ñ6Ÿæ-½rã+½f>ƒZéò-½r‡¶ô y¥×»Ïøæý‡¿I¯œ69½æhŸG}ó!“•Âÿ9ðû ª9O×’™ˆÉ”õ¿vXÏò_:D¿ZËÚÛó!*>þùø;ZBÿã endstream endobj 273 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 274 0 obj 4742 endobj 275 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 269 0 obj << /D [267 0 R /XYZ 72 769.89 null] >> endobj 86 0 obj << /D [267 0 R /XYZ 72 723.255 null] >> endobj 90 0 obj << /D [267 0 R /XYZ 72 370.489 null] >> endobj 266 0 obj << /Font << /F21 134 0 R /F25 135 0 R /F20 127 0 R /F46 177 0 R >> /XObject << /Im12 263 0 R /Im13 264 0 R >> /ProcSet [ /PDF /Text ] >> endobj 280 0 obj << /Length 1126 /Filter /FlateDecode >> stream xÚ¥WMoã6½ûWè…j"†ß’€î!A›b‹mߺ{m&VW–RK²›ß!‡²%¯âlQg(røfæÍfÑsÄ¢Ÿ,ŒËÅÝ£`ç4×ZD˧(QªSšK-7ÑŸDRA¹ŠÎ#eÕÙ}Y?lj”’üöb÷1¤èš}^þ²øi¹à`,:C*Téh½[ü}švÿç&î>~lÀßð-#ÉÙ Âåc¸Œæ™NäÔh)“QÆþà/¾­m­ClHQʼn!mƒÚ±Ùq’&e¾ãЖ»²*öaUñz‹ÒªïPØu&ºâ‹EKÝ6Õ€,Šª·-ÊÃIa&Ué!uÃç.Ø.Ö릯;êâêÝÌFÕ’j£‹ë¶³ÅÆíÊœÙW”þêÑfF>1®\ÞPkjËzSÊMïBâty‹ÊkÓ£ª`ÚÒg'J‹Kƒ}8§¨‚©}lˆmûªkQ¯ÀyHC;@,† Þ·1adN9—è×sy°5ÍcCñXv[·íîQ™12Ca‚!iÛ~'šk²‰9Ù7/¨üðGáEäwƒ–¦”âœÑèlѰfR% ÏSÊs%2¥fT):Tʯ1‡ˆu_×ÉL™ˆ+òo¯=['#3oÊ´ND$Êä¸NŠZiR`ÎÊçz˜ÀaÄWeΩƞ¼çµíënÕTåµC±/‹UeQ;nËõ Û`n]ÔÁÎÖ©oÃú2L´ýÊ:dÿ¼àÙˆ²©Ûs¥ŒBk€P2EcÉHãXËAÅîðÌÐiˆ,—šÉ…¡Ê%Ö1é™xtòªCê¿ÞÜÏñk„P(E9|X?%Á¡D÷lÝ•P]¯8‰­„¶Øy‰»d]qB¦š ‘MÙ˜ïÅ;ðdžÓLšé>×#¿W¶hhƒv€ækÛKc?‚”‹3SîkEMÎÑþÁîCÛ”Ðh¤õi®CËxrZ³»š2cà3µº17óÕ>†ãŠ:Õ;CG\Ùu\ô½óÔmCo± &R ­»%¯å.Ya²éYŽXï`”iÝiº­X5{{©s!?6×0(m¨qU26vÿñÍ.ø= 7^aˆe¨I5*JŨD~gà°âîu|Ž«êµã)P´¨Cð¯ø$˜¡©J§‡\Ëþ ™PœjžMw†û4€ .‚†ŽO£,ô[¶¥È©t…>A5å÷;ðdª(ã&B¤|uùp‰s_eC;åd[NA¾<ó|ÿ†bšf¡ý“À¼^R.³|ÒöA=•:ȾÌ%Hr÷Œ ·êÿk¡œeT«Áֱć'µ= ®ßרÊ[Ýnœ€ ¦b°ø&_¤¢)OOËœþÄ4ã7Nçì'2‡ Þ Š*e¾áŇSÎÁ•¡ñHb}׳¾@Qëü¿:,Säõ¨á2=ÊÇÃl>rx2ñÉ‹éô#JŒ 23à;\#B \/¥ñ*xý 1ïû# endstream endobj 279 0 obj << /Type /Page /Contents 280 0 R /Resources 278 0 R /MediaBox [0 0 595.276 841.89] /Parent 253 0 R >> endobj 265 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-filter.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 282 0 R /BBox [0 0 363 258] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 283 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 363 258] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 284 0 R >> stream xœ[ËŽ4»mÞ×Sô´u¿<^ØYYØÆÌÂίoÞÅR×ä ~Ìbį%Š¢H‘RIÿ8 ÿþù·×þ'¼þöGîïPú+¥úÎ3¾¾_¨±½¾Ðß)äWnï#ãÓxåò®@JŸ¯œßZ…´š&c{2‘ß«p à‘ÞmO%¡n}Çž ²ÏNäè%Ê¥7ìå|™)á Eœ´0‘L™/£¬þ˜¤!´TQ ©ÿj† åë\$ëì|mJüzýv@ØB³MÔëj„À×Ú»ˆ$ª³ˆ¦W¦I ©µUA;æ×þÎ;þú1û4˜k2&¨RÂ{–Jm:hèë5ú˜4›)¢Ø%¾ÇÈ8 MM<}žïœ›«ú™¾ Tè‰õUh~Ð G¨&Tï6=½Ä2hzk,HÉ®Â>œ…ñݨ`¼gf˜ ú;‚ú€Ìaš9—öµ¾–¹J[P@ëmP…Ð’qNž50ás¦Pp‚ 8Ȭ¾V›€=çkõÊ=@ª(4z Í‘'Ž*޲~×1CÏ0…BË[A•ý].jìË)Vv Ð°7õ®ÐxÈ€Ã~]*€aºÁÔY¼ŠÀ­fáÑÕÈëZØ C2WÐþÔSLùY$mäQLý¿Cû4’ BÌl« ³@ …0O s“ßÁ«Ly°‘ }¾jz×ÖV…ôƒG+Z`üÑÖÍsf#5¬XÔú­ÍÐhQÁ^¦¨R¤WiöläIƒ}ý³' ¬•›†P­JS½þåª×øúב^ÿøßÿúï˜÷ë^z'áýM$™o¸3Ú p½IÜÄñçÃø´ÉÒЪöŸ$ e°Êrk)|¿æÎoYÌûË8èi­ÁyÍ#*«þDG&Âx8.þû[¨ta´kcZŸ°D¥|ÁxT«ÍÓa¬Þ¤A}AeV/ÕA$4Q¯!PGÕKÕŸÈ!ÝÀ12ý †lâƒJ‹I2‡CD«ÿK’@!ööp¢I|ZØx (HGŽe‹9[É~ÍÜ‚M=° •!M±1¿1™+®(‚Ä$M*ÿC s‰‰S³O$LÈ "u P¢)¤:1FÊNŽD'GŸ á¼Ö€0p€ !¬QÖ1ˆê‘kÙ*ZQÆò–Î|1†+}¢$‘âøª’¸k {-NxˆaHa%Ðp®z!=º† ~SCÌ6I`ÀØ5.ÓØjBÌF:Ïh4Ihi^U‚ “öêh¾!R±Æ, õÂëåê…é“ÙµÕHÒ鄸2^‡Ÿ@ü|탻ðgØq@”LÌ©ÒZ¥ˆ˜Â!˜DR#Ñ —¤!¤Œ?  8" "1BÌÃR¢ÂTéÃ÷Y?¤ĦT™\i2ÂŒÊj ‰„ÂüÉÜ'Ѹ»Qú¤‘a>t¬*ƒ÷9£Þ®®“Ô¼«ðFÍÄ!c5 P³!óô„{+Q*ùSŠ´ëXLïOÌ)'ïo”…ÑËöm@펅:—öbþgrX •ÓX\‡B*À,·gnxŠTZb"äHu–å7®cu-m’°Z%P¶¸X(mÃ3dP ÇBÌÌz1×29´†Êi,®C¹ÞÍ çÀ»˜¥C€5l´`Š ;œn†ík.3 ùtî® äç¥U»ŒÀ‹“q.Äü˜ÈNe¹Ž"ÖN&ŒÑ'R,&`ïu­«HÓ®ÂLcˆtËxæ¥†Ó Hau×kw²œñ({,lÑnÄ,£ófÊ,8­^ªÜÐ@ÇazÍU3E€yí<`X¥š,±“’3íw™Ó”nqƒE×Êmp÷~’©pA¡¾höƒ¥kÖ⠳͟J³úA¨X¢Ç$…ZmæP('A?‰a,ö!ÙW"¨p6ç¡Ùפ#`¥ ÍÇg\ÅJMÅmÙè×Ñ4ã¢2Ô|Œ™ÿA$Œ=Y>(Å^ů°Æ –ËÇp¹% ˜ØŒã¹!#j3p¤’nWíãB–u$é7ì®Î&?§û˜îÒðƒÖˆ·Ø€C²Œ[‘&©Ó GÉw \S†'ÀI1?“m‰x…r¨ÅBiõêcAY2 e‘$ÔN’.Z˜´lÈÀ,¬Z´0ÿ!:cq^€ÊŠÄLb€ëf?K°%…Ú'Ó<°Ns¡5*evà’WÉôD¡çkWñ—¤˜Øt^]¿F¾ÒȦhÔ»¬X&\·ô“KŠX/ÊáÒéy'Ç}„‡ÎB"bˆL/¦¸ˆš…àaZó>9“Á€ò4ã ô2ƒ²åÉ„õ‘|FÔÝï™bñaægÖe8óp›4鸿óÃ˲íÒÌd"U[Ü"ÔeB{óØôû%yË÷û0Ff†ÈìMٖه gæ‘hXfÖ‰2¸vzÞ r—@EÈb«M&PŠ46ÙÌéÞšìI;«ef ˜ð®*Ž[QXN :meÖJ‘µöÊñ[ iÓÒ%iö‰€Y¸ 7ºr¢tyFgJC¤3[ÃüÈ!N+Y¨«–H»9ˆªK=)’@MÚ "[v‹A›w¥Es˜÷¯*¾‘ N¯¹l ”"m%PòmT/'P|vºlEûí.ânÔÜLôÆ Ô6¸û?K šæ)¿“6I¢RšÔb¬HÚä±aiÓ/$+’Æ}ÿþá §qÕÒ¾š4«ÙcšÆY›GòÈaå÷‹¾ò‘£”¾)óùéD5"˜cµlz€Ùû“5ÊÚ<’qÉCGEé鎢$O"â±fBùø žKS~¥RIúká•›PQÒŒùŠfå/¡øõ1Ð á ò×þ²ÚÇ‚~sL5òL}‘P6;%],¦ Ý1ý\³i³ØºÍBLþÙù[å ¢Cø`„,LðˆŒÃXÝ!ÜÝ£{æ>ýb‘’~| ÒÅžè³9®†RŸ02¨X.;ÆjóØ1‚öòÓ±õ uÆ‚:ªÃÊrÔP~]žŽ vøGåeãï,â¨q²+F+eùK¼â¯‰?\“£RQš£óÉ7"`“DUÃ(ò 9“ šIÂljŠ|0áN‹þÓ} ñ##<†Fºw"+D!1VcßÕýî›ãS( w7Ú†GÅ•ÓuËÈK9\?os“ØA{úÌ’-yŠd["½A’.;#^¥ ¶ô-D—eu‡È"±3ºgþl‘ÈbúkiÀÒÕ ¶E‚Q:´Oº SÒ"á°²‰_rJ”Bœêy(qìI ®E˜ å-¬'[$¸Í/ʃ¥üô;+bèxZÒE¢ŽVšú+–úÐ_GÐE‚‹ÊP f~Í:QãüŒ4JàeYˆ¼S¨n©N× µu¾ÕÀš6*s&µu«áú*Ê£ }±UžW*åûl4Ññ@[•úˆ‘m ­:LlcµylÙæöyÈîJP[ÍCí’‚)ÙêÂJX¶ZgÇK,…ÇŸŠq¥Ùx‚Új2k”ÒÔ_±TšþZ†Ùjj«¥-[-?|*VÁ‹`9I@ƒŒ7¸²VÈBаvmÞpwV–Yã§k=ÓtÌ3ÖÞº»Ø¨‰ðØFIóË2©îwpdo4¿d£\1² ²Ñ…‰M¬6m"Øœþ Ùïó†ZcEmÔacÙhx¼£\ò@©?½ŽCƒˆºÙ“MH{MÞYaðOXÀÚü[Œº•:´Xäg1ÏøÃɹÚFˆûRÒ¾”†º/¥a|,¥øgY6~D¼PÛR*Ý^ÌÔD¹ßùôHÆçv>Œt·Ï‰ãh~ßãÙèÖ„±âö=Ь]qºܮdz¹gý,¡bVËí°ÔïOÈ—ÈvÉÿ¸:aEýÏacùß/Ù{W{ýAô¤®G]O!ºL,dKôÇ›/è~èÞ«©#4õ ) þ #ÉOC÷5CÎ ÿöÛa<vÈÖ‚Þ»³z<’½,çx"m«y|ÆÈT›ÛZÞó¶”K?ÞE¬ëŸ=¤—ÍAz½ºÃ]vïèåÃ9zÚ|£§«'ÜЛcôôáý×[ßïøB×ý×­~×ÝÿBÖÞÿ±õéQt’õª • axC…Žª¨”ì×äëQçÖæf%ñMˆüü˜Á#üša!•îÖ&H1è=¾HxE7O9YjrÃ;åÁ/IÙ5Ï‹ù)T¤3ãc5 tÇz1r ;áv:+”@Ó q¯~ ptÁxòE`ðÓjDç6‘/¯M7ҀƯn@Qž7 dø¾A¤é"N–gFgyàð¡Zš ÌÇè¬)Ëß9,¤ð] yˆü8ÁIWåö6  5CV7Âbëö¼åÆåKçǨ]z ð9¾vÀ·l‘¥ós˜j¾VðÂÿÈ9°=xX`r¬·š%zòà€ÂoðÙ¿yÀ:ôèAÂJ™_=8¤ò³˜~ö€á»«ò10ž›}°7 ©™/Œˆý‚B ©ôöiº£–_#¿~0ß8¢ë"V%ðm|'„¾ 4]æÇÙ¤ qüâÁ©kØ«~ò`Í>0c~q¬ÞyØ(]š< ïÀ;ú¤!òWFœV"}þÚµDæ†W寊 á? èýº^¥¬ñ­Iï!PJ~a5ßLBï›»‘ñ“¯F~Amð©BtC¹â} õíÖËäÒ "´>5ºŽêv wV4äb}•kþ ±Ù„^G ‚® 4=V@Vb‚$@ayk§ÒôBŸr¡Ž9yÐu˜,Q¡Õm]Ýlˆ9˜µZþdP‘‡Ô9}Óá¸@Òv.²ÑIœÐ§ (tWe¼µE}í:cUïz|^›~rJÝÎë±D¡2  TJökòõhݰ67áuä=¼:D«!GÚÂë{xíó^ûXÍ»·G¦4¼Z3qmcl®=â5¼} ¯ Ü^"áùð:â^­_ ¯ Ù%¼öy ¯F¯ðº©–¦bÄ=¼º†^ ‘Øô5¼št¶ à|xµn„ÅÖíy+ÊÍ:€Ûßkxm¯Pg ¯£„Wh¶…×Q÷ð úº†W¨²‡×‘÷ð:Ê^¡¯-¼‚@[xÝÆs³öF!°«Ù«!^¾„×™>Â+@—ð:ã5¼½…WCœFç^YÁT›}".¼Îx ¯ Ý%¼Î´‡Wâ5¼š$¼nZ"s›y ¯ Pxâ^gÚÂ+Hy ¯\«™„W§F ¯Øæ^‘«¯Ú­9–É¥ò5¼^Gu;Ð;+š{x5ÄfS¾¯Yxs ¯lá?£ùð ´¯°-ÝëA«Û¶‡WCÌÁ¬Õò'ƒ,¼Îq ¯s\ë~èráäÃ+Ð.¼n:cUïz|^)lRxÍ4ÃO-µ>[{÷?w«Õí©cNóZ¦‡\âo.Ün•®ò×ãÏÇ¿w‰«’ endstream endobj 282 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 283 0 obj 4183 endobj 284 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 276 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-let.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 285 0 R /BBox [0 0 358 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 286 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 358 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 287 0 R >> stream xœ•ZIŽ,¹ ÝÇ)âiÍà ðÂî¥á…Fwè¿°½ðõÍÇIŠÈÄ µ¨xÔDQ¤ø$å¿pâï?¿øG8ûï‘û+”~ÖüÊ3ž?Î…klç—ãúJ!Ÿ¹½BŽgm¯œÆ™Ë«:^gί@­¬8y³d^ü_åZ;¼Ú硽)¤Šõ{2L¨Ï4z…¹t„î/à fJP›ªÇ‰ -L ”¹zÅÔVÄZ·T KÍgM¯\çiHìsw{}¿Ô9Æ ÉlôÀ_ŽË«ÄóFnA<éÔšk×Úô6Ðõaè_ß–·¤×ÈlãÕ(á5KE‹Nù:©¼‰KÊZš‘7^5eR°è|ó|åÜV²ÇÜêSqOlž"ëÐ_#Tÿ‹¬;^mn –k÷ÖD’·â›þ0÷sFæ<^3ó8š³bò'2¡¦ùhi¯QëéL8•æ.]ÈÀm 8´çäÅ!Ǽ»±29g\øP Ÿù²OLž8Øl8™é µPâƒz‰ä¯Vª“¤õ›ñ¼›®Rú«ì6˜^Ÿ)Šû‡†Q4RB“)Î…‚µ $‡[ê×Y6{ÔW˜E¦S#oðt’ûºdŽoZh¡¨'ÑqSýÃ\Þ=€ŠZ̼â5 Û i(ŒlËMJ'»nʃ=ðb#µæÅéÏ©³ÍÍLw¹Ë±;-Žu-+6w¶O\x+úâÑGß$ó*E†Mfφ.V:KZ” ÕŠêVžêÕß7ɘ"o6dN,:õ˜ï*@?¹&Ê‘qVh¼!ê¶=IŽŒq2[‚û¬àS‹w‡Ž‰2Ö°^ 'ã–øÔñå83Œ‰Ü¥ut((y•}KˆcLDØËó+f†P5&Êܱp4rÞÔ3 ’ÙØñ@–ÐAí@•˜"†‹ÃÐص±bÚî ¤üàÆ‚u.×ÐñˆŽ"_ÒÁ”Ù’B€yðÖ’(0Œ>}ëh&€y[–­iŒƒž¨L€sÐt{çwˆuø0”Êòø¡®ò"§ÁçšÃÔGounóÙ\`_LñŸr&oûqnÈ‚yÏBÄcÐV8TAudŲÂbÍ+ÐñupâDjp³ "³áÚ®ìÒ¿B±A‹}/ŸSªo ,³¹>Mðƒ‹gZŠ]x³<xp‘ öS„ ` RN0õ.ÁÈ3f:mÐBy:½%vZ6þ2€°aÃ6©<¼{^Û:r“'&·>|`ÄP'S,B†¹yHÕ7Ädð’ ”¶——29KRÔ=ÌÃF}Zì“Q+Ç,R]bÇZ7ŒZdÇš›ÐL÷‡â‹%8™n‚0ôb ”îZ±â°-« ¤Í@%Ù6PŽ6\I êW8fq¯P$¹Óªé³þnÍmâ1 Ñš®Zæë…«‡¹^¶J”ÞÜ¡Œè‚ª Js‚| äý ¾Öø"píªÏoÓþã„>øA‘«¨•@T°2ˆ 4…„Ù-EäÁ›ñ–BHƒZ…Îÿ-‡äÆGã•C–­Ø:»­å‚ÊVÄŠƒwŠ•E²$R/Ÿ¼óxQ¼²ˆ <‹ ƒY<‹Ð¼*–E‡…Ec^Í"äHL–4‹ôTžE0á¾ùmg=7·¥ñWé4®%9D•_9ľ×Ü”“Èš±&‘Õ‹&ðÕ¢&Ra”â9‚ îÁ¶$‚5™}Uèl K" 7¨À’ˆ6·$¡ý¯$’Ey/ŸÂm9‰øúnIä9ÁO~ÞùЀ>øºÅ™w-@ÐxóZ\úÌq.¯.…ï)¯€«Äên]ˆ7%vR¹TsA·Í¬$é±û~§’mé¤Í»`êUÚeã-‚ðÌÞR*+µ|©ÐNW±LË„ÈPx¨MØ’¸9 }7“ l˯}Ù 9ó¨[:|°rÚ€å4ζÙIgâfƒ*+båM®ï‡ì_¸d›Mã€*Y&îÒyÉÙñÐhY`΀õ™}s‘Ìï XA6ºÂ¨¯3{òNCðÁ*ê#ÉÖHh\8;A‰¨W'¬¢™Øƒ—Ô±¯ :€5¿w}Rá[‡uîzw½*Å_QâCî5‘¶¸¶”¡EôÁ7›Ê„—Pí¾uÄV²>?œè‡\ÃcsÚ ë%Gìý¤ê—W=\òûêOîH¶þ_~k {&ùÐß·¬;ì2[îD¾øƒï6íŸl&|T+ª[ŒîÕß —ÂäwîM Áí‰Î†ÝZ vSh:Y îªQ©PVÓ²‚@ÚZØ.f}z@Óž.ϬV®üDeá3ÏÇ&‘€ærõ‡hTB„€õñ,¢¡^[¯Pù8¤íÐ"úaD1yâká´5’ˆv„$ ³¦¬*š]-¢Yé•}k~ïú¤ÂûÖžb‘‡J;¤˜øí•ÚÈÛ+jàñÕm)굋Ÿ˜Ñ¦Ê¯Ì>EÉ « Ùgæ½È/°4мÀ²ްñÚƒ]¿˜ ÉŽôŠ”íþœ ¯Âs~L?C:gpPG@¼Åš;ÇÁ±ËÝIÀ¯±^¡ó#“RG@¼7:utÁ2FåØuT6 ²?ÁZ›wÁÔGYU'z@«¸x`[ðâYñì–뜕;ܹ鯷n&Å`Žøæ‡Qa†-—E¡h/ïòB;ùÁi›Œ<Ñn6æÈ ä΄™#w’‡‚Œ·"EÕñbÑTx£¢ŸMí““Ty´+ø*’ÉC/©_|e»ƒä[¿¤J©ð‹­W(ò¤Ä—T‰ï㺥rÁ º”|U@+`´Í›`]Tñ¨Éî©€ŠðmSiêU™ª\…]gŸS‰vOõ°›õi´o½ß&}?MEPñÁÙLRÑ7ÔT«}t-¢a(“ Y²}ø;ª÷ù!1Òù ÇM{»Ø°¼&A‹¿¥&üJ£û³ îÖƒ$Zß*9¥ã=Õ ¿)¹@Þˆ°-”jW/òjäã&ЗÀ’ý)çp ì-‡•”çRéö‹GÖ»xEÑAç;¬A®öãtASTyçj”Ù:Ct¯ðb¢ãX¶¦Öíe ÖèMâ°é] <®5¦Up¥ùMã“øîøÙÛ¡2YSìüÐpfWBpëspÂù±Ïí¹8áLÖVyxÉÞ%Fž²oÈ#®%°U&…‡m¶î"Pý¾¼Í›·dY’#ItG!U¡C‘³9:ÄãµÂ‹çóyyärÄzذärÁRàfAµ‡M¿µà•‰ƒP~UñÅB€åW_üQ­¨nuxp«þ!Îûxà%Ple±½ßp¯OÜ˯çþt,¯ðL€µ…`ís¥ëÞn˜àN€I£^%À½Ý0ÁÛxN€{¹à^nØ à»Ùä½=ðj¤ØÊ` îØíêi½·¶¬y{#ÀO>DúÈ<âƒü À#= 0µ¹à˜ìs#ÀTáA€©Æ÷ù À#>0)r'À÷Éð*<ç÷ÉóA€M xÌýA€ñÛ›v#À£=° –1Ê“«dñ]mó.p¬£:&­v<úƒy#À:g#À o,qŒ;V̘¾w<úã×K;íF€×d”/›)Fƒ£ÃËx+RT/;ô³©}püääF€Mà«H‚Ü 0ÁžùF€gÞ ðLl‚tøñЫ`Œ¶yl£.Lh'À3?0&±`‚¾[ˆÍú4Ú·rÞÔKŸÃ÷}¨¨5²üÞzûU}NZ?w—ðÉ©ìŸü^ÃòëHn²}¢ø×ã/Çÿbê]ô endstream endobj 285 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 286 0 obj 3607 endobj 287 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 281 0 obj << /D [279 0 R /XYZ 72 769.89 null] >> endobj 94 0 obj << /D [279 0 R /XYZ 72 769.89 null] >> endobj 98 0 obj << /D [279 0 R /XYZ 72 418.879 null] >> endobj 278 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R /F25 135 0 R >> /XObject << /Im14 265 0 R /Im15 276 0 R >> /ProcSet [ /PDF /Text ] >> endobj 292 0 obj << /Length 2080 /Filter /FlateDecode >> stream xÚµYËŽã6Ý×WÈFF—Ù|‹œ ‹ &=Èl‚¤™Y¨ËrYˆ,9e¹ºò÷9|HݲäY ]”(ò¾xçÒtõ²¢«>Ð8þýéáã'NWŒ«_=íV9_å*'V¨ÕÓvõïLN˜^o¥4û´4k_×:+‹çýz#„È~9–¯kƳ¢Ã‡ÿ>ýëá§§ê êˆi%‰T«çÃÃôû;5ññçÓ«´¿â_ÿm"› • 2‹Ìå=CF´+-)¡T®žÐàÉI·¯ÖÖ‘ÇÏE¾´çf[nã÷®W©j›GÌ•U;§ÜÇOR'¬#_.%1¦ŒßÃŽ›ÂrØYZžnší­x­Š/u'›íœ$B"%K‰– ’ØZ™nZbd5QÔ¤{v Œ$µð¦+é ïPA»ÒÙýýègNîù„#8Å3èöe3'’s7®ˆR&JÓ¾?ULâ40à›0–avÛ†×%Á™…J›Ò/ߊú\tt#•WÁ ÎnþÁ‹‹§<+¢*/M\úW´q§—Ò?Õå¡lºðÒîBN0˹‰ßCsÎ^ÆBÛ¬;¿º§œzVn¦—9ÌîÖ\f&Ðò*NÜÚ¯U]‡§ c¿­'_„×:lêâ®}åsƒcô†BUQׯÍ#^³ íl´IKIÎLªò’+ʈÈUºékÕí†iR¦§ó!:6b`Ͳ*û<™1BD˜ ‘€ˆøUô3þ°¥XÖ‚H”ð½®îïÅ¡œðXkqV:Í©h aJ¦;¶ìÖØŠ¥È9‡¥{amMóì˜02{nϯ§ySN¨º’yÉ8ãÄ‘nz.šÀÔ»| P㓽›ÅÞvÞðõÔÊ0ÕF™ƒuñ#:æIaMOlê#ÑiXœ†#@½œÎIލð¢’\^¢±j^ÜŒ‹Å]Öt9Ï=5m4¥wqLyǸ/ÞÊðm ëÁ?ÕeóÒíÃç"Òú–}ø¾ ¤&ܤŠÜʃæRq"Å•úp )ô(y_CÐYR!¸ý6ü}åLø©4ü>wÓ£Q/{à áÒ2e9D¤–ÄCop»_B0’S6©¤Tw%LN¨6)‰Ç †/‰‰`ÉÛàÔãﻀ27Þg)±fdha|T…´áœóià>탃qèׯœë¤ãÊ…I]†/Ñy*_pAÁ Q‰d“>8ÒD`±Ìeº©jz9†ãÄ›ÞT•¶ñåOQ'—µ‹a}$S§ ë|Ü ÈeDÄ0_ÊãŸ÷åóï>„ñr«,E4D¥¡5@Ölº)-ʳ²ý2WJH\–´Æ4@à=R´µyl7~‹³Üe Ûàw›‘O¶#2wõBb©™ê3¤°ÙøÙ‰ÏÍÐjø%W­†Ôf©ÕPÀÝ6e½Øi`1µ:Ý”H†K§Džo4ÜH³”èr§¡ˆE–H6-0’”.®¤_ì40÷RF±ÓpÚÝì4¤Î—; œ?:7áÚRÝcÉà­.™¿‡¼ùÃý­Æ(1°\†´š¯\‚”}‚”#Ì퉉iWá‚ ½¤”Þâ¹B—ïr>6 ¬5‘äV„0¤Sd%ÉQ2G«¾GœÂXS¢"¡ÉnÑ4ÿ憼¾“=¿|Äõ˘„]³`fná-Z\Ÿa\dƪ@(Èöê.«"P'Ì:[,»:°¡Œ\ŸàÌ®`ºÇ‚€ms÷µ¹NÙ,Õ+ ˨M7 ‘;m*E%á.EL™*Ÿ5U5aP‡¦e_V>°Û¼îž¨ï !õ½‰P©!u"zÔ±¶¼ch+%Œ”púŸT¼­gð4¡RÚ€×sÕP„›«-©“]´é;J ˜c.¥±[â Œ ¯ÊÓ]ï©kÇиéÂÅ“ÓÀL¾Î'@)à=ÿ¿Žë;Œ‹‡1í¾ã‚xoC8»?ÉD ,ÜuRl/}‡P÷öLX"9Kè ½ÇP†Ë¯b%ÒiÏá°£û]X—Æ•ïÄ}·Õw\ 8 åZ«±Hc[¸€kë:ž«ò}/†­ö§︮µÍ5ˆî‡÷7ˆ$ê0DÇ·HBdçc£ÿˆKäO‚SêQ©²v„KMÄ¥?ïî¥ Q…:~7&5“˜ôBe’ XĤÌ};y÷>år¼¿}Ãä— Fó¼ ?*ÊX7¸³kŽ%sªÏ^ƒ Ä„Ne(ÛYi1oÒ]KXæyºc·ÈGs¢ù7|B{<AXȯ{Yl‰Q L²«Ç Îî71hì…g1¨d8䊺É#Ì® êôe}ŠuRz"<Ñ s÷Ýñ7 —ê­œ¼>àÈ>†õyú(abho´6Ôß­Ç5åd†|"²¦m|z}¼ÿ Tõû_–Y´0Ýë×À¨R7ÝCX`W*®s7·÷çn]tÓc:uóïI¶~¼¨v—Äý{Y'sö>YûÇnͲÁ¶œF‰¾ Áí†'àÉ\¢bŽe9z”OŠ08iû˜òçSpŸqþ6èéúòðmJ¯ÁîÏsyŒsþR'ü6æS~<ö*NXô·&—µ^q1úý¯g -ú›¡v@æmOúÔ•ÅÖûÀðË)°™õM‘õqÂt²Õà/ùÌe endstream endobj 291 0 obj << /Type /Page /Contents 292 0 R /Resources 290 0 R /MediaBox [0 0 595.276 841.89] /Parent 253 0 R >> endobj 277 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-foreach.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 294 0 R /BBox [0 0 388 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 295 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 388 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 296 0 R >> stream xœ•[I®-¹Ç*b×ê›P€¶‡†…(ØFáå ªÞ¾yØI7ÀGùï¡:’¢HŠ¡÷¿G8ñßÿýãüÃ…óÿäþ ¥Ÿ5òŒçoçÂ5¶óÇqý¤ÏÜ>!dz¶ONãÌåS  ¯3çO QÖœ|X² /þ?íÚ;|Ú硳)¤Žõ{2L¨Ï4z¹L„é/ÃfJ`›ºÇ‰-L ”¹{ÅØVÄ\·T KÍgMŸ\çiHôsw}ýœÿôÏÕÖÿ!íŽO›ˆe@Û½5a ä­ùÆ?Ôý”èEæñ™q˜Å‘ÌŠÉžHY„r˜f£¥}F­§[0áTš›t!·æÐPœ“7‡ órìÊÊdœqáC ´$læÇ<1Y^àÃfˉlÄK$tè ¨r>h–Höj­*$íߌç]0•Ò?e׉Àô©ø™¢˜hXEOJh"â\ø X»@2¸Å~eÓGý„YDœÙ Àv0UHn뺾q¡ÂžœŽë/²|[5µ˜yÇ+z¶ÁÐPã°ÑYnÒ:ÙtSl€+©5oNŸ0X¦Î:k$™z¹Ë±mŽM- +6s¶O\Øýðj‰Oß$õ*E–Nfφ.f Â§†L‡þÓa<ÿu¤ó?‰þ?Ç_ÿv†O8ÿûˆáüãIç¢áä%>°É¶_ Gÿvò‰{¯_ܦã6™‰Éÿò éñäy,ýÛƒà ­ÁS±MZðƒºJÓÑ“tîkx›î/_v5èÈ‘>m'9EZÐqÁ)E03¾0¡Zåd 8T#¬Å‡Ž¾µ ޼£±ÃwohþgD ‰°w ¢F1ü99xÛ±œÚè@C¶ÇŠ«¸íC‡ªqcZ7|’™ZÙÆ`ƒmÄ2 ršÑíÚ â¯ÑkâŒðd•NÈU’ŸÌþDÒ®‚Èk[à}5$ŠºÎ‡æàë±r"5VæÓ¸‹ab°`m¤«ÑìLT)¿Eè!›+:µ ½­t½-þ¶Ù¤‚à–ˆÍ™µ³®”ù Ä@*im6™_­Û†Ç@Ö:W{å•Fãè&¶d$׆gç½%3gL–e8\8àœÍàÅË÷¼š‡d´¤²qƒ*ʵz,[—CN=ˆ@$˜4ìX®bXØeá…åQu%V¨0|’,'ÆcºH¸Ì˜Ñ6I_—QÓò)®öΫìtT㳕º‰ã^ä±™b>FòÏ:præ'êû§¾<É’âøCAjgíšrOeQà’Xqäóш`5}ŽbPfßuûºì}dëØv ó’÷Pa^å{1ñ(Ù-Œ‚]žÄþ0)8Ú+iWŽ™o÷›‰Ç(‡Ö:.˜;4hnÍæ×l¸í³Î¿ì€8çÞNf”y›;vŒ nøÐ‚Í/d¾æ»¸·©ò´é{¼ÖãpŽ ¤á¢$qäû¢£M%$¾KØ`óS6ýr[º¼·Ëå'á¾;”Óüó{Ç^65ÊÇæ·”€$W‚z’8ù^ï{F²rh\›:ÈÆê@§/r ìt댒Éàt-BgS? uܧ‹QaOóE@Γ¹|Šr £S!-G°ŽÝÿÅÉå oŸÜ~¨C5¬J¹œ°8¸ë‘ÔSµ¿rwÈïN1¹<áGgÊèrÂjMuëë[÷ïÛQ¤{9ªƒ´C¸íÒŒE.ØJ yJÁµá9s¢Rò³Câ-7”¹œG’Êõ˜ü*b6ÂmIfðÉÅ‹qV¤6 ñ)˜v!Šg¾®DÔT'‹É[ÔÁlJÍ(–‰˜µŠ™!X¥Ý§‹¸7¾{o¤8°)Tk»7¤i˜ ²a×Òy¹8 ]Œ™k¦cß:‡T\ž «,×" ÈfŽ&˜"-1˜§õ ÷8¬>~ÕFA€z[æ4›Ã ÅT#°ûcuÀKrj-ý§Ôÿ†V±xýàænp †O:Œ}ÌVç&Ï2Ûf²,‘áe;·I¤: BÈâñÉPC+¤PåLI<¸TÁ˜ë¼Á08!ÅíÖà¦%D.„6œãhòùŠØ—­ö9¥û¶Á"Íõ&à›‰Ó6è– ‚€š7¢|˜ÔÿJy)¢Âêê ¹CÆ‰Ž¨‡eñ¾ì¬ÛbÄOñéuy!lûÈCž˜ÌNJaV UÂ8ïRûˆg5~CL/ ´½½”©W­ó¡QêCc/JÅÅA¯%‰ kp¸‰i²öXSNg v¯€øp(¾˜%Û³AJ˜Å ýƒk˵¢E5=7›^• c,˜æ@å´M©Þ¬ãˆTQ Ü¡ij48ãy(€Õ ¤*c:q‚8¨iõ ÙµÉ_j^Ìd=¼¹›>Öp‡²¢ªJ à ò Ÿ_ðµÖ‚sW]¾ûWÞì@ÊZ+€(aE#hiòÁBý g¼…d5Rf“2ÎbR9©!h YŒ‚¨ÙZ Á±”ÒØ¡$œ+Š4 ¤Þ^ÙóxQ¼¢ˆ<Š4)ò[¡xW,Š€ó……cMJ9Š4ùhQÄ {P%xÀ}Ù-n3nQë¯ÖÊ‹{ QæW 1‚ûšû†rYkY³hiúUQƒ±À¥Vñ l "-Û5@:dV……› ”`AD‡[ÐùWÁúqâ% "¾¿[y øbç=ó­ sð—'döZ€¨º˜ÕöÈé²êøÅáÈ)ͺ̪”ú¢Z™º9³&9®ŽEÙ¶NÆ|¦~…âU»ø0vß§[ qoIOŸe[&2¶ 'Cá¡:aMÒ\:65)!@÷]жí‘ú/³ vpùööÀ¸kÔ¾–4åM<\“õä³x-‰³à=’õ^η+¯‰¯ØW¾7K¡dB*‹ ‘±wùp¬‘±ã³G÷À×gµ[d$ ¾'%9ŸÔc„í–r·j¡´žô¹ )[Õè) ïÂS¾7t~0ç)®ä¦È_ÂÔœKågƒË܉Àï½CáçPzÓän7',…&ùë•£Ô¦mÌ7aêóA[U=ÀU\ik²ç…~¢Hª(Ÿ¥]dÖ«ŽÁý*@2rÑm©I0.:øÍ¹‡\d°Zöë°ˆŒ§„‡·yK8ù-á&Œ<&Üt& %>¾èð„úx…·ˆ×['EÙñfáT®9Š~O´#A¥9æU!t‚ïbM·pHñÜOK¦€ü´Ðkª©F‹jÒ!ò7|©©&T…§ûÍkÖ¡+ÓP3Â:0:拰ꪼj²²*P‘롱4µ²«,ëe0»L%ZYõ¡!VëSi¿óª~­JM¿Vá'«ø!Y.A u¸5Ë®Mø¢% 0µI„$Ü·‰Ø?Øœ/÷¾²gAJðˆ©ËKóo‚|¬Æâ_ajê’zÙ?N¦IÁtÛ¾µËÖÀà÷·8IâpúÔÓþØ3jW3\"hñLRà^í3>ßÃþnÁ žÈܵÀ:[ƒä»>üZÞ-`M~²*I`3”‡ ©‹ýÞ!{ê‹Á%®çl€%øÓ´Ãæ÷Ú èCÈÆZ”W±ú¬qÛ#0»DÞŸ.|‰øâ†óæy9ÖëªD÷Éí±–\©<|³‡EwnpiAú„ІûÆêükçu}³ åΆ߹çÓ:ô ÓHú˜°lÛº´m˜×¶JýÖ†+ÜRBòöÞ¶m5…ù¶êú¶­Ænrî6î_úµ‡ÎzÿNvÿÆΡÁ4û–ΚêÖ‡MȺ{–Æ=åÞú—7FÿŸCßS<·”;ã²¼RîòšWÊ  )·°”Ûæô!‡¶§Ü€[Ê Žî)÷FÑ?ÃÁˆ•rn)·¯g)7ÚSnà-åvh)÷C‰ü×8x¶ç»Û ý{#HÎ ¸¥ÜK¯–H0Ó+åölx{¦Ü_,|;ŽŒ'D{Jšc¼§ÜèqK¹sL”cn)w¦ëå-å†~ö”î)7zÜRnÊrï)7V¹¥Ü`ä–r?„á]xÊ÷¦‚yO¹ )7à–rçØï)7{ÊcÛSnÀ[Êí„¥ŒòH¹â¶ù&XÊm«ZÊ ®¶”ð–rCª-å6™5å6¸ç¥9Ž[^j)7~o)7VÛSn0·§ÜÀ[ʽ #)÷¦3I¹yÀ–ró„+åÖõÖIQv¼yl)·¢ßíÅHR¹gNð]$–rn)7à=åÎ)ï)7àJ¹sJ÷”Û ëÐ¥xO¹°ŒŽù"¬”›Wõ”hK¹o)7 ±RnÀ•r?4Äj}*íWb^¶¿ÎÉ%üú_æè -™ûÏ[äã4}¤Êñɵì?ùƒ&ÿ¿â!ÛO4ÿýøÓñoL5… endstream endobj 294 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 295 0 obj 4495 endobj 296 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 288 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-while.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 297 0 R /BBox [0 0 376 86] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 298 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 376 86] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 299 0 R >> stream xœ•ZIŽ,¹ ÝÇ)âiÍà ðÂî¥á…Fwè¿h{á뛓‘é µ¨|ÔDQù$ÅoG8ñ÷ï_Î?ü#œ¿üçÈýJ?k~åÏçÂ5¶óËq}¥ÏÜ^!dz¶WNãÌåU  ¯3çW VVœ¼Y²/þ_åZ;¼Ú硽)¤Šõ{2L¨Ï4z…¹t„î/à fJP›ªÇ‰ -L ”¹zÅÔVÄZ·T KÍgM¯\çiHìsw{}¿Ô9Æ ÉlôÀ_ŽË«ÄóFnA<éÔšk×Úô6ÐõaèŸß–·¤×ÈlãÕ(á5KE‹Nù:©¼‰KÊZš‘7^5eR°è|ó|åÜV²ÇÜêSqOlž"ëÐ_#Tÿ‹¬;^mn –k÷ÖD’·â›þ0÷sFæ<^3ó8š³bò'2¡¦ùhi¯QëéL8•æ.]ÈÀm 8´çäÅ!Ǽ»±29g\øP Ÿù²OLžx³Ùp27Ò%:tÔBÙÔK$µR$­ßŒçÝp•Ò_e·‰Àôªø™¢¸hEwJh2ŹðA°väpKý:Ëfú ³Ètjä ßAW!¹¯ë@æø¦…Šz²;nª˜Ë»PQ‹™W¼¢†a[4 …16íå&¥“]7åÁx±‘Zóâô ƒçÔÙff¦Qîrì@‹c]ËÀŠÍ­ÁE_)XÒºzù\~,Açõñú•³Û*Þ7ÞçuÐfð-j[ò& Î‘YÅÇEÄ;/'<êŽe2K™_ßæ÷¾³&2©vBLƒV±€bÚR}ž“7*usOš@Š<àuN VŒÌÇ-;yñ¤”Gq¸‰O_Ž»êzL ­PÕŠ×ì¤ÁÃ:Ë=++z4ÙîS"/!ìuR•’ž‚ °OÇ4)) ÿ¥xz3›øaÀwÇ$Nìýç†aSòÝ@,gGŠ@]«çʰDÄ/ÁI‚V—òÀV'X)Žl´½æ°ÚaóÙcNb›#–Ž¡^ˆÜ>õŽ ŠN:ø¡ðýø­逈“Ç&¸ É >µø°AèTÕ†õBz &ƒG1€âÌ;1Ò™l´ŽâLW«)‡¤H‡8äC+§”–BÕHG¾em™ln‚Hd‡2 $³EAŒ: ÈŒôJ§" ‡¡‹1k£ÅºsÊE1¬s¹–€’dÍl2ê`ÊlI!À<À:)D(3øÈ«Xô­£™æm˜^dþå0èí °[Å4]I€R_¼Cm<~¨«|ʉ{ðþ0õÑ[Û|– Ü“=`M9“·ý8·Nä:‚9´yÐV8+ r&róC±¬p“#hCŽoH/7¨ òÉï°æ„+»„ô¯PlÐbßËç”êÛËl®Oüäâ´ Â<åDãß\$¨…ý[°ÑÁy ¼åP Ãã,ZWJµ‰&(Ä'³ðSŽhŠm0Ò'{÷:¼¶uä&OLn'g¿#†ÊQ§?ÀÂÃôe2‘]]¹ºØÊK™Bpëù0õa±F¥ƒi” þ‘Q—›J‹‹!5ñîœrJ™< @Ü}Š/–ð©dUà;@éÅ 9ÎM׈ÁGèðß$3›]U m–*@y·ÄUÚ±¶#À—Va{Áaéa1›ü…›,˜@† («6„Q ¼X=Ìõð npˆ´æeDTUPšäOï_ðµÆkW}~›ö'ôÉä`ºˆ V1¦Üµä)7”ðƒ•Bªd¯ø¿å½·]9d Ð ~P%œ[Ñ D˸Óu4‹TéÙË GÏ"ŠW1gt@±Í²®úXY„pXX4æeÐ,‚+LP³ˆA *ð,‚ ÷å·5gV·Åø«´ðàžCTù•CLà±æ¾ œDÖŒ5‰¬^4‰€¯Ñ5‰ CΜ#ôÎwK"X“ÙW1…%…› T`ID›[’ÐþWÁøq%Ò.Ž¡IÄ×wK"Ï ~ðs¥ èƒ¯]9j2±U¯%ÝqŠß¼zòÜánM+0ërkZ ÄNÚÔËTÐ-˜Õ.=vw*Ù–NÚ¼ ¦^»F=-¢‡¶øtoA¤¼18y\Å2e4ÂÎPx¨MØ’Íf&ؾá!ú²ƒüÊÙÈÜ‚ü§¹Ÿâ,†pãÌšÍÃFy›^’Ãv>O™C„§ðr}¼Ü‚¸\6ø»óûä)®…PiXÍŒ$à—ÍŒ¯±{âãK€¾gF\àîhU(Ù£ •w§8©‚n¸'™ÀÓ¢ $-ØIjÃÍ}ÝÓ"ç‹UÞ˜â[V¼O^Lö°Ç“uŠñ“7¨<5nykt°ªØ£0uÛm”·$Ò†ÐB«Ð)Þ%onÐÖðl„Zkî“t&®6èòøeå¤?U ‰_=2±Ç *TÉ ˜$¼äìxèNH´,°gÀú̾¹Èà·3¬ ]aԗȇ=9†Ó|°Šú ¸5’ÇH$ÎNP" ©”½a&öÍC=2SÏ>@›ßÇ»>©ð­ÃzozXCëôƒ/ãñC®ðg3z Ñ~d)¾Ã?P&¼„j÷­#¶’õùáD?'G½Ï¥aMí¶k¦°«o«z¸ä×ÕŸ\–mý~èÑ.À:·þLò¡¿o½Û„¬7r'òÅ?øn#Qž`3áGµ¢ºÕÁè^ýÝp)~Óôͽ ds»@vgJÙn-°wSŠ:YÛÜ)£þ\!NoçÚÔº¡­…E1ëÓ7tJBï¼\ù‰lhh¤w£²ŸM"š[È€Ø €Jˆ°a}<ÛÑP_^!ðqHw´CÛÑ#²É“>ÉØvÚÉŽvlI@fMYU4»ÚŽf¥W~ô¬ùm¼ë“ ï¡=¥)òv> Ó>g@mä;ÔÀ‡~lKI¯]üÄŒ6·-éìS’ ºµ)zïd¸ñ×4Š|mÀn8ÂÆkSªvýb‚./èP¤lÇðçddóû`‚\ùÉÝ9ƒ „:fy[cwΙ?F8¼<Éד¿FØ&#Ÿ#l6æÈ ä΄™#w’ooíUÇ‹ESáŠ~ojœ¤yñ¶+ø*âƒJzI•Š|0 wP€üq‚_R¥<å)B+ÄK‚\R%¾{Œë–ÊkÓå`mmó&XU« ©»Ò¿Â£ùÉk° ÏÇ)~ˆ ËÁŸÉ &ÀM×dÈ×N¶–ƒƒÛ¶Ö¯~¯Ð,»ssƒË úÍÓä×pk¾Vú_+¯ã›g¨vÖü®=ïV!êÜ&¤ä–}Y}@[ÖΉy-k—çak.p› ’—ë= .«l-ëÜ×ÝÕM®Ý¦ýÇ }+üôjßJéë#~0‡ÎQ_ñ£ZQÝê° ÿûú˜f{Pî%PÊmåͳÞ(÷ÌOÊï™6ʽRÿtÊ=£Snmá”[û\a–åÆg8åžõI¹—D)7Zl”{–å¶ñœrã¦rÞ)·A§Üw#²Éiˆ;å^”r›@9óL7Êívu"1ËrÛÖ¼¼Qî§ ï#ãÙåÆw8;åFåÎ!<)7Ž“7Ê=ǃr“}n”›*<(7Õ¸SîÙ”{Î;åÎü-ÍF¹“ᯪŸóûd‚~§Ü.Ê ¸QîêrC°SîÊN¹o”ÛË éA¹Mâ ÛÚ¼ ŒrÛ¨F¹¡ÕF¹o”³Ú(·ÍY)·Á—æÐn¼Ô0(7~o”£í”Êí”x£ÜÛd„ro6ÊÍ 6ÊÍ.Ê­ãùN1u¼¸m”[ÑïM탓Ätg.ðUŒi§Ü€å¼SîãN¹åÎ1Ü)· |Ó‘KÞ)· Üû­Í›`QnÕ)7ÐF¹o”›'±(7à¢Ü ±YŸFûNÎËQ/ñ$-Ÿßû¶7Û×ÁY˜ûׇ̗kÐ:Õ?<Î%í?ù…ˆÈ·ÇÜdû‰âŸ¿ÿÐ-£ endstream endobj 297 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 298 0 obj 3880 endobj 299 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 289 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./syntax-if.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 300 0 R /BBox [0 0 383 118] /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >>>> /Length 301 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 383 118] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 302 0 R >> stream xœ•[Ë®-9 ×WÔ•wòHH  ‡ˆ*Ôй`ÀïãåWRµ«ÝÁÉr^Žc;¶kßmçŽÿþeÿÝßÎý—ÿl©gn{/Gaÿ±O\BÝ¿·#žiOõ8SØ{?Rì{ÊG!´)¼ö”Ž“fYwôiѼ¸ŽŽ~Úû¾éj i`9B‹† µÑ€z+à#包°üex#ˆlÓð00 ž(&ž{6¶1×5ÃÁ\ÒÞó‘ÊØ ‰|®ý.¯¯ý-Ž=ˆ2ê€}ð—ãz´€øM3 äCÇZ½[—Ö©·®—­þ¸ÞLòJ,ã"Èç1rÁŒFùÚ©¿õ‹Ìæpôž|%&b°êyÓ8RªsÉc,ã©»EO–{hG?‹íÿEÒíG 6¹CÚ­Va §¥ûÆ?Äý<ÑË™û1B7£3+nG aJç0Íõè¥ì®Á„c®®Ò™\;ºÏÂ|9¤˜—céu oF8Yg¾|‹!|ùvr6â%ÚÔj§Ø$¾Z¯’v¤{º‹ª’Û‘W™$õC3Qÿ³bµ”³ÊÇÄÁÒ’ÂMöËÈ‹<ÈDF–ã”ÀNºƒ¥Î躮™âÚ)ìU¶Žë/gùÔ€BßxÁÃv1„Ë™“ÒJUzÉ2 ÅÔY¯½Ä£ÔêÝñ8;Ÿ‰ÜP ¤ÌÁ¼Ü娠œ¾´l¬ØÔÙ&†P~)¢û]Æ2¦?ÌíFÚèj`X&LLœý1)õ8Ü’m¼)äÕaÁÖÝø‘'ÔDŸæ‰¡:˜Mîog'Uþ±îræÂªJ( #°°  ·y÷œf ^Ú.%ØpB±_LÐÅ2ུÛùâ©7.ßøþttbX±#FLŒ+ùf}íäc PhÊ`Iƒ¥µ)¼@ Yog»]nCQc/t9ž—K<’‡›—«˜n±óåê„'¦ÇZ.Ÿ +¾àÁ'èM`ßPÇ Þ&AXž¸ã8{9á¶T.‚.[{›Ý ªHë~9®éy ßñL¸8†@7Áž ˜7‘(fCG«[g_GÁöçŒOã¡òÃ=’Ë A¢e'~B(bJ•£ Ò ÷_D‰üôû€0§[ö8h¶Þ}[S!ÆfÑsëÏp„/Gˆ”i5y²¶…"¡3Ϡ׊xŠ<Ä›äûžÁÂçÍDŽwÉ!~v˜4€~‘eN[`+"I»L’Ú ™#a@>TQM®E£ fÊVü ¼M¿íw½±ðéB yB’y†08˜¦9Lc¢iºMyîC<9œv†9¨‰9}ê9‡ä3ÒŠ;‡Ô´‹„Ô¬†ª• iT/„ÁQ5ÝDÕ`„Âjð< ßÂó|o"hWªb’ŒP8¶Dpmê G×S݉ÀáµÈ5 yÝ@âÖ8ÀvÂhäˆZ Û¤ Dç˜Úæ|ð‚‰‘Ú®rÐ \Ál1±X·Z ‘¶÷뙇Ú7·VˆÜ*&ÁIr‘.Ì…/ì¦ÖÅ7˜CĽyæ°Žõ0s/2“ ›'б†d¨/xF7ÝÏ-ÅØ±náTòRE¿u´%IQžÉ¢±¥ü‰€gRO@DÅ€dÔ€+&S§ÃŽÁix´tÚc(Í Óèâð T”àcs>Y#ñw æB,Ž]•¥!ª±9÷þxdqP±ì ±XŸBûγ‡MÞ=¾:°O a9¹f­/§¾v$4m4íjGoÒ©Ï$×–.ÆNÂ~yKñ€–·žX¢ãPHxðâêCƒ>~È ðëèDï»4-6f`‘Œmº}P<¸áñ7€";ã"NÖ ›SÈåR ŠÔŸhñ‘q‚hÍË€mš$`¶P,Bw‚„è€)D —˜/‹ÏY4lÞÉÁb©˜ö»àYWñb¥õä3jˆH·e„¬!ž _`˜m(ãˆTâÝP:ÞÞ·È6Šˆª PÄHÙ>Œ0,æ%µçœÀ)N° Öç|2_/ÒŒg¸ð”‡ð€½ ƒB­Xú÷CwΫH®IpîRd y öMöÏHN‘2dï„$Šh2<9µŠÇSÙÖÌÎi~Mœùõ¨6]¡,MB€OWõÒõ§þÕÂ3½¿˜*ñî‹MõÏ0Vv¦/vª,–»[µmfVÏÜ`]$Uˆ,‡"¼kHS²pÌTUÀ>©ò'ÐæYö€ á¼ X°H€µÛè6ý¶ßõÆÂ‹´xŒÕ»*Vûkò,Ú· BwhtuöŸ‡¼úluÈ‹ëögÏ9)²GVí¯zÂfÊ®s>Óþˆ2¦ù,d5/‚PÇi~tªôîwóS<ÍÏÎÀM‚|ó™~ëmMŸÑ>ô¥†$ƒ1t} ÑêÖÙ×Q¼¿ÏxyG¤“ é£4í–>BN÷ôqä[ú8Òœš–ôq$Ou†§ºæ vG½¥×ô‘8z¤“¢é#f,é#‚®%}´ý<}„ ­éãÈ·ôÑ §w!²Ìi‹{ú8'iúhÍÿF¾¥.WŠ52õõ–>Þ÷»ÞXø´v’×=½Šg¸§qKãé#æÜÒÇxžô‘䳦ðHQ¿º¥ôäÞÒGìrKÁÈ-}|·ðq¾7Œ{úèI—ô‘<Õ=}aMãY×ôð–>:a #?ÒG£x¶hs>ž>ú®š>‚«%}¼¥8Õ’>ú™%}4¸æXñì·Ë0ÒG´—ô»­é#˜[ÓGà%}\S´N_ïé#OXÒG^p¦¶ŸYгcÝ}IýÖÑ^”•˜5r‚ßbÈkú¸¤‘ëUkúQšé#àL#ÊWkúè„it!ÜÓG'¸ÁØœ‚§¼«§@KúxKù3}œéãCB,֧оõ='ØtÊ»§ ¢äxÿ<³ÜÔ€ï'û,$eÜ( EB2þ-ΜjÔ¾ï3‘2ÿcOQ?2¡q[fù”¸ò`ýªÄþ†êB‘ãøðï§vë¯ð9µSÅÊc@/Lbu 1±òðoñAÛ·j|`¡H/xá¥iiЪÒE ™ÑÕºæÆ¦ 1#¶æË‘ y>R_ŠÓ%ÝY’î8¡s|óà‚âE„²1ËÇøM1™G®mø€:§V[ö »ÍØ(²G ck*¼˜0’À<â ÂûÓjœál SŒG„QQJ”ÅÈî1œ.Í7+šâÄÜ8×ß|@ã¬Jìí°iŠó È{° ¯Mó‹e’¤8N蜣â Ю.TÅ!}€n`Óoû]o,¼8s.jQ¹áæKI„(bÃcX?—¾RãSpüu~í©ñ%CwXµ0d„–,ɉ%òsç#蜅 / žCS Ù›jqÓÖŸ@„ Ò®ûñYf¼‰l°nG(·@fJhülÅ"?D ˆG-–f½=ˆ®T¼kâCpí*a‡­d΄Á@Ö4Q‚ ËãÑ›Z‚ K™j„ªò~Äêk™ë^ÓÌ‹ä"J fŠ1ƒ¢šÃ®ù¡œäéPèÆŸ±<¢ÌMërI_WÁB&‚XÎa᯽×JÀ¯X4]\{“”@á>‹j åÑ´zˆ"ßç7q —D1¾æp|«X×5ó½D 7×  :SX‰:%ŠøP³MÄìÜ¿= 균Ηv”kØ}Vù©Öâ·+ÿºËû)K?—Ù Ý}¡¨.Êl;¢®>M%òTÞO™nLîÁé/ÿ’ÍlÑîÁ+|O°ûÁb#º§±ÍÌ13}é§€º¹ÿVäîû.Hvß´;êèÓ}ûõÞŠÕûV|_hnu&Ùi–¨™2èò6ý¶ÛõÆÀ·ˆfL×@J A‚4Šu•e ߆¿D H´2KBª$ Aª$N²GŠºQ%!­â¤27Îæã÷F½¨>µW[öPؤmü<çlº¦BŒ왼pA¡f®’€#ÔDªåÛB‘* ÏüÌpÞDã¼Âfîû­’€¡ªîB4 7*WI6­’<„("¼Þ.Q,“¤Jâ„Îe@>ÔPU®ŠEHÀ|€n`Óoû]o,¼øþÐÂV­UdL°êfUÔ—:¿šQÒƒ*‰6ÌaÓîV%Aµ(ÕuN@•dÁ‰«$´‹VI0UeC¢XØ$d±êjU|ìIsÀó0| Ïó}Š ‘+ª˜dRFü~¢J¢êœÎ“«$®î p•ÄôåÄî§TIð“¤!¸TI”°£qMD Û¤ÛÑ¢ˆ-òA(V%Ñ]õ ¸ ‚ùçÜçiÝúko:UNúõÌ…«$7·VJÁNT W1 ¦ç›Û(KÀ\èÉÆnj]R%!æ¸J¢`TIQ%™‡Ñ*É”™VI0¯çÐ* <£™‚íg–âìX·p*¥è·Žö¦$=t¢Èé…à·âjeˆš 5 WIƒÇÊ¥ON´~o®g¨ß¼œ0.Ù7P„àÚï‹|ºUIxW~¶_[å* vU–P%QxÉ!Î6ûWIËþˆõ!´ï¼yxÏøÍû?EÎÆQD¨]KìPDpŠ&ï>ü[|H1ÿÏ |ÿ§³:‰f—ðk•Tšiö»Þ”ÇÚd«à†ü´7ɇ[o¢ûçíOÛÿ¢ò¥ endstream endobj 300 0 obj << /Creator (cairo 1.6.4 \(http://cairographics.org\)) /Producer (cairo 1.6.4 \(http://cairographics.org\)) >> endobj 301 0 obj 3823 endobj 302 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 293 0 obj << /D [291 0 R /XYZ 72 769.89 null] >> endobj 102 0 obj << /D [291 0 R /XYZ 72 769.89 null] >> endobj 106 0 obj << /D [291 0 R /XYZ 72 504.203 null] >> endobj 110 0 obj << /D [291 0 R /XYZ 72 290.89 null] >> endobj 290 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R /F36 203 0 R /F34 204 0 R /F37 205 0 R >> /XObject << /Im16 277 0 R /Im17 288 0 R /Im18 289 0 R >> /ProcSet [ /PDF /Text ] >> endobj 305 0 obj << /Length 874 /Filter /FlateDecode >> stream xÚ½WKoÛ0 ¾÷W°9XâJ~ÈíPïÐv)°ã`‡uÅRbaŽÝÙÎÒüûQ•Øi‹4Y±%K”ÈïãC&ÎÂ!ÎÝAy==;ŸøÄ¡¡„Ìw¦s'ö8Š½Ë r¦Âùá^0SBˆûù‘/rYN¿€u(õ.£¨Õ"ÎØ¿ðè*Ý ©ï–«¢Žƒ p›LšA±ZÎdeÆåÜH¡R\]TCæJÞØMÆ 3Š?êK·f[y> ÙžñH|a¬H ÝO±–‘ %/8ÐU}sŒXªbUu¤ü½â9j”FÒãÀˆG¹l i ©ÛâÐÎUaä=‰ kî´ ¥°DÇí:¬ZP#7Ihg㪡,sp¹ˆè)„‚ÁŒPM¨&Å¿FŒvw©\ÁÌ‚(wx!f+€‡á~ É@0-¡ÿtFe±j÷„²TÉ¢É7oŽžþ Øy‹ÇC÷ŠvA쪾N´æk‹O‹GÓTj¶j$¢0/«P…\›Áí»[3H3^i6x ¹|Rº±A½Z¶–Wåƒñ*/ׯ-ô.lÓíNYì(yŒíÕ†çÒz"Ó_¸ŸÏìW…GLõ^{Ì_ʪ~o&7ê §ïÀ¹!»®Ô‚ Ôø&+%ë“bE0êpRLT!öÜ]J¡l]µù`ÝôÉiædj‘uÈéå›y0€³_AS ˆµj²]Òɧ kidõI†áµM²’ ŒÄòc’+|®H% ²cJÔ“ ĆÖv‘6•,MPDÂ'”å\û¿5Ö60¾ÏŸPvTj[î'ñ¸írÆÇÄÌbÛîÂm»³Œ‡65LP$Oñû¦Ûa›çÙ–iÑmݰºI²éàú c/­¸Oe/ 'jV> endobj 306 0 obj << /D [304 0 R /XYZ 72 769.89 null] >> endobj 114 0 obj << /D [304 0 R /XYZ 72 769.89 null] >> endobj 303 0 obj << /Font << /F20 127 0 R /F21 134 0 R /F46 177 0 R >> /ProcSet [ /PDF /Text ] >> endobj 309 0 obj << /Length 1865 /Filter /FlateDecode >> stream xÚ¥XKsÛ6¾çWh&‡RS‹&ð•‰<6M'ö’øÖô@‰„1E:&Çÿ¾»Ø R¶ãL/¸‹}a»-ö‹hñÇ«ˆ½~uù> !Â"IâÅõn!Â(^´‹,^dI2Y\ÿÍr•ÝÍr%3ÊŽ›²ïkÍ÷}·L_qÐ4‘aK¹½–ýÂm][mD‘UÊ›Šƒh¥wº©FÑ$h—"ð¤ã ®Òp¹JÒ"¸^Š8p’³?è®_þ{ýç" ‹\yq)ª¼ ¸<çdTÅegˆÇ²ßtEŒ{ÓˆLNÉ™" £Ç¾> Í—êô¶uDOCþˆGÅa¤$Åз¸7uº3OwêëNϽƒ£SI¼_Ê(h™¼i)Ä”#ï.&®ÏTÞ›Æmpgž͇·oM³gbk#^B…I‘q¤^ŽN‚ ú§”—Zà7§ã†BA»£_ÿФõé ŠÝý^¾W©_ñÑb%£0ÊòÅu>Ô¢JD”ø£‚5}É×X¢H0 Ň2R‹ø¯T2“ÝLdãgeS’ݶ§¦ÿ%íÄÕ[üƒ'MjqJ  ¢œñ6È»°6 Â£TNmœ)UkªÛ{öõ̳†­Ö†eƒ™yûX¥Y˜fbz¤Ÿúöî¡×uí’ÃwBŽ€RFµ#ƒ¾DÆ^÷çÙÎ9ÙTÛ+ë“>LS™mÙëÊUý®ÄUB6Ëæv@Ëy]‰ˆ¾ŸÉâ Ó@d»íè‹ Áæ˜ó*cÒw cP‰}¯ÑOj\¯ÅKUší¼âbëNƒ§p"žNta÷®ZpÄÕž›¯]×f&v v_ fHQœTDÌ%á &UÈP¤)µß°5´ÇÍwló¿iðÉÔºaÚ;]ÚêB¶kì°¾CQàØò‘m{¼­5¿aßîE}Ç5M2Pcšv—nÖYM¶”uÅrv´t›;ÚÒŽç”›ö«SG ›L`•å!üP{t×›mâÆ«J½k¤²Q9¬KâL^)DZbnËz{ªáºÐgU˽¶ªÝøjWŸÂV^ØÈÇ‘QRÜ ÜÆ¦É<€áðL²šª0ÎEª¿œÊ]I%+J²Ñl’âQí5ORš}ðû`tíHÞGA!:ˆ¹æsk]Ú†4Œâž5ù–FW ½žú™†þ`p/›å£wÃÚ Naçœv´Ù¡©ÜØsWnÒ!G"½ñè¢Rª»w …Uò –c\°â’.®ÑéÇ5sÆç¼m.›‘‡N”LB™»Â=Ї cWQ°‹ÇÔºg—Z銥‡CPœZTDÃ$ö«îIK•ù I€µ±—Ê×4UU?Z©1$W2d¡D¥b<£ÔÝXŒå'8õ÷Q£)mËx×!N@šlS›è¤X`5Ä‚ìáˆqKÎâ4&qÁ a˜Y䆭eÍ ™ŠÒPbÖsž^"ù@ëÛ,å¶ÜgðÃ$²qt(–û@„öÎìM ~`í­®°ë@™Ñ»©¶áÂ`÷;Bÿ-{Ó6®ÝúXOÀ›?ÖmG‹Ý¨Šepêx èú»¼¡·&l0=ývÖÂm¶ˆ§Î"À_Ôƒ!xÖË$¼| 8EXRyÍš¶'²kü'ƒ/'c‘T<ŒqXq@³t$ð4K&/^¨P2ÐÓµV<\§ãÙÜ­jÑc;üãσ‡ø8¯Ì þ4šfj<´§;Zt}û†^ÿ·…Ø•½ùÊ«+1rª¡ß{šI¤ŠSTÕ:+ó0Ö:ÎNÎÙ)ÖíŠPÀ}âö-ä Ôú—Nùj•›Z‡Ð¿³"â$Ì-~µJ®&€fn/¶öV ÚRÎ1‰|"ñûõ«ÿn˜^ endstream endobj 308 0 obj << /Type /Page /Contents 309 0 R /Resources 307 0 R /MediaBox [0 0 595.276 841.89] /Parent 253 0 R >> endobj 310 0 obj << /D [308 0 R /XYZ 72 769.89 null] >> endobj 118 0 obj << /D [308 0 R /XYZ 72 242.017 null] >> endobj 307 0 obj << /Font << /F21 134 0 R /F46 177 0 R /F20 127 0 R /F36 203 0 R >> /ProcSet [ /PDF /Text ] >> endobj 311 0 obj [361.7 429.7 553.2 317.1 939.8 644.7] endobj 312 0 obj [826.4 295.1 354.2 295.1 531.3 531.3 531.3] endobj 313 0 obj [272 272 761.6 489.6 761.6 489.6 516.9 734 743.9 700.5 813 724.8 633.8 772.4 811.3 431.9 541.2 833 666.2 947.3 784.1 748.3 631.1 775.5 745.3 602.2 573.9 665 570.8 924.4 812.6 568.1 670.2 380.8 380.8 380.8 979.2 979.2 410.9 514 416.3 421.4 508.8 453.8 482.6 468.9 563.7 334 405.1 509.3 291.7 856.5 584.5 470.7 491.4 434.1 441.3 461.2 353.6 557.3 473.4] endobj 315 0 obj [500] endobj 316 0 obj [826.4] endobj 317 0 obj [489.6 489.6 489.6 489.6 489.6 489.6 489.6 489.6] endobj 318 0 obj [514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6 514.6] endobj 320 0 obj [487 532 532 776 776 283 240 500 500 500 500 500 500 500 486 791 792 497 1020 1064 745 333 326 375 776 649 592 678 238 308 308 388 778 214 409 214 332 500 500 500 500 500 500 500 500 500 500 258 258 326 778 450 450 895 620 685 640 748 660 626 728 750 284 335 698 520 895 788 745 685 745 654 646 590 705 630 904 648 580 585 214 375 214 500 500 238 522 522 429 522 492 263 522 517 283 240 477 288 701 517 497 517 522 349 428 322 517 407 674 427 517] endobj 321 0 obj [482 532 532 776 776 283 238 500 500 500 500 500 500 500 488 791 792 497 1020 1066 745 333 326 375 776 650 592 678 238 308 308 388 778 214 409 214 332 500 500 500 500 500 500 500 500 500 500 258 258 326 778 450 450 895 620 685 640 748 660 626 728 750 282 335 698 520 895 788 745 685 745 654 647 590 705 630 904 648 580 585 214 375 214 500 500 238 512 522 429 522 492 258 522 517 283 238 477 288 701 517 497 517 522 349 429 322 517 407 674 427 517 422 500 1000] endobj 322 0 obj [250 413 250 380 540 540 540 540 540 540 540 540 540 540 274 274 370 778 522 522 887 666 711 675 779 684 651 761 774 296 342 734 540 945 815 783 711 783 695 678 630 729 675 942 689 621 621 250 447 250 540 540 254 533 542 451 542 515 272 542 533 289 254 501 293 726 533 519 537 542 361 451 290 533 438 676 456 533 447] endobj 323 0 obj << /Length1 823 /Length2 1494 /Length3 0 /Length 2065 /Filter /FlateDecode >> stream xÚ­’}<“ûÇE’ S(åèîh'Ï{h3&•Ç¥ZÑ<¤ÙîÍ]Ûîµ Ã<Ñã«„„ƒJJ4)GŠTB*r %Ž¢H ùNׯóïyÝÿ|¯Ïõ¹¯ïûõ¹¾¨5®Ts;:Ã\¡9ÖK(,Ÿ1 åÀiBæ:Ò„ ÀZ[[[ƒØŽ`¬H"‰@@ ˜ʇXBÀÈÁxÎDì8 ¢Ó¸…& 9òt Ât†Zvl6°kî° €ü`aÀbD â"ÐsL.\& ¿ÊŒ Þ·V0ÈÈ¡£yLc@É€¹ìP€2è°ü6PÎò_`ý8Ü9ˆÍÞAãÌŸOê_}b‡þí€9¼ !È(0äs´z_á(  âüØuÒØÝŽËbƒ€9oÁÕ!3$®0il8¯ƒ\Æ$òüæ9Ð7 uËÓ¿W;ßt¥A\¡{(0ÿ¸çkì?µ<$>$öb,0¬Ü(ÿ¾|¸Ì‰K‡—à–ϧ…"0òQ8Ç—ŠP$'F[pa¡ü@žLÀ„ùˆ¹½¬4æphsò¼b‰Ь¹Ç'ﻆÐlP ø.¬4O¾Q˜ñ]ÂbåZð|ùï8ìíaQ¸ùz `Ž#Èñ08K€HÀDüŸ‘Äçƒ\áü““‡ú­fBò=€ ¤#:Ú`ºMìþ”òÃù‘N¹-ÊÆý´¼ØÆê8IšÅ`·ÍÒ§üŠfwÐà½VœÖ~¨yvxÛ4ƒIx¡Wn'¾NEÇ=׺§®mœ}Žª2BôñSlȪ¯ÕädèXÝÇ«0ùÓðCOpµrñv–˜£7||a~{ÛÌXä¨G/:ÔR†ýg¾YUÛ“AÏ×= ?‘á\¸ãbÃrŸs–}éЫíj= UO³>‘EQj»<º—\œño\—ÆsÉNõ÷ðGѾœ8GE“ƒö4{,\­ÙzæVÁ |Œæ1{ð«ÿ~Dò¬ ;’‚Š÷$:)öͨ©›ÃOînÄcU÷xOMLèq8oUÇ5ÛÕCLN \bë—*&MT’ÏlëÅyO 20¶ª® ¨<}Ü_!pu˜u`ùCIæBàR"*Þ/\E²\G¤4]žU2©ùüzö †s—§‡ýÍÆˆõç ®orYË=É—$‹9^iŇ›n¶ûûl SxdÖ’¤úkŒÔ«T]4ô¢º™¤6yêF³Sol[Õ0_\3zÒdÊä´×qøÄVi›7™8ËŽØKåä¿ê}й¹Sì¯qá±Â“ 6§Kšã"˜í¸Î»“ìQ¦@np=(­oÈP»Y*vÐ]½$ï0uÕ½ˆ/ÛŒSTj’á7gß©œÑv›:ª‘up··¡rUÙ´˜µï×[ä´“}ëÚ¦<»+ÃÆëÖ¶ªJ»_y›´§¿ï¯86Í4#ê=Ô|¢¡¬xY¨–!'LÆ–™-¶JÇ~éÄOÚ®A.xáa4º§jí­Êñé~Ú§•7¥4Ú°µfw3«˜t'žéqML:WûKCtºL&_}›ßÿqVËÀ#ñ³¢—Ì®Åfz'îë½ U|äe÷¸•n½Ðuj¨Þ§÷ÝVõà dÑFåož^(8ºÙüÖíЉ]-žå³¢Lƒè¬iCznL¶SncÈ¡ú¨†°cËìü²^Õ&Â!q«î¯jª«†ºT ÈRä°ß„í¶g+u%Ÿ4÷Qœôüóè9ýƒ²¶èî;/Šôoîy>DZYP¶¬ÇmÕù elÖ5þB¹YhÆêœÀÏ9 —¾úðà¯(CS\ Ò¶õ1¦.ÅÑiÁ]ÖÞ -׫›à̦òž/š!ÄÇ+H2Ó„›§î6…ù‰A5ÈŠßy¹é”Xyf½cN»¤xíâs+vÈK#/ª¿1yz…l·ýug7Ù‡¢ß;EîÁAX¦»ñ:Ÿ\²(ò}úD~‘â:ËÉÒÊèà€ÅFyFú?št-Wî±¼Tõ,w)þ©ž^Ø’./ï‹”ÒV§ÝߺÛ_~ЦLœ†__Ûéóî^ß‘£[Š]†ú!ÑÒüþ¨›N[®k½º•7šE´¶Ë§“¹&vÛdZ\½í¦­dØÎ£‹f2”•ÖÓô+·$G:ÔÄJ«ÏÖòĉåeFç瓘Êþ×êÿÀ%ÇF§–Yìÿ3yö‹ÕNZ¶ñGYÞ^ÉõåjY¿•£5|[ð*IZË‚P÷qNŸÌÔ¯D¹·(¿|ØM 1mÆŒž¬9Ï4&WF—jJ…#o5p$j•q“Ïwmì¾ÿáøõÅ endstream endobj 324 0 obj << /Type /FontDescriptor /FontName /MQMSHZ+CMMI12 /Flags 4 /FontBBox [-30 -250 1026 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 65 /XHeight 431 /CharSet (/comma/greater/less/period/v) /FontFile 323 0 R >> endobj 325 0 obj << /Length1 776 /Length2 1699 /Length3 0 /Length 2243 /Filter /FlateDecode >> stream xÚ­’y<”kÇ-§©¢¨äi)faLè¤1–,ƒÃD²½cæÁ0 c0²$ŒD%YŠÈÇRHÊ’%d+E†d,C”„èL"yߡӧÏÛù÷ý<ÿÜ¿ëúÝ×ý½÷£²ÇÆNC¢»ƒ&tS¡‰Ð°8œÙ@¸„Ã!**XH`’é4#Ôºº:€y@jp´JK¥ Q°tß`ÙÓ‹ ¨a®™Ð† 2ÈD À˜^ U8ƒH vt"dk °]ÛáØ‚þ #$iB€D&2wГLƒÀÖÌhtý½L ðýÑ þB(@mó „$Ñi”`€z@`Vtái åÿõëp“ ÅŠ@]¿Ô?Ú*™ü·Nõ `‚ G' Ú¯Vð;$‘¨¿v͘ ™ˆ¡yR@@¡­ ×þ^'û›Y ɆÌ$zŠ?¸^i¤_I„ñ­sÀÌÍ0æøCßv½gC Ó˜ø`_€ÿ4¯kÄO-ŒˆAfNpM8!4 ¿+—_Î2¦é$2Í@¢tƒA†À…£(‚È4È@–¦I£3…[a0a€Y{UÀÈkµ¿¥.£þ”8£­ËÞÐÐÎ Ñ@jH”ðÈ5/û#1€ÁiÌõŸH˜ÓíAF ‚,áöÓ‰úÑÞ×*cŠÂo½(–8è¿+­ úYû~𾿠O_¶QÕwóeØ2ÞäÛÒ©,J`$Ô˜b%&´=ÄÆi‡ÊÌI·“œ'Î8»Švdµ5o¡f^xÇU~ã[uh~pŸ`4°A¢Ìò=«ø!N¼èUÿ·Oá>gŸq7]'í{› qɪµLí§F¯t.ÏšÒoѹùÛÓ[W¹ŠÍ#Ÿahšn|N¬¿ð£“iYʼZQ+ahøzK¨ÀÖFDIñ½­ò›üzÒ›‹Ýe'^ru¯øŸ½„¤j‡„cŸŒ‰²«Wä3¥®÷©$´²®Ž,Ú‘¿õ)¸IëÛU<™2쯑ÿ’) ¼ 8`”´[¿´ÜíeÕ°uâ(áZ^/a‰4sum¿©$勉Šäò÷bíøyÔ©ù=tŸ{·Ä.Ú6Ìê´m:é=?»€Z[`Ò)=Ó,mª¥wá‚&“ÊÜ|ܽÅ}hÕJÑò±´øËx' ·Õw™[»ŠïW·‹r‚;ºû4½”•`¿‘wôDßÏ¡ø°ëÛKôB»)`û³b yé~f†çK.YÜ6ð¬õÔe/•Xšp:t¸¦ý¼¥ŒµC»Ãþ(ôY‘ADêœ_nšé‰[íÕeøÔ±GJT“1ÜüŠò8åz½¨ ±ЫPµTý Ç9/ÑlXŒ=6W÷Ð"5r{Ìãø;ÿpÉ–aW°eÍ­¥• ÖtåWo:Y”³£àéKk´ÑQ5ûNgæƒïÀ9M¨À³pEù‹uÁeƒGÕ÷‡t¶D\žídã͇ô˜°§RT+ ‹L°]˜8£‹;Õî3m-½"ZMØ7X–¼]9¤’>ž7j”/‚´l®¯ ~Ö –tÂU š2“LüváT¿Hð~w÷òAÏâq0©¨sÛä}7'o…ÛÏvVþ¶Õí|öÂ6u´ÏYeœâs­$ºDÓWWá7wjgÏ#³£[Þeá®Æöiçr¯™›jBÝb²ÞÚšm±V¡’ õ*qR!;>Ç]Â'îç_¶.©>ó€¢å5A{p‘z¼È!ø4GW,eåIºÒ´éQ(Ö4Óí«¬i@e¢ãKNÒãäGŒvNG\–7jÐ}ƒÔÿ¼„¼!U–Úýn¨?ƒIòKtl<ð§×\¤àm>ç¤ñ¢Ü³ŒVòhGÇFç®òiõ×ô!èH†ÏÔLèÒ»€¼ÌÉܯMtô“šK`Æ%é®´ÏEé Ö¨?˜Êé2¿)Q*ë½´¹Ð{ÜÄZ`øñüTv™¡èŒ]Ù$ûòÙ ±SøŒA¯ïÿkGüïWìÊÿmâóçG½5þ.Eû•§¿õï¶ê%¦æÁK|¸‰Cq¸®zªþœôÕÅÈÕc;J·r²œêyÌzÿ‹²ÉãáÚº“MŸ§dùÐ I”«”™ŸüŠ³È±. UM‡Êûz~cÙ¼jf,%¬¦8•£Ì»Èy~Rp“èbP4þÊ2—BW_-4Üî”ö¢þ^o á^MÀ`hÛÓƒÜ!ƒ^þ¤b@„êÆD5æ°sÿµ§?¦ê4ÿÛ(éu÷KåÁD4Þë{Ôs+)]xÅ‘cÞñŒ.«Žöe¼‘'Ã-|ŒˆÝéÐ…°¨¥‘ü½éâ ÂMLx®jÝH97“Û“Ý›¿œˆ~î§²àTð=Çâ0Gc½"Ël>*6Qû¶@4¤—½÷) +²oK;14“(zo;c"%§ü©›¥E­Ü^Ñ\Ñ}eh~¸EÔñYôˆ«zò1ûn§Ö†Ö¿šm$4ÛÓ*x–«f´Üð0µÝgøõ{dêæ]ǃR û§2ë”ô—Œ¶üGAFü ~u³A¸Ô°© ›7pÎÖIïß™ýr6gç¯ûcCnmm5Ž÷F}, jDÆ{¯ˆ¹ üCŸ‘7ÿzK¸oƒñZ WÅ endstream endobj 326 0 obj << /Type /FontDescriptor /FontName /JEIAJT+CMMI8 /Flags 4 /FontBBox [-24 -250 1110 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 78 /XHeight 431 /CharSet (/i/m/n) /FontFile 325 0 R >> endobj 327 0 obj << /Length1 772 /Length2 1349 /Length3 0 /Length 1894 /Filter /FlateDecode >> stream xÚ­RiXSg"²)‹¨x‰,vEVA¶°ÉVÀ˜\ÂÅä^²¶Ö"dIÑ`beDAÃbad«@A*«ÅVqYpì*%œšæ¤g|0Mp…/¬^Yº“g`ÝeT…ÎÈ…{ŽçeLifö>U‹{p#óíPOR[¾k´!¦b¬èch¯{@P8PÃ_À=3 WºOUû_+ë7ªŒä?;¯íù‹³Cš:l(¬f‘WÉ}ɳÃŇdú¥ÒsÍá_± ÑÃ×$¾JUÈ»›wM)¥qß±r4l:sòA»´n©dÚè¹SFÏ JðÝâ9Eæ®Fëô·µ Ë,˜êÐX~'aœl‘.~¡¯£“ÑÛº¸TÆ8©ZýŠ@Zo>cpЬÓYÛ»Ø&euTÒ¸é}ò’ï ‡ïí½›Ü”Ð9ãBû}Ê8çÀIx±ëOš´¢ËÛÕä-ÕŒ#ñ«·§2¬ÉÝ»ÈÄ:á} ÎK «¹E¦—Þ–‹e]^tSÊ•nÌUÁNgc*Êwý8_Û̽b=1âãªÞÖ”³íd#¤kÌⱄÂêB.ïÑÙ„©Z(ÛámqØ“+Û_ÌO?gc-%„²l“úÒzùJa/”Õ‹ózž¹ æX§^ݹ’òµ8˜Y\AŸ¼s§àÌÇÎtLA.aœ{Ýö¦CÉÎM³’Ï[WqÖG*ùUM R±·R£ÞÜgÞã·ÛªñN(­IL•~z×1WAÃË y ’öT`»¤à¦µøÚjû¯–à –s¿ñлS´æl3$=…ŽÅÍ*£9,—8qÊ{áÕ'Z¾CâïMûFåüã~ôÍJÐN³%´¿Ú–b Ùù´´±uïµ® z¸v%#Ñ™XøŠªT2ŸwX‘s»´ðèºôñÁ.Vë‘:{åNP8‡ Û9±Ç)i‡v8žÍÒ–ÛÁ›‘ÌkÝGõ(Ô³kãë-–{O½ÿ‡,ùÖã êsJ=¶iOTõjìwjÍùÁéq̱(aðdøn«bq·µ,8ýÜæeçˆrSݺsëÕ«%GËöXM(ï `¾þÔçøRÓGõêÍÒÀe1}’¸mÙº9ñƒÇ«õ: ½óªóO<1·üÆÚ[&ƒÌw¶W<²\x Æ<]f™«sß³x&q—LËÍkŒy¦~HR­×TÙþ•ÅšyÇÞê†N¥ì]1!ŠßY™ûöçöWû_:U¸7ÏWzÁî›HaÌô~ùýTª ˜¶¶L)ëŠàéÅFJ§,¶–¦Íö鬽Å'‚?º¤Kÿt jªÈù¨½ö}R¨a­_sÚ£eOWy¯6èWå]š¸“ÃV‹BR+W_æ$ci7Åx=W ÷?NtÑêàð&Þ”sWi±šÐWF#.ÎEMXZœñ5ÊÚ8bÚ=€·‰Dåt¹ §ÆW¸¶>v™izcSz¯óÑ¥£æ endstream endobj 328 0 obj << /Type /FontDescriptor /FontName /KBXRLW+CMR12 /Flags 4 /FontBBox [-34 -251 988 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle 0 /StemV 65 /XHeight 431 /CharSet (/one/seven/zero) /FontFile 327 0 R >> endobj 329 0 obj << /Length1 769 /Length2 1334 /Length3 0 /Length 1874 /Filter /FlateDecode >> stream xÚ­R{xÏœoX ‹"a‘A€ƒ°% CP‚ÅŒW”‹êW˜#~£"a‘76à&Mn‘ƒ¡üÀ¹  ŸãNþ¦æ6w–òù,ÁL{<£¿±,Âù „R ,î¡s¥þðWkî0‘ æ²®aÓÐ0> H_!DìŒDÃODÂæ.‹/†gqåÌ5Ç6kÁb«Ÿ‡ŸÓ³Ùל¥u4ÅÅÌÚ ¥ðØéª›Ÿ¥¹›[¬*S³ÑöM¹é,Êùš¿¼Ð«ÈK èk?ØTµqШZ_$+ €].Ž(!—d¯õ/;œy,=ÔÙLÐLéðoxÙuÙ¡8áæ“LÖÛÍÛœÈ$ÚØ!`ÉÇÛÖq}·ˆó»¾ÏŒ]Q¹¬Wý^ð¹BˆøOçóŸpKÔâ˜_ÆïýCYnäHøÔÕ›\¾Ò ÒðY½Û©¨Ém×#]ÝÌEZƒžÉA#Ëû­ÔGÀ ¸÷˜®ÁϋلXnnã/µ_ {øçdC˜Í#8qŽ›ÖVgi™ºÊéõûÛ˜íÇ [ü£ÍSC¡²E…9óÊïOLô+3ì sêâkx-_Ƽš–M.e¿1KC»ÃRB …ï¼µ6æÜÌtøœÜª/¿öÄ˰rðÎý]Ýg*i¢ôÀï@aö»ññ»Z^™{$6o6Ó7 ÕÀVG3¼×Fˆ}ìuÖùnÎYæÔ¤ýûœÎµŸ75Ê;šv¤y—bh¹ÁÛpŸj3‡ákôõ<?nYÃU³ Ì[ºzàü^|⃮•~ÌhVfÚ¨kÈRîóó“KGÔ^LE¤„Sò^ú{Í“3Þ4s›:³3ß'ÿš¦UД»àd˜å’:" }öjHæ{P–”ñ,_Uië˜nÚþsÞ¶'!Z.S4& @ô–k<¿±„#pT.IÌp¼4Ðr.Å‹rcÛþˆž×,â‚FÎr-ûm¯„e$5Z+¦÷v‹«™“ŒÝA¢)¹Eg}[°[¹pëş®}Ì•¯ÉqæœÜ®Êlm]~©úå¢v›é¤~×óà×C²†7½L1&Z{ÛôåÂÇëÆv¢â_Wúi7æ¬êX¢lÂ;÷pÑ &RxX…:¸Ô³N½vÂý«ø÷{7=PŒºç{­ Þaës 6ÓW\¡«ïÜ—©¥o•nÏ:Ò'/©Kò§“™tN—}(ÛWRSQ¥æë•Y›R¹®Þ(˨ѧ\rÚ!Ðð£U÷zjÎ ÅÃfS½“·ª² åJ.Žå}Ëžø œ5YM¾Ç’E¬rÕîµüîxz2ç_¯Ãθïcµ€ÆðluÓñ§Ö[ùi~‡ endstream endobj 330 0 obj << /Type /FontDescriptor /FontName /GUNUDE+CMR8 /Flags 4 /FontBBox [-36 -250 1070 750] /Ascent 694 /CapHeight 683 /Descent -194 /ItalicAngle 0 /StemV 76 /XHeight 431 /CharSet (/one/plus/zero) /FontFile 329 0 R >> endobj 331 0 obj << /Length1 745 /Length2 580 /Length3 0 /Length 1092 /Filter /FlateDecode >> stream xÚSU ÖuLÉOJuËÏ+Ñ5Ô3´Rpö Ž´P0Ô3àRUu.JM,ÉÌÏsI,IµR0´´4Tp,MW04U00·22²2*RpÎ/¨,ÊLÏ(QÐpÖ)2WpÌM-ÊLNÌSðM,ÉHÍš‘œ˜£œŸœ™ZR©§à˜“£ÒQ¬”ZœZT–š¢Çeh¨’™\¢”šž™Ç¥rg^Z¾‚9D8¥´&U–ZT t”‚Бš @'¦äçåT*¤¤¦qéûåíJº„ŽB7Ü­4'Ç/1d<(0¤s3s*¡ òs JKR‹|óSR‹òЕ†§BÜæ›š’Yš‹.ëY’˜“™ì˜—ž“ª kh¢g`l ‘È,vˬHM È,IÎPHKÌ)N‹§æ¥ ;z`‡è‡ø:»8ùjCb,˜™WRYª`€P æ"øÀ0*ʬPˆ6Ð300*B+Í.×¼äü”̼t#S3…Ä¢¢ÄJ. QF¦¦ Õ† ™y)© ©@ëëåå—µ(C¦V!-¿ˆ © ú¹™y¥Å Q.L_89åWTë(èZ 44´0U07·¬EQ˜\ZT”šWN'À°€ñÓ2á—šZ‘šÌuóZ~²uKÖômm+ë\_XŪÏùóÄÚ—7ÙD쨛™Rl:/P1½dÉ«…¶öϾ(á•l=U¸h‹d¯_OÜ—EÂk¶v-X1¡Át¿Þ`ñÊæ®i¼ÿ´Õ_y. ›1§õ‘´Õþ¢Ç³:•un~Q®?Á3/å…SÔâ}ßï]ãÒ š¤¥$e~sû]F1ñʻϯþ‘Välžt·Vtl_]ׂhWÎ×V¼M\­|e¦ÂïsWgE²)šÜð: Àؾì¬|Ã×»7/)­ÙxÈXmyjVrŒ—ŠÌY£Ó˜±íXeö]¤ü«g¢àƒÐãžLë?=É;ãæ¤ÏÜpa²†G“ªòï[âbgüõtN]ýXüg_ÞÝ%kUc®>=ð#IÄÒþt|ŒÂí­yflÎ(zØXœìåöò’öu‰)O®DÝýñLÌ·¥ŒÜa!k¸Üš`»5y£…Ã.Ñïz÷4ˆ&wìúaSki‡¦Ï°Ë—²L¾ #~Ó™{¼«:Ï-ŽÿïиïÀÔå:æ8«]Ø”mbªñ©«nßTéìÈç5ï¯ü¿sc%WØí †„¶YÏÜþ¤K5ÛLZ23ñÕÿIŒÓ‚²c™Oz ñFì¬Óük3Óç,ôº¤žuaá¹&­ÝëzC :;Ö\<C endstream endobj 332 0 obj << /Type /FontDescriptor /FontName /TMCDBM+CMSY8 /Flags 4 /FontBBox [-30 -955 1185 779] /Ascent 750 /CapHeight 683 /Descent -194 /ItalicAngle -14 /StemV 89 /XHeight 431 /CharSet (/minus) /FontFile 331 0 R >> endobj 333 0 obj << /Length1 1791 /Length2 9930 /Length3 0 /Length 10948 /Filter /FlateDecode >> stream xÚ­weT\ݲ-®ÁÝ·àîîîœÆiÜÜ!¸»K€à$A‚»»;Á‚·×9çÞ/9çþ}£ÿô¬ª5×,ٵǦ&WÕ`³p4J;‚Ü˜Ø˜ÙøJššlì6fV$jj  ©›#HÒÔ È`ããcˆ¹[ØYlÜüœ\üœÜHÔ G'o+k7ýï €˜ÐÅÆÜP2u³:€9ÌMíŽæ6@7of€˜½=@ý÷ W€:Ðèâ´`FbcXؘ»Ì€V6 $–ߊä@–Žž›-Üþ×åtq‹ÐEÒÀ-AöÞ  %‹²#ø. XÉÿQÿM.íno¯lêð›þ_Uú?~S{ïÿ‰ptprwº”-€. ÿÕþ[œÐÂÆÝ´rn¦ö6æb +{ €õß&Wi/ …ª›¹5ÀÍÅø/3dñßÀuû—%9%Æÿi远ª¦6 7Mo§XGÿ ³ýÁàò¸Øx X™YYÙÀàßÿþ3ü¯Ë¤@æŽ6 ðDpqL]\L½‘À£F\€lÐ ô fa9ºÀ5ñX:º ýî'7€Eì·é߈À"þñX$þ >‹Ô?ˆ‡À"ý}*ÿ ^0§ÖÄ `Ñý‡€Åôâ#Wsssw‡ìœì¿íàÖÙ¸Úý ™ýAà3Ss;W{SWë?V6°ÕlºÙ-ÝþØ9þ±ÿ{$ÿq€•›ÿƒ¸ÀW˜;Úƒû%œ¿-4³±‚S·ø ‚¯þaWø7pÿö;»ƒçü-`1à–Ø›:üÅNÇò 8ÂÒÆã/ÚßnGw—¿€C¬þ\ö[ýÞÀ¿CÀÚÿ”†Üko'k è¯°Íæ/nŽÝ_\?ª¹ÁiÛ]]ÿòƒk÷W là€?Ü\`. èO à»@îf¿7‡Õ_ÀK‡ÅñJ0§ã_§ØÀÏ ‹Ó7ø'S è?ºËÉö?Öÿì-X‚ÐÅú+”û_6Ç?äWÒÉÞý¯ÄØÀç?‰ÿFî@×ß[ø¯pqÿª58»? \à,\6ÿ9K\¿c€5€ Lâ ~Ðÿ‘VüŸÍÆüG>8S7kà_“®ˆ›§ã_ÀîAp=þ‚`ež ø5ÂâõÓ{ÿQ>úèòoîÿ»âÄŽ>0±˜Ø98ÁÊ Þ\¾ÿfîînŠÛ¿^à5ù¿ØÒ¼S@/ 9ÒÒ¼£¹@ˆmZsX¹ŸTÑd,¤¸Õ—x冮™oÈÁ‹ ö¥Ã Î ëõº•™X¨û°ûdžOD®Q_}ÔÆ¤:ǧϽì{˜ìg¾o%Ò½ÌTòÞs¢¸ >Fkožýu©2½>Rž¬WÜ—sÞ\ J'©y¿JÑmàÑØÂÍ£+i¯ZOÃA®Žžî\Á¾æ‰žœ³6ìgŽÐ¸ráøÕó¡!?éÅÚbLÛäëò+;.[y uÄàÉò\.iÍõ¼©ND£®ÍûÅØ4JÅŠ·Ën‡šT`D/ëÕDìqNWFÃi>©\:“&£ ”6!*a¥ n.±%µ½O7»™LØÄ³#Jµ?¶y”yÅn’Ï3W·¢¡Ë‚Rù~~"¦ 1q®\ÚeãÇõ*&ë™PgËt© ›cÂt×ß;Ã÷:Éÿ}Êm¡!v\Ã÷æ v»ô·ìýõºVᤠ±8lEëÚÑ1-MÚ |uY;­ôɘdyä€ëaô$ t ‚vùZsBþi­ñ¨¼˜AMž¼~Q$y¿¡–‰;T!•µëìéÁ ‡ŽŽZè-xÅR”L-õ¨©Ûa:ØÂ½°ÜQ¸N8Ñl‘2á 7¦ÃîhXQØnüªÙd d›¦8Ð:CÍ7Ò-ÿ³OŒçc³‡›±xj_Üè¹eW~ÊÃ_B–XíŸ ]`Œô±t˜õKX÷ètÞÆ(G»Â§Næò=ÏGe¬ž.‰ªzÚ] ,°`*çGÆÐeÔÅ”/™^¡t5K-aîüXMQ[|à/¡õ$–ýÅÏ.æg¡0ZîŠXeDe4²_(`5I6þ½f½/Õ¶'…}‚âB—ÝÚ„=e§¡VÏ )é Ï%@ˆ âG¼×úË.NQ$+û|;MÐnÅfÔ^HÉÂŽøÂF¤÷SC½exŽÉ:ó0Ø‘¤c™ŸÚs#c¦”ïMˈ î•?wŒ}…6ÈæÆš…â¨Óq;±¦6÷ÕÀ™2ׂ#“X>°Z3{ƒR‡{Ía[‚›™à_¬è®”Œ@A}:’º`Iqí¬Þ€×ÙwæñýQ» ñ®Í°äaõäwºãA£wIõ¦ ÷ƒ8éçº×vS­dƒma:ÎûDê• d¿/y-ÜácžtGˆqèK*€°«¥An„xÞbLÂÄÆírª6):©v3/¶ïa…k™Í\ˆ guž‰¯¥E’¼åú®ÀD@õêA c:¾ú”µ'£,¢FËKœtÃ1þ'—ˆ ÑØàô£yqVbX´þ~6 ñ’ÈiF?q5&¼Y– a¿#³'“Ö< µR$NººžDT$^×rwl­Gµ 4ÑÔåç.äƒo?$.´& ºy}àç{?øC¸Þ \|­Ò[ð¢POd”Ñù)Mòó;5íi¼¬ž·~ã×~K qð®÷åÌÎðJýöø£Í\%>´`¶ë`)2Çà„麠rÓàˆdWÛ5ÂGÎM‰ÎuÁsî :µç™zˆe@Aâªþ² HÊKËð:2L`éÀ$GÖ ½P¡BovƒÅ7ve ²Mf¦ ý»[³ qÿršU3 õV}±á·, ßv÷iæ0ˆ4ýz›C¢”ÊÞøçѬAG†÷°:¹0Nù€ö­uÑkä{ZØÕ³2­†¥›0çÏÁ:hUê<7$E$c™”Põ©Ñépï0ƒß\ åDðzl„ït2@¼²‚_«dª×Öcßœ;Y 6CUÔX]Ò[ðw Å+o_2!Ëc``¬Žô”޼g IOjLë›ÛÝÖ¨^‚—ð5ùÎ*éýèi)ñjï1Ï>}ìŽ2‡7Ð$ÌíèC›4|Ÿ±ýËZI«ë#÷8Äzô©C¾euR§j²Å+몓j»Ù†Ú‚<ÛÕPsNÐ>ZY¯š°3ˆ e¡àPVf°<Ù)Ötºúæú­ý.ƒŠÆyÏ—q”¡axö²RøT¡‡%¹Ñ1éílOñ“yþÖˆû'æÔÏ<»ªåý‘†‹§êI¥¯»6טÀ»Fšr’â£ÒÓQRÌX®a;h¼¢‘e)©ÎÑ3¹·ä¡Ú[E¯Îè,0oXÛ’¾l%hI?eµF0?9½HŒ79Kï?+à¦WKZ•ÉÀþ8ã˜õ@"ôuÜ _â»WTñžíɳ‰Ê~Å"ýÁŠK]+Õá'›´ŒúÑXq…."¨A͵šb qëK<³™¶µ¥B>Áúœè·(fY+ÎÜ@H‹£ÅBg<ª Ÿ’pÖ—ÔR.ƹDl[Ãèâ@ééí*®eãÙ«ÖWUH¾¥oƒO?3(VÃB³ÜåN„ZGžSⴌά¡B¡=Yß²t<ÅM>¼ ð‡ó‹6„W‘4eˆÄÊwq—âgÝYu@ïÒA®h8O ã =Å”¦kàI@ë¶c>FõyØøï¯œùùÔ³M…É#”œzB­x(F8 >ê*}“ââà á¸Ú::>0á–¾ªr j ð}çÛà¼Só㫾x8¨{^QÀœ¥ê¾@Ù¤¡É C…Žœ‰h]* }Œ@*~NÑ!»gXùÜZKØUæK%~ÓäPXì™*µßKþp\=ú(„éØà|—¦õ³n;[­Æ©ØPC±`œ»^¿¡×ð ù ÿŠt¶U_>~¨\[‰M£8@- ¬ÜOß”6R‘`Õ²àBüUÔN‘/óÇÌËUæiT3}aWÒàmUJc¬Üâ¡£˜)6#pÚ)ŽSÙïœ5š†}‰Ûðଶ„:m[!tK°7U“ YC¿ÔeiÇWž±2Ogÿ1RôIÿ¬›z)W¼ dÏÝ,~?¹#º–Í4Vg âv¶Ï®£_ñŽVké Üæ`F‰]"ö:‡ $ÁÙîC^Q‰ Î'5?C·å+²@hÞßókm¿'Ï:¥êqP+o»Ó<@yBð¦c#Â×M—õY‡CКÍH~l^±•îØ "–GýaÄãóŠÒìåͨE­Ìò‚?ÛGP³Š.>Scû‰.Úî—*Ä o­—ïÃkäð‰ðñŠvAšbÂ7N©Ê92{g}%«Yeq³—\Gq d–ưTuç„Õi •0EVõÃP{¾-æÌÛ¬‡Ü«/›¾mbs»¼Ü/\Gì§g¯ ¶ŠrâY`r^|†ºíŸNžE|æS¥ê¼JÖ± ˆ§AJמ¶kÚ†ðû$ó¹ø{çg($GHxƒs3UYÊÖYd@®Ž\±qVšóÙsÉåcšQ}c‹¡ÅÇ•¬å…cF{ìÁÉ\÷Ïë²f%³ *T4Fqcñ—éù`…EÄô­/‘')qïäáÉ]HØAÄùý‹ïïtiFèÆòçk5[­h`+¾ÀGú“ÐL’2áýT¦f,UÏÞYOËth?Çdª!+Có‡Î(ãÞa^4›ÉŒé0±F½§S-9õºGí©ÕJˆmÙ˜`R~G¢ÖÛÁ>ð`Lqë×KGIa×á5:pÔx×ó÷ Yt”Ân›ÕÎ-ýu‚ Ú¼ƒ2êã>z`«ÈÝ+N ý}¹„M¶ºB¥­¤#Z”æù¹\ÊUï9wù¢•SõüÄ‘sô¼Ñj”I6ܧé©Rzx´•w² tØw†¼V 2‰–R>ä? Ÿòux 3š½‘.—à ⃕½Ë\øwø}rIB¶L¨ebÕ-k ù¾SñË)†yXv}¦.¾¼‹‰ÁF+,aˆl¬´[QÝ!N»1}*‹e|lK_ÕGâX=¼Úêô…”É ï4´Ž¬É¬+5j¤m])»úì–—¶Õ¡u¨+¼½­´:b l¹ú*•yüN—`ŽsJKý[;åãðœJMÇÒÇ8¾F³«“È»§¸i¬›²ÇÉL”Ï"W’qî3õ?ÓÕ†_*ZjÙr-½“^xr…`K™ ÁTw—ÁAëè8ûRŽðE¢¼`}-h#6Td$djB)épåó. vÒæÇ-ëA…¡Übì`òÔ&¤¯o²}M*“ÖA¨0X_Fñ!Ïžüê¨ÜUÈãÈ2¥®Û]…«}é}™ÀeAê€Û‹¦ü°[õÞ”¬ÿdA¨¤XkôГ½+2Ëì$o‹Ò(úåämBdá\€n{ZìõuŸfË9š¾ýáè§ñTœ‹µÑu’»ÝR%ÑÎÅsJ›KóÈ ëïd•§þÉUÉ[‰3ŠÚŒûIÜy^Q¼ê…Xñ/㪿:xÆabºß4.hÚg,©7Ç3A'›Y>*p|%•|Z²¿‹Ç–PýxÚ¼T*ê¤R´»ÿðvد]2ð>xHFõ6¹bŒ&³ÙpemÎÛÖ§l³9÷EéІ‹ÎÄQŒ2JöKc[Én¢ËyrkåO–YPÿ ´Ñ“ÂjwSý°‘DX±²8òÜ5ã`˜}Š£h¥khÄ@3¾ Ð]K½ßŒÐ|ôÒ¼ôyºÈA£­@Í’Eª1Äó†ÂY6lÂçæZö®Îhºr_3WÁò•bhKIýõe‰¬%R¿‡0…Û•þ…ðöNÇÛ¯ÏK}¼AwucÅ– cã±f `Ññˆc„Íê4ëóµ õ޵ÎóøFîž>ñÓ¶€[ Ôþé(u†‘–ÓJß‘´„ÐåªÐø A´†§šÖwîx3„§TÒÊ>ã±dæ§iqO+«¢ uGóLêÂW MãcëPCÖ¨ÞÓäæ¼NŒ©ù{>xÑ2Ù,½Sâ´JP¦Ø›!ùZ×*„A ±{ »èÍ‹„÷žvq$ïûk†æ?ˆiûÝÞ¿HÄV¢Y”§›ûºœ]½.; G#+ô€¢‹tÊôÕr¿´s:Ï DdôÙé½D žã „ Ÿ:0Ûëo×2•jNÖ¬î%ÜÕC•ŠÀ¼þW”EJûiã¨p˜çÅvX>?ÑJ½®þÓA^ÂNçu™þÖ™MBÃ}¬‹r]ø[Ì4†¡éÄ©a3kM:’޽ôÙÎÞ@” ¹û÷U´OÊŽxÕsdòŠ6©UÎXáØu :r7Tݽº{©¯f3m!¡)’qÍñï Ïá6’?‹tÏБ+enE#:[’Šð³&ç]ÜMîÕ#m^_>…ñkEÎã4´…’E‚¼¤_j !É=-[Mªg¢¬àÂèZ–]ÉkNmãD_‰{Á[CöÔËz𢠵~Q®Zþâºð­âEÞÚÖI€æj.×ÖkwtЖPŠþ«¤œãm¤ÿ›¾ðÞ£Ê2 ÏÝSÇuÊ——·ß ?{ž¤²)­¿HPµl?$níï[fØtc%÷¤½fäŠy»Íÿ”HΑi·SΊAü‘â> ö‡lKto@üƒ?“Ý2Œ»u²ÑŽ›ø…¹é³+:P¶½_«Tþ‚)3×ÓÂö¶M´q—÷®pR A"lÚåJŽëd~î„ÒŒ5vieKâAæ?F†*¯XÒ®`˜ dä<ÉôÂ,a¬LȇÆž5µ…áÙù4oWÔ;aúñ›åóàû)ø!.½ü§ºv‰ªá¨<z*ƒÇ¼r±dÕê9º[R/lI>×JS½…§°Ê.™¨B¬‰tú½~óš>ıޯùÑ"#Ô#è|<€Ô²M{uo§î çØéçÇhŸèó”·.˜RóofèÓ4ÈQ¯úc”“H¦ÛƒLO —o—‹ÔJW¦Ð?T‹¨¦1å?½ £Ž‹ä¾š÷´ÁäNf†õ}6àšÌ¹OwUý˜½äÏË'í‰y¸Fó¡§Ìí9HÔÒX2#‚÷ SØ®:†f¾6 d®Û †+:Îήòƒ öL+ûù1¾«¥«’¥µâ:‘Ï€þ}oõ“7NDt­°G’.ñ¯É¦˜—–J‰¢zÓë‰Ù½n-Û’œ%a»5%ÅŒÈ4Ö,'ˆgôožôæx•@c@‡:z£ Rý!ÁµÄ¥© ‹£Ê"G‹²±\r¾›¼ÁÉ{Pn…hzöE±ª IG}GéÝ©Àá¾®”˜Çd%_/uî}-”[@0ž½¤R½Oáå(¥ZxG„ÝëÉH‚Øåb»(Üz¦²Øž å•@a`fÂ{ [ 2qa­ËžŽ;Wªg÷9UÅ]gm¾†Bz„4yñ4gñ!Öïñ»ž·ÚŽ(ú&¦f£E˜˜9„_fµ|5ó´u²n~}GWÄÔ Qꧬºò˜´1ó=˽­¨® ΘPI!C+R©226þeø‹&ÐŽOÚ²Ÿ¦ª2Z!Ôá3&J+Ž6”^ƇíÛ+e"í£•[ã êšÄ­s7vx¬ÝFÓN!§h ­§&w%o3†Óh‡eEúå°Å¢SUH[ÝXo,Ò— ‚ºŽË“ÊzBÁ9Q,‡ aMcë(#3¾¥tJêSÉI ºõÔüù+Îj¿8.w@â´d|䄨ç’d³A×|M²ˆîú“‚ŽË59z¬ö$0G['<²¿ã -¢š°0Ë\9ó‘/·¢ª<;Ú·5-3?`ã̾sBÁ©Ë¶WÄoÑc.@vxVìIR§®mÕZMË q™<î ~î2>ĦqüíÀfµõÂ?”3Ø¿Áx£—F#Ø;š¢>ϱOÅPÚŽ5P¨žÍ¯’Å ÅÔ™öñêµ…ú—”ÒÈg A#7Éehpôs‚®Î½u=ƒ­õ¬„%D•bܰûqÉ#™߯›)¸tîö© AÖ¥+ñòV”nͬ]¡Vú(% Kl™ -\ƒ[õºîúÛ˜åb5^ÆAŒw(¶<_[UÄK¹¦¬ÖcãÓ÷ß<}~užô{‡Ö¶}ýùĸÖ éK)H·6ƒ¨Sn³Xû$)²üŽ`¢CöLQU–X—ôu^ó®ÐÅã@‚^y‹¹ïèe²RÚ¹³©Ãܶãô°I‰ÓεÙe‡áéÂ'úÎØ3<¨žš+ža9¹ =ÖC̈VS¶µzl– þ(W#xöƒùÀÆJÀeÒŠY7…ú”ñ]½vÚKà2A×cª¾—¨û«¯¼›Ä{ó(GäÑ›¢,€Oec¥üð6³Ÿ‡ƒæYìä‚Q׉zäÌÒáMOdy™HyìSÑ´úè¯Ý |~ÚŸ'uLƒ„MY©%--s´´”9!ÃEâð8ôñ7çÈ5ÍÜÇ÷¼ŠÝuc/Û…ã•|H?‘ “,Å«©xJš÷Èà„W'm“R$4‚œ§êkúŸèEvIX½}÷R’p]áslL±–“¶+ä£#ë.:Òóñá,‰Z·šPt(ø?Q.ôôÆ2[F5\æô£Ô¿»PXˆµstÖ`’dìò[É;âÌJçS:xî… ”žì$e]¹Kkpæï·Ñø¤rPèºGP¥Ñr*í"©H/ÜÞG¤X@²–zvèwË|ÆŸùª„†Fd€ýD´ÂyªŒg›æ+\Õ äœWoÔØ|·ðóœÜ4hCûËÓ€y¿ð´‹ÙSgíëÓ;ì5#¡¾…8GkœEƒ:&8J\¯vBØ™HÌ eyÂ%#^ͰURǹR\[e¯ôÚTüÈó Õò X‰vŒN#©ù9ŒIÚÖ™sCà«IýjOÕ“žÂ»‰·9•Ä|#ÄtÆæ¬{ÈVø«NžÛ'S†ö’Ý<.^ÃüÓ/„Vº5s{­°n,²±]ªãxœRKsþK……ð™îTähîË8ëm¶ñˆÎv#žéÞåcJëdši´] !€ª”,R¢ív(–Öç±w¦Ï£Ó{2X–AøÜXºÝW<é¦6þ“W„Ô\«ŒÂ1<Äøwõ­»èŒYéPÙ4˜TǨp@[<3Þ‰9ØQÛøêw÷Ì#-7g¸`ê:ÖNVoq‡€Ö:Ê{ºÈ_¼èY¬*šÒÈ«­&êØYr:–QW›Œ©N¥UÑÈ Œ\ðÒ—«ÄaƘ 0•·u˜°*ívÈi·„ôv‘-û‚þ‘WBT‘Wn¢¢‹lÒª4Ånˆ˜Ü_¿ôf¬OmÙ@bótžIòŠz‘ë[›)f¢ÌÐBS4‹Þ0¡Ã†zàŒS.$r”K‡ÆŒú³éV&QÊíÀ¬ÓBkªïª¬¬|åâÕb BávUÛ‰ÚÀÝJNº§ RN;“yG¹Ð-´x°´À[,nSú *þ øãäqVDeÀi( ‹æíiîÕ7õ¾Žq(±þug7²S6\þÛÂõiï®·‰[±L•Έ=ÉMm:A6ñZ'/KÀptSs1Úv¿qeúú~f²A‰²%÷I½ÁE.ܲEÉ„Éa å¹ir¶Ê9±‚ËÈ#L“£¹,ñð§i}‡@²ˆ®D[Å^sÞ¹ylhÄ7"ü[•?oès΢y]ùîhœå.#üë ésôÌ?Ñ-ÏLlWìDò95†| Èé¨&zX Ò¶³âRnºóýO%m8<* °”5ÌÖèÖþ ÷LÔµD:ýÖ[16t]y'•¢žíÄõ°BßÖ³1X}(—u’î[ñBŒó4Äåb,ºÝ¥×Êæî͇þº0/X)>,ØFŽñ‡÷gë°ðëÓöŽL0¸"ÕÃê·½ž¾ü¬¯iøHW¼‹9Ø )ˆPþ™Ù[ñ#G—Qä§„±±=74–_)¬ô4Ayø…¥²šéÚª ŠR„Á"•B$§Çµ\Q' +¡¯I]D‚Oùµ¨õÙò$©¼LaŸ2p´ïÜ!pÎÜßQÃ08*¿Ä]G2B|±ÛÖÞÎ`[ÈN=äägˆ!ÛÛ+5QJDeL5(ô¡ŸþM|COó”]BEgßxŒHÙHE§•¶~©Ž6Þˆt»¶/-²æBußïäéÈ"˜Â6²Úͱ7•yc[¥ù…ºö^ẔµCd@àÜMê¥ë›>1üÚmÔ/Ö &~Zþ,Åm˜Âàd3~¬<®TdZúv¶©Þ9»3¹'ƒ³çûà̯ΚæcÒ¶êó^$k-o¨slÈ.™ìãá›Í3>vÕV?/ðv?dŸßâhÔYç Ëi M´´:¶äzÌß 5Ãå³µt½ø¬½u‚A&·—ØÔÎq+ "HÕŠQ‚$ȇ Aaø„7ôJ;ˆ`‘ø˜ÈÃí±´mÍ+j^_¿äù´I¿œMyù«êÔ~ÖQ«ëŸy@KpŽ–½¥–ç m”žG5þIIDýs?,õ‡ÅÃYú3Yó÷NCb=ÇñÂþù[–Ï —¤¦Iñ z^\5‰ZPzšÔkð­ÅAψø÷÷ÅceO„ž ¤ÝÓöÚZž L ¶ËŽý¡@Dôá·pÛÝÊŒ8þ6 c׉ Ý­ˆeL>^†.¦YO<ÂÁžwOéŸä¹:>”eþ‰¥ô -†üXÙ+ѦY1ûøõðtd8íÈPüAûÒrv¾äÒ–¡–®‘&—`PùÓƒŒ“Ñ6v tA Ÿé[nÂ-¸7©†4½TŸO¶"ɸ¯›JY{¥´¡ÚK†«P‚cWW3Ê7á Þ¾~Tœ)¦”òK¼ž;8ý`W•A:/£fo©÷âå²q° Â?°?º3Í7°^QÍ×`ûXó«;ùSméUBƒ»#Cñ¨uK±ôy'Oì”»†¶g—ŠŽN7&N+ßÐ&`ª»Ç,‰ÎáÁV‹YˆoòP˜$=¥+¢“¨æ˜ÌÒ t€2 \öðOaßÉýÎþ‰K([ÐåÚ mÇÉÝ×”ªr6žz—ѪW£(ÿ™™%ŠëMóÇ— þ>}Ïù™Å–š`¨”}0dÿ¶xÂô—|9 C@ËÕ+$V<³`®8ïóvsoqùr\H Œ³^a ̬ÿ ×óñ©ë™[aU§oæ Ê·‡ØWž¡/rSšv·Ùˆ«îü/9••£9-{º3¢„ž°{!sß`¢çì«?Ï-0í¥à‘‰v›.†ÏJkÍT4Ô¶…GD±Nt°¶ky?ÑÍ °¬‹çÚ/¢™éHéë~°-K˜MHá¤[x”16Npb¸™Ã$çùæÖ>Z“ÿõ9vÙÔF”·ŸÚ.Vòq\Bø›†TÚOm—ŸC¦»¿l]@CmwÍOÍŸo©¾§O–ª"­šcÆ0ö5*«bÈïhkâ µäË„±U]XIù`(E µ+îzRû§©Ш|©UÎ1@N+¸ÍÛÿ²“Ù endstream endobj 334 0 obj << /Type /FontDescriptor /FontName /MOOGIM+CMTT12 /Flags 4 /FontBBox [-1 -234 524 695] /Ascent 611 /CapHeight 611 /Descent -222 /ItalicAngle 0 /StemV 65 /XHeight 431 /CharSet (/A/B/C/E/F/O/U/X/a/asciicircum/asterisk/b/backslash/bracketleft/bracketright/c/colon/comma/d/e/eight/equal/exclam/f/five/four/g/greater/h/hyphen/i/k/l/less/m/n/nine/numbersign/o/one/p/parenleft/parenright/percent/period/plus/q/question/r/s/semicolon/seven/six/slash/t/three/two/u/v/w/x/y/zero) /FontFile 333 0 R >> endobj 335 0 obj << /Length1 1066 /Length2 22352 /Length3 0 /Length 23043 /Filter /FlateDecode >> stream xÚ´»c(A–6ܶmÛæmÛ¶mÛ¶mÛ¶mwß¶m»ûö{gf÷›ÙýûEEEæyò(#2#ªH å•hŒí MDílié¸$Üìl hí¬ è89¡HI…M œ-ìl… œM¸Øè˜è˜Ø¡H ÄLlMÿÂÆ†2&ÎÊö&Œÿ$ä휜i œþ²MlÍ,lM(ÿªÙÙ{8Z˜™;PQüµÃJ lâdafûOÖfvŽžÎ‚.ÆZFNvV:a 3 g Ï­$i`ëâäI CG kçf`deñWì–èþÚ–æ"`ge `úû2üu_ÄÖXÈÎÆÆÄÖÙ êq [8š9Û9zÐÿG¬V¶vn¶^ÿ‰˜ZØ›þ'0v±§W±µpp1‘þ/¹¿Ô¿13gw#sú,ñ,üfül`kìãeogO`j`ídâcajòw€òr2p5!pvt1ññúOÆÿ¤ Ù Œ-Œœ Mþ&êŸÖ%lMí8ÿÿõä¿Y®&ŽN«DñϲQþ­™±­µ±‰)½¬³…‘ Åÿ¯¹ÿ_KŠºX[ËؘPü;§ÿ[ÂÀÆÂÚãß2ÿ‹­fòO)þE 'Q wcy g#ó%õ_¸„³µ…‘€­™µÉß‚üR±56q´þÛz{ÑâML@û×ÙÿÅS6·0²²5qr"`ûËÄÖ˜àùú7ïÿð”€^UXQLDú?:åŸ"¶FvƶfJÎëmàhüÿÿdËXüW[0üÛà?iÆÑJÎŽvV&jÆÎæÿ)"càìhá®Å@ÇÀÀøÿûü÷Lç8HúïvümAA;w/Z&&¶¿Qsþ‘…•€‘“Óç(¹8:þÝÿl¨¿¡ÿ7mjñ7&&î&FPë¿íŒ¸ƒ-ÓZC+|EŠæ+AI9鮪ÑxÕ%@Ö3ç»±1„óˆLøŠÚý³ÈŠí¤Å¹t|SlKÕIƒQ­ÿìt$×Ì=+ðøÊøbÉLå©Ò©fɬùWöQžKæj”±,fu&tâ¨L]qv÷½Ç0Íþ >¤iWvn€º•,3¶¡8Z#¹¯!`õ`¯Í÷:ÿ¼£ÄE ¬S-醢MI‚Ùô!h}àHU&Í«î[g&yŸð¡»]ì|Ffyçnkw¹-aÐj4„¬|ŒÝï6moå?™ÔÒ 9îåç¸û-¤Zî^S"™ÌüPKµZJpÑHö)Èà îתî>Ðß  c·æ©°5h¶?Íù|/7á¦'œtNNo?‹â{¥ƒµ>óäpm]¹ÛÝmD "¼˜)Ö9Ëà52¾c#ø3¯0.¨Øat³ça =jˆVÆû¨7¥çJ8é 2oMkû¶#ÿ1BˆyÒR!L|Ø;˜?–Âü>`ÀZnÆj²³\™Ežók ÍŠ±‹¨VPK d£ƒïõ5[â*io‡ÖpÉÙ aam¥oÔÀ)Á²Ÿ0nÜ=•­•üÔ²¾¶3l[ð~“„ΠÜ—ö:-YËzJºqW{N™9pÖûd/ ,N‹uoÔ!"u)«—ï<ǬÌN £CÖo¡ê|;¬?-nÙÖÇüF‘åoéAWÂçn[#³M0(·«ƒŽ…Rèº<š˜;e\ÄøÐ™ÛÃ2À¬ž‚ „9ù”D )O.Ά%Â3€(¤ì̪F©÷=¸õ×f(â¡"x†-Ô>‹U»I÷Ò“|WäÉ «˜¡"·­ì"/”^ƒÐ€Ö:Æ:"¦ v¤ω¼OnŠeÚ²·uOmc}½ Ô¼$ÃZw+(X(°Ú×G¤á^Y_‹§•ØÈ'md (ž˜W›NO™/ \6%Z ÔÈ}J”zV=½³š¸@Xú•%NžöHö1é ×p,¿èW ©»LCQTÿ™øRlYªéÚ4âYª#;£/OþuºÅLôîÌ]MÒÖöÍc£ùI¨Ï3XX!4²ƒ%BÇ’`¬9ÁOÊè²l$áêu’‘á’DÑ´Áo'ƒGîÄë‰/…Í,BM?Å£Ü^*8Ñ£s t%” =8R?V>}ô–Mmèðíd,H5é‘AêZl¤ƒtTÆ&–ó`+©+{„S"ˆ%ú{YΖ£™r±(‘óTüO3@]Ò 4¦+Ùêêö›Æ÷ìeà”–”«yÇ*"å× IÝãWÁ#egÈ (Ú°2Eÿ­zˆƒ ŸÙ¶úïEÚO4<\+›z)r)>Çí`‹ÜUˆþüÉ¡ƒ¢­gäî¦}_˜cïAy¢B^Ž(_šEzqãïT«-r5}ÏJË•ÌAü¡°=·/ñXHÂçÊ»¨yö’…u—¹$³©Ä[Äí¯MVÒ+”_ƒ:Gc0x˜>Ë+÷¶Y­f$¥%Io{~ñ¶¾Ó“R@g¹b;öºß. ;àt¡©¸âä¬á]q#—íº&âl÷‘\8íåK‚‚AùáçH¤òc UMÀ§$ë~Oðž‡6–ë’õžBf—(e‹1Õ™D»*ô$29ÝÕ*4†7 ­ß®(Ö^*-wLoZþ}Õ688Þ/½wöæ«sÎMêÖÑ ­AÚ£iÝxÜ<÷F³Û)…1ûçk| ˜ªÎ$v½x¾À‘Czí#ˆtóËRËÌx„l¸Ô€'T€nt¬Ñ;ŸÅWáQŽHà)¤8—{¸~ŽVuýÔBmœßAâ:×–_á§}é«í•‡6'˜ùÔܼ¤ÁîÜa¥O&\/ª%èSOñ`Ž*“ÇÇþ3oçsµ\ÖW•Ft=Üê¢Y?ëåI€n“m^ AÏ" Ô¦0ç ÐHÉ‘S=© óÉåæàšGlV•tÁnž$ÛHñdûú¥"<|µ}ý’äÍos‘ȺD“{ ÂòÞ_}Á?Dbkc—½²)ësv12Ò£¿ñ6{á-Ï>¼-cþ<$7“… ß‡x¤BÂLñÊjÝ¡"€|/Áç¹Ñþ0˜Eýï&5 >r]ƒY¨°ddÜ×tÓ¬Ôe±¸˜Bófx]uå#Xøv¥Ò3ŽØ…‚$!Å\Yü`Xçh !WA³·–dá‰ïU&ð¦Ñ•n°›xx’Þ™©R‹ˆ—â{<Ò[¸e׋Eõå’>1'¤û¤M%¹ØÂ(Q&ª$PÈÛb²k–mDZ(ˆ¹l¶X†å,#—sÑìrp<·/­X­¡ò´ B9™¨¹—7V^XÓ ›ûeµíŽ š¾ìb“ШgrÜŒžØ–)Vçý›ëi¢@•¸Å ôåí×Ï… -qe&Y´Œôjo§s/å-‘Ý—âjkHjÈ„Éà†c ¸µB¼Äxê燛h.…Êûôwº¢­r€o©1X > f[ÅTׯlªéOån‚-Q$x, Ë7iH½Yµ'_¤5<„È…ÏÞæ/äö`þ eŸâVj{t½;uGéMòÍÞwRôÆ22m>TÌͰ1v‡ÒÙyÝ!1MøßþÛE¾ßm±Ø¶8æÔIðâ}P Ø¢\Ùôlï4 õÏBCÙ0ßÞ €Ó’ǵÖïr¤"D=¦ny[S˜Ù»´ßØš2óÄ»)l Š[÷»âñ¬û9×*\+¦±j£4Î@¦(ãÝ´x™cE¶N£ùä¤nT)SròÍ©t:ßpý@ŠÊך#ì_óÎ^x¢1h–GAƒÊͨcª§sRC7+ EÞˆ,Õ¯ÂØýdPÂ!«É¶ RïÎJAFL9އAsˆÖ÷ûÑ›¾ç] yçÈTg¯••ÙO–«ãYï½Éšküx3s§(bdn悔㲪¶AÇ8ò fêÁZ­˜I §þ *¶×$ûƒîì^æ­-¹AOyíÞ"V¼Æ(ö¥s×V…=¾uB´ÅWµ¦ï ¥’‰$?­É­/í½:¸ô¡H}¥Ðbê!åëƒ[4*Â_ZÇø`¿c¯´<“wÓ.¸-y}¹®!ÃÓ•?r¸–ȘìÆÃMèDZž<“Øš8¡1ÓV¬™Þ·DQ¦à?¦‘·u·5:JCnäT2ÒŸg)6z 'š?°ÐOÑ̲­GRý`X”ª«‰EÁÂÐ~À“@ ¥sîYO°Í±Ší7°´…Û!ôþÂHˆª¶Tüš«·c½åÍîü ]f¢™ùªc91Ðà_ߣ´“7Pn¤‘5—éà'3„ÙÜ’÷5(Ãà+Êœ"³ï×WÚ-§YkcÓéƒÏ¼/?ÑpÜßÅ{ŠlfÛ=*ÉW†c'•!*!ø8LÑo{oSÉ4o7K±éÌ=AM7äÊ¿¤ò1&û´NYnŸ Iþ8G0ë„` 8D¶=j¼~#¾U(‘¬H±/É‘‘Íi•86[ÅAyò"qÑùÖùÁ¸ÿGûÆþ¹§9åö=çL÷ €(Ú‰mÏïnép1ÙIÉ8Ú°û;ãp(n 02Û+zbyåú%²T\¨+‡Ú$¨¥ý w÷¼%v*‰Ó$IZ»„; NK’S£äQ€]%®Kvɸm9‡ý¦Ò Ç>¨÷©*__º¦æë„ÄÕâ…“à rW NÏÐG—Œh‘Úå ¯k·/"n^}}Ô[‘t.^(>À· WßHÜ&ÆÔ¡.^êÉ =«:PÞ4çP«+Þ_C² ¿2Ùò¹ ¢•ðzA–2ÌöV,´bé•öé8ÝE}0ö£"™§óà»"F3ÎËÒØ”T›åî õ‚:@0ˆVI֥݉—bVõq_5ÔÊÈæ«xñÉHÇ}´3H„pÇ——¸1ˆ=He?1t‡ÏxL–<ÜòÍ!ôÓ­õ`ÝeŸå÷˜Œ綻تt;Ö³.ƱÆ÷N@,Ÿá€¶,qJ~ÑÑñö¯Yp¥ÔÐð¥;s¤°`éÞj&²®ö ê,ÞÖõû(tÑȸÇï”DdðÙÄ¥C8 …\Ò½ò¤º¡lh±„Û5v)¯[¯yj‚š”ñ1¹Q¿™àϾýÚL|Çs˜íK]–Q!l!²üubûF¹¹–Û(ÕøÈ QÁ”Ž+5~Ǽ9HF–r9ÈD üðÀ•¯ïTÏev:â–€7²&ò¬¸Å8)Õc]-_¬¢Ì¥Å +¬4°êR ¼²™4‹¹Ó6 &\=Ó|}Ó;žíÁÕ„saÌŠ¼–.‚!ÛòB…\8Šô¤“¸ºžLó8ióqÄ>ï :=u•Û5·…„SPUµUbÖ•C1Å«yÆú¬w`$S‡ûÞ$7ì.Ù“ V'ØŒ,_û+Cæùȳð~ˆß2ÕuøŠöýGñA°½%ÿ3ž>‹Xå‰>‘æÝg8ò|—ÇXÇ{ËA¨c‘×ÚK3\ð\âð4þEÖ´Þêˆügöl»Ï88Zç`ëùIsJ?•ÜýsþâöümZÓèO³Óã)Ûòˆ³·ìeÈÖljö ÍJ÷ͱ†IíæCeë’œˆñbx•ÒþÞoO!â{Ÿ÷%’Àཤü{'êZíÀLãûˆM¾F‰K7Í[ôÙ‘'íöHºuä{‚AÇ~}%^l9fñëß»¨®Ä¼IëÜh< Ûî.¤­²ŒæŽæ9gö&d½ñ<‡¢3ˆ™Û:=:ˆ O]½?úÆÐh½¬“ }\Ÿ„4yÕ?ÝÑÕì¯uÕµþd&¼ó^/⃣•ø—³€N— Æuu+BU÷õ¼J^C³ºdÿôŒòê9H , æ V_«ƒäyùkøØ«$9ØÛÛ=ûa€Ù®°JÌåzó¾êjïuqÀû[e‘V, ˆ5Ç>̤Úš3ðXöÐÛzüb¼|Ï09¤\¡ƒ^y†uЖö´â06=FÔÿ)©ø#¥%Ø>N—ïaÈ]K³9.©î®àçPPô{š8k>5ÍIœÿ­:X,._àÓ÷²JQT°Í;”éjL9ìZŽ«‡&³†’7E‹DdÓ£ŸTÛÿá<ãÓ)À:‡ô=¼ÃH;t¶Ùj ¥Ñ Ûûࣨª¦${V;çêÀ“Fô/A..^îiC!fŪJ:Ùá0ê#Ò ‘\u d,5ë¡5QâLø£qßÏÜYŒ²?Xè­Q²­ýXØ,€\­à6›ùÙñpÍ×鼚pŽÆ¦ž·è<µ¯GjêxžŒ8ëë$¹N6¶w«ó›qM ÅLPò£qªH§«raƒš&þÚñâg¨ØõµjSý#2Á™5ylƒKÿƒ­>oL. ØG’Š›JÑ«7#¼«ûéMU©&‰­“Ð2%ãû\B cÄ&#.g'³„þÚÓ<¥,I¿É/ræ6{¤òUCÆŽÞó‘;Æ +x{m†Ã½¸ ,Âi#7ǹb„¢ ½ý*T¹Æbºe2U’šX¿) Sô¢t{yFüX×PŒ2v/äO*kþó–x<ϼ£¡þÆ~kŸ«ƒþmÑÉÙ'c|Û~Ÿ4õÒVd˜ƒ¨`ëÖÝÌi£ï¢½£¢¼”µóB¡.™i@7¤MŒê"ºU³ÿ"%7ÙwRâ^õd#é*ó>1 L¨l‡yèÕøä“ü“@z§O(g:\Y#A‰Wž`v)Ÿ‘„ôOð6öƒœÿ|š.íCÈl®¬57–‚Œ‰ÖúcÑ©ê6MéY(B \F£ ÇÞ³¨n·=ÝT´Šäç N ;Æ&óò7 ËxÌ+º;¾ä-BœÆ©äB’âAËC.K)|OÃA´ª?ï÷Ý{ äiáƒ=-¹ÀŃgØÊÑöÀf6È7ghb(¸$0Ëmõ,‘Xµâ½á{ûV±,Û,¯|æ€åËÂÃ~­é«Öj1É!u¯ÛöŸXDP ²xµö³¯O½ƒ:Ü/:¢”Æi T(¼1š¨9Çïn‚0ÍõÌÑHÏ4+Ô'vÞâHG|}fÎd£óç!X K¬‹¸Û{"’ˆ3ÏàD½qÁVlÍåÿ±R‡Áv¥Ë…Ps¸+•çïz¡»}Ô+(Xƒµޝû\ÃðñY6Àþžû0¡N45ù(mǼ>)Ä„¦ÍüÀ¸=ÝsNó½Ü¼ˆzuËZ×î×á@ý üvI7ƒý£»_ìÍŸ\ôq Ô5/ñ>ˆºÌÂ}ÊE¾ëZØj6IcR==,‡¢jH7g¡zI†&WÈË{ØP‹¹/ è솶ž‰n„ü[Ÿ\2Uy¿P<½éòt@¼ë¶!³O]ž Ñ%Np/À ™ ú·Á£?=Ø´`÷𹉣~½--£SoÊCZ'IDÆr·–»qW” VëXéEi¢ obƒ0˜^Cï~¹ov{Q—ÿ†/μpÝqÝÎóůOÈЬCoðÓ+åw"%òÜ„6››*ÚïYó6]<›Iý}4Yõ&Dºgé&ö+ø^z†Hbô6±"ÝÃkP»®ô:ìwé†ç:~¨é­(MØ+&8$ù|™Æ”ì©v'³†& m6³é”¡¯kñÌ^…HäõÄüd½òÈGëž«¸&¾8@ ×<8÷«Yby[™‡~­åµI *'<×7ØC#fé,Gލ§UH,d"»ÿ)é&ê&6ÄO<‚ò"&wÔ¥5ÙgÚŽ-žûeD¿i·´Þ«'¬ye/—*~æùÑ“‰ ·)dbÜýžè(j#ã·–# D ì²eä;µë—D¥ cÒ;Ïgeâ™þxÆ-i%`m¨°!þ–x‡ñ¯ï~­ÅWÆ1wþû/ìÂk n0Ûþ…IQás bñC°Îf”O‡ c´ï†k …PÐT¸%Ù蛤¯Ÿ™²-o5ƒ9Å*ƒ÷ ÷ñ÷?—±; u¬Êu‰‡ÕlÍp6ëg!^Vœ§[ø¥Bë+fU½®Þ 4œ¨†NX*Q+Тï$ª±µ0;h´i‹Qïç`ëÈöNŒœî‹‚ã£N­]uÉ0Uªþ…¶`¸ôú‰{#6èŠáöÞ“\A˜´i  ¹ÒÓi}§›v̯Éõä±øÝ.ÃY§UN&ÆSÊA«Ï¨Ä¡Â6v%ÏCr,—©IÁ³ˆyÄeì÷bú_ÄÕé€IǺD« «Q3¶w  ã\Ñ—ãèD6©–fé}Ðþv›ÓÅ 1 ǫħeNiù~ÚõêߟÕUí!iå!5Ñ»êG5-7P¸Í+«Æo¿³ íðk¼î%Ù^GgØÆ‹Õë ¬b'7•9«‘G§ ½Mži*ßYH hù2>TÏL/raµ­„ÆÆ±X£_¼³bòa´OŽ™‚¥N¤iÇ÷¦2sÑ¡©ë*ûšBß©B fmsöšJ‘~Ïìñlî©Ívþfq¸|vJè0‰siv¶okÕm­tY¦ò¡v5¾PRQçÂÚ»ÁÔ‘–ÞÈé|O‰k:'˜Ú†˜‰]ŒfÀ¹*Úé­H•6¯êÑâ’ o@ÁÝÞaK¶ë^žbqxWÒÀdFZìÚY…ŒéæK×XÎììc@Éb¥{8̾g2¯Â‡Ë8m'LÊžS(u±Ù ËOSÖ©ì,`¹[XMnð¥‹}6R-,jx-up…»ÖIy2w¥¨þ™)~š.¶î¦ =ÚŒÓfˆûrÿ1}¿ö­À~öDÍÀ#õ†˜½ÓKí—"Ä`Ü`èÁ‚ê—£P—(ÇÁ½óhßÓ­RPy úæBbx– El^ Ï$Jƺ±©Œ4qŠË«(*˜­izF¸^Ò©ùZL}£ßÕòNÏèi»òéRÏ—žSÑŸè†G0<~ï2ä<–Zîœß?ߘy—ýJX1åƒ}V`_Škk‘“PK?Òhy·‚ÜШÍ?ÙšVFò˜{0[fn¬:ÈI=v„˧Ö| ¨ùÚÍ:¸ºV_c!xª§^h»*y¥lÖ:'¦OtÂAbsœPtSÍ¢‰Ú¯ˆ¦U>îgê©oŽ·|Ž,ۿΓ3…¸íêcz _SWKNv¬ãå"3Ç0òÒM'ãbg>>¼B7Isx4,î Ç!½ž±;]„†@2®¬H¬3ãeâ>þÍIÏ׬§Ú€3†ß²e¼Á ÅV™C+ˆ Ž5Û£C€PÏ+J±§MùŠôÅ‘^ýÊ"|ÿžKhÔmÉd²Z7:§% Ø(ìÆÔñ»Ð'ƒ$R"b&BæÁk…ÍH áÈnUµ Ôó‚v)£yJá§Ámú5d·Œ÷ µäòÕJ*‹Ô*‹¶aC¹Çóáì_,ìHâ€,÷Ø(ÉuÃ!^&o~Só ¼{:ÚC\(üºICÈ€>HûòÛSÀæ-z^äN$(Õ8CÔC‚¹–¸Sªü`g¤Ïš–“ùvJë1J\ô›¥×jÙø»sŒã!Ûí ~K1žJI›‹ž´Ÿ<¾ÂH0`´ë#Ž&ž¬‡v&@ײç2øËÉîRØ—Þ[ú”¹g9—³“Laô0úG_µ¤Íý4Vûà‹ŠÏ¦Û ]É=8«kІ®Žn Xb¸k+ÓŠaݳ͉WX(B*@’˜;ÍZÞQlÃ;}­!YÒ¶‹$YÆI9å"JÑHüöšÝÂP4·®8qFèߢþ½ß’ À[ðrÁ |úf¡¨)ä'”pšV<½±„Âñ]JÖÿN§¬Í#/ïnâ¤Çð™ÎÖMw„“¼žò±­é«1%FgYúG dÞD‘C_b%óRRwl^©š©QJ›»õ'3~gøµvǾ» …²†Jµ—ŽåY¤·ÓrJEÍ}šÌç"¡x=¾vä×tý lî/µ@¾+P0‡ýk•·¶ýƒØñOÑ®~«ŸƒÐ!ÓýǰZ¬¹Ä“vºofgt!ôè{;ZY ÿKIÚãÇGî›ô'”(“§š° Ã#rï5´RéýDT(°böûä¸K(Wkó¼g‘<‡TLúÊ©ôɈVQh$¨Õ6ç Ožn§:œø© „<ëé,r½ÐÌ>î˜B~ø¸±†xå9 ôneÝNïÊr…Mªey—r¶þ– m£`‡Ã»æn¶5ÖëèJý…ìÈ‚?ý[ò9ˆ½®W`Gç3áéVKf|+·6à©Q]ÞéŸq×Vh%î~ˆìYݼ̻ùŒÔ‡Dp—ö¯dIoåÇÔ•x6››]ÞµÊЩCXñci¸Ã‹èé7Þ8Ýã·ýÉr ·£,Êu(åÉRD«z*{rŒÕmòëþ†‹áÂÇp¾Â޼Íp8ESuÉ7.ŠNú”M‚:s[°}= ã¸ù=Í:.ø¦ß5ú&E¦(¥þ¬è³hÝž½ò.CÂôfË# °°‰;©×–7Ð1Ó|ª„Ù/é?Kݺýß:^î%œìQ‹·@‚@¸!#pOw¾1e{™z4Ú,îÃ^ow×_’}Á/À°áž£¥R+çVj£=@Ùø ÇWAÕ–lˆ% ¶œyÌ}-íX_BçE¿x`„›Íú|îÅ?öé¸]­ ;‡>T´;7¦^ZßúóGç< Ë­È«ìËUÈ:çaejƒkú\Ó~²-ÓûßeIøˆf¨ ñ:syd ¦&lж«]yâ;Á1oœÇ€w«¡Ç²Xš#Ò?àhغ½m•žõC Qy~ççŠRmž¸<Ë¿s’ˆ°£¹ ãmʸ°¨Sº\Õï0l¤ݦªPËQ§(ŽƒÑ/ÕÙ´œHÁ¥Ÿ¦Þø{ÍùâAj7Àj/‘qó ·ô_ª›º~Žr¼1QÌ!cÀÏ¡;Ú§®¼ñ(E|:n$ ûA\7«¥R+Ò${Mz©ÛaF Z:ì–Ïnnò&€§Œ«sã×wŒ&‡©Uè¿ÅÓeôáàZ³/ÂÉ7°yOËF,\?ÂNºßœ^/‡Ë{$cb"†ã>Whܨ>*2KÎ@=é#[¸sÝàƒÀô¡ÆÉN\ç[²¢'Éó¸€ZH{hµÛ“š.©Ûf«\ÉÛ ¦[ÈA‹?ƒ¤ sg³ 3hQ‚-š©"Su)4X7ûf·Ó /à:vzDï~è¿T£û:­hÆZ< %ùs¥ß¬"üžޤè 4%â”iÁ `þÑþs‰ÔìxÅåžm ›<µèeŒh—®»üóZ0²ÜCa&?#ì9WI¯é½÷Œ3ÉÓE{]æ–°Ût`kò4xòÕö[ü£Ç ZBpæ)ª Ùï*ÿØÛk« Ð(k2ÙwÕ»yÅ çq™ã ¨…ŒùÕnä¦MÎXPs]!¶2{Ž‘I Ùà`C¾íÄõwÊc²×˜k½!)¨ßEü<=ºŽkýåäú}–4â§àIøÆ:C°Ù4J@¬é÷)B±àø"”&1 2ST û¡ ¥W¡°ÌBýíÆ‹Y:¢Åši.ÓQur9Xº ¿—CæðÜÊ/µK›Ÿceõ× ›çš%ÁÐø cn½‚ÂÜÇh”²%|p“ÙVÈÔm= sÍ…(WñžUtØ>ŸÑsцlmÁÂÏ·XJ>ôgE\fÄ7a˜mzÝÉ—±±DìDä_°öýgÜ6îGXÅ÷'ãA¡ ûÁ¦£0ùCÃÛ@NðèྚüQR@}âíó_n µ„æaF—›Õî1uÖ÷`»ïð"p^DÈôH AèO†q.öK›‡Z|úœ¸Èƒæ—‡Ö,fÖX.Ð,’Ñ¡>†3 *|¤9ä—¥gÃZåŸ>> UTÏ¿(==4\Ûªôš™÷$¦ò²*[–(ßQ4±&kè—‚ÉLx›ŸãßUbìlÈÞɧÎ(´ ‰R F>¬OHT€LÛ!0^úáJƒ%Kæªs7’—ºHñ³Ð)öiˆÔ£í ÈÚ;˜ R¦ánËÓ„u¾€˜úÈD@!‹×£[Œ–g[úÊ_6†ŠÓÛ‹ Ž •9W»Þ“W‚JõÖÄ/¡]‚ǰþÌ $[»DSåTeI#3jýÚ‹†mŸlT33®éÀ¯šiÕ$¨ôÇUå'%'Óñ™ ×±ÙÀß»+]Ó¨sôÿ¾áÝV—I²RÇY?µâšo†Ô qüˆ•޲ÏÖò -1ˆÇ[ë6F/Ç»ËENö÷äOm¶âŸùà¼4ØC(£Œªƒ—±å¶C*ú3 ZŸ\çrš„RIÏ\Ÿnƒ½44¶·Äi„“DÝ5«[Ý .×+ßâäx}GÈoá+R¬Óý[-œüM“MN;Ã8òk>²/æJăÿg£ Ýt¢~IfOâè;1ˆ ¾ˆŠåX"^Lo˜˜Šcí1ž'`¢ˆ2)§…£I©TeB9ôT}²”h°9®l"¢D‹×¬|‰3w–xàEïò—ˆŠœMZCìèzà uªPR¢šCr/ȺÃ1v曲6wA  ôƒ'ÏÖ[XèË籪ƒ-jÑ£ÈcÊ#Í5MƒVX<È~0‚Bö¦ÎýP0[PDÌ8îí¾Yˆ¨¹ÈÌöïbÕù©z!&È´inP 4ýà¥1‰[Ø“« °èó¡Ôt."€Yƒ~hÕ‡8 O|ÄÕá`ÖÛð?/«'g¦{ÊÏ7 㔃vYáÕè~»øµœî¯–ïHeÃXº¿«ÀCù‚U»Bb—#xºæ2ä„Tˆ“xÓp™ÑAä‹Ê}‰ñý‹Y¡(O'=O2æ!tŠ­cŸc‡ˆÖlÕgEßÓ ‘=p@±':çeö£Þ ¿øûŽæœ{R ¿å§ö™ÝW…A¨UÕD³‚©?\ó4ÎROp‡ŒqÞÖn„205þHgC’úxôp»CFsX¹žÆÀ̾z­v÷ÞÇ8çÝÛl‰ ¶÷6¢‚ 6æJëú¶oAe+Pj»ÊYtSØ•I‡~³ˆ‰-åTµ(ÅÀ²¤“Ù¯ÖëêGjÓø¶Dt¾mç®ïþ†¢@DŠu›ÿ£¹} É8qÛIíÚºzd 2‰é»VýaÇ#Á3«ˆ±‡Á ¸ÿAÊ‘(ä Gx™ Hèãv‰1óù³jóKª¢úóëq ‘r湞T<©‡ „ì36¤ÓØž@M$Äñw=¦§ºFZôűßpÌúo˜™ìñx¼•°£3µiz<¤yƒŸuÓÚþí¾wP ¸CÚE£¢ýGaÁê åÈx÷/tCŽïvðp/r?⤟Kw¹ uê¯jöë[¹\`¹’Uê¤]ôSÍiðè3áå»í¶Ûè:ÎÅÎÃh©ÉóýFç¹íü4i‘’0T]3ÿ±Æq0Ç™ôŒ:Ô:àD‚Q§{*ÅOŒ‚Ïeje~D&^Ьé¤Ü²íùÎøÜ‰\Mà‡©ótó¢‰Ïíó †¼ƒAѤÃiG—kQÑH£ÔJ6L“ý0+"ng^ŒZ”[ö¯¼¾XÔ÷™7*å¡›@µ²"MCSÓeǽ¾ý̪G*á^ëì‹EP'yîpŸw¿ЏÆ.;=•!˜ˆcÕ¶×ÎKÅbÄ”±±/ 4ɸëøAêÔÓlŠ>x…g¡Òj$Øž°­îH{¤{÷ò ÖTf…I­Ðƒ †‚>yR¡?ºW•øln€7+w+¦ý¿•Õâ„Çtr=¯ž¶èïŽ`5¹è´<_$™A:Îl±ëÆ(g/bú6º¥¨ÿ°Ø °ê'4DŠ"h;ç ¯âáÞÄöéôY3ý&e)ï¢`›Xì´ßøºlhw#ï;P—VA™ Z>°y¾x6•"ħŒyÄñݨ<@;€7º©j¨§XÌ ŠT,§)Ä5”T¬9]i·k=QS0,êJ= X²!­æ‡¹îd/Ñ~êv“GÔ7U¥m‡”°~Ëìy\ßON#çÐéC®±»>Þû(”ÏEY/éUšúÞóB£Å^PTÚc"ª› Ý@[G¸µ´…$ù ³€/Á9CQG˜f5¬“‡y]+ÿÆOò°‘\BüLÞ9ÿŸA› deukiv|¾~eåÉ¢ËÓ`Ã:¹¦á³ê¨e TÇÜ3³ÂÝQcM˜w„ó~'Fcø‰‘w¹×E¢ç„ôøÂÁö®¶J”¬÷Zð[ÚÈKçŠïÖx(•OòL)¨B{ãÎY™iŒÊ*U>7‚ˆm »žî°º*qé¹\ý¨õ]ÓO“4Á¨õŠ*ËÈÚLfnYÚ¼w<ÑÁFqa2»ˆk½Þ,Ãa·*èû8Âè‹øM«Ú›7&·ù+Ä/ǧ‚Iï´p¤S:Æ«ÓdœÏºT¥; Ñ¤CbÍ^hØÜЍÁŠÞi|á•Ç>°íÔí•}ô•bcʳ•”•{^H<{™¬.{}HÉq¯´Ê28ú‚Ña~~Ýõò¬Vi©n»+ÑJùF #Ý¿v¥••Ú˜rYìÞ˜«>¯ÈËEçwÜ'̹ƒ€…[ÊáX´Ân ÐZ_7kÔÔqu0#1̼­3¿K!-Bªl#bŠÈaìò3’XöŠ lwa¯?Ma(+Ù—nê4.#Ò 2Më¼_îÙó\˜Ì¨ûõödZ÷ÙдBˆñeà{ÃkÞ9ÿ4¥îÃþU+¶%M:lC-oZægVÚ†Á®2Ïo ­»Ô÷8+O£ûùqs_Ma÷4¼\c(ÚÏ'Àuá¨ËrçòÌh· ¶é²¹˜wi½B ¨”Y0$Ý0EÚöõþi5â6²Oé`¯tn,›º°}ÄFGøÿa.«r˜Zraƒª@ÀVîýͬ¥N›c«¢4÷Ö×ÉŸfBeõÉÉ ~RaVK*F’ Òú;|.åÃ| „)¸ž4îKTBÝZ8Û–ººÀ?õþ.ß3.8ÉöðýÜçéé,Sïõ¨ 3SÛ0Ö©qlS\5äxæˆÌEiL2Ü@Ÿ# 2Ñ©š€ õõbhËY¥vu ¾ ™®öd´±‰>W!!®“u0lfœì3¤oìX†`FÑjðÈEïbT÷’ÓÄwG•ÇÝû5Í(Žn<|ó¹1½Žï¶(r1ÖÙˆkG™|B'·ùÀÛõØLâA6ëèfz1Ÿ°qÞ_<KŽ©Î”Š [֌€€j˜âL³øEÒ%å>œ<Õ'@{_ä7Z¨†õ…ÝC®¨×¯œÎž|«×”ú8X,ÕüߨٔÈo’؂éûejhª2Ts3 ]k tèˆ-|FvßR¯¢1ÑVèwŠÝùSxå³ïÊQ…·ZeM£®SÿT"©ðŒ)òñY¡:ÉL¼í{ n"¤›v.ruôÇj¹- ¶IþÞ0.ê9ÇŽ²ñùAv_[/­XIøYMÇi*²ˆVÝ!î± ˆohè½*acR~"— í¨#ˆCm{Ú䃵œà||ÂÙ'{žå+Ò&žÃuÁØÇxȘ诔í-C½ð\î¬"®ÎªÑq¸‘û´-f¦™èÆ‹.HéÉ[ÔR†Ä‡¥BÙóZu8}—gY¾ŠB•âëöËt){«Nºc˜âÊsgÆm23·&7§¨ªæ>®¡Ö‹L´ÊÉ*_ˆÛ´jÍ:3ä¬_tÁ‡;ˆ‰¡<ò<Ìcs~Ìo mÔ*f[=²(&»üÞ׎Q÷ë³ØÙ¢k“Â%‚B`Tø•<›½Í´øÚ½T+šôõ„¨gŸ$lŒgâñGö¿¨j¹¾&sÓ$<åû)é`³2“ªÊ[à«Ò{zk©¢;2ŠH¢ƒÑù3Å(”¸Þ·äsìï-/±P—ÑÖG¼¼\?9:ºÃ梥 ðúÍËv` Ý ¨`üíI1f­²BÑ ƒûžb¦çÚ®pÈ?㈹g0öа¸=ÍjüÂÛJ-2Oî·Wz•]1æÏ˲j'iª nL¡†â#Äé7.’a ±eÁßük®/ ’Q tFSè#wéë"/ ,‘‚ÿú˜àü~•gôÙÿ¼õHã½;I€Ì}›­¶cÂÀ—TvᤖÂOlH ¨Ç•Ž©ÑÓ˜$u é1®Ú$W‚7“S-v}‡Aï,¢%$UÐeG75œ¹×XÒ¿>«m|ÇŒ›ÝSXIµ 9tE@{X•§KøvÔFRnéŒf„G­-‘ñÄ]©Kë¯ÐÉÛ°rë®á™U_w(W ³±i§b,òêz t A³ DwhåÖÉØáû²ZÀð— Ì–9»©rL5`ïi™4û]ÃT}¢¯û“ íVDòž°R¶bÅoÊÏ 4¨”Eù0%ìÍÌÕ#ýˆ¶z¹ÈUÉ16ZÆ .mû–‡ p’é±ÕXÝQÓVFUo^fê´|wP‘ÙÈR'üxu‚k£bA†ÓŽ„“yÍ$¤Ú™‘¾tñé'Í82G?%¬>Ä—x~2Q‘ C4åµ;°]y<ï¼Ê\—À4U×îúøLª9 šDýû 8°¦Hì¨:lîBZ9ƒ†ãòAuÎ5¯vÏàVŠ=õå^õ|¥þzíÜÎX^×[ôup%tâ=óE÷al5} Õ™qÐS\ùŠ ÄFõ€Œ–úÁõ×Hîõ''HtàÄŽ¬ ç‘;ŽøZPÜ~î¯.šCÖèß3OÄÚ‰é·ÀuõÀ̵LÒQ¿8Á9fµ•œüSØÎc÷“°‹vÂÚ•µö¢XÈ!çóª×H׬ñ±º2ájœ 6,B1ØõÿôM?ྙc¿$‚{F@ªÂé2‡Ñ«|ÚâÞH §¸''!ÏÈ‘òE8<)a ´a÷´£ŠÎ{‰Ã…V0oÚŠ¾µè]~5q™‡–Rº"ňŸÒ üØtzÅl§U†ðoË_£JtNþ4.•øÑð©Ù9 :`á+]9l€<ÙC`Á9©guäÖ#®Íx@qp(׀ȽÉãåƒL2áv–_›3Q£v„"dôÚ‡(osߺЦ÷îô³Ÿûœ¡v²”Í ªÒä0ˆI^ ¿±Q%L¿qFUô5Þ^©ŠèÆŠ—Æp‡‡ö’)ꆃØIuâƒìYµ]…ñ|ôU–!¿¿.Z¸ ï}žûÄè ãED%òWqßËu©‘gÁ\ ‹*%•í´m@4Re|Ò½üx»Áršé}e#(xÁFÓnÁs·7umç«\Æ—ß¡¥0‚ô‘5´· ¤œÕý FËÖÆàJ‚÷I-z_4¬.sJ=÷èÀQÁÛ”?eP¶{äÊBÙ>&$ÂóÝoésc JñCâ›S ýd³åZ!^Ÿt ÝXêªô汧ß#öèÅŽãá.a¥úZ ‘Ñb¿ßy¸ãv5IÓ{Mmò—½JBdŽq C&²¿†ËO6=t²>¬µ6œÏ/T=ÐÎÊ PÍÀBî\îT4=ë†}R0n¨ß‡€¶bPÚ€¯°ö_¾ìP!%Ð^$ÌhßuĬêø--®q—£Dÿ<$ZˆÉ…ýh¢,_à‘™îrI³7ôÛ"²ÀK$F öqLÌ‚ʘ„á£~Ä!{3öìžf&áÛ/Ñ>Ç'âvK‹ßœÛ BÄh°¦Æb9ˆg|JªóEF½¶‚ªÈYžÒúó"MhÐ.'ý!€©½'<ùx‹Â7ek¥¢@yZåƒBPxEe»<²DêVkgÄA¡£þ†¯rµW¨§4*iAçìÖEJœéÓ´Å:&1! “°¦i˜Œ^­Ë’XgŸÊ⻦ÑÝá±íÞ4ˆ¿:Ó=ˆà›ùÌ€>}ýÆí7ä;J”´M»Û"°eVa‘²©Wó{!¢c¢ àÏÅ ÅÞÕCÝM"Çkä²Á`|­ˆ¡û°Ðý{¥µÏ^ r|áÔøúrï€zxÈ,á*ɪï®Ù]YÐ*I­Eí#‰q=Qõg„Š0§ihý;‘ŠñÁEÙxq7ôQ>ç«y„]}L;±¸…[# †nmS›pØäý©„g ð=‘ÀÁ¥bË … kàÐÓrqì™y„Ùû¥ÞÔãö/ ¨IÚþ…,ìiª-†¹4Ò1³4Â4;X`1„På`¥Šž¢e»ì«hôÓwØhY6«Ö]7”1Ñ"Ákæ ´ŠŒäó‹Ae&¤“»º;ùìs¿ì¦ø•U)ð2]·Ç@SÃ0c Ù>õü¦HT#Æ›JXè!OÂ’Ïs„éŠò5#šzU‚B).òý*€T_z³nã›Å‚´aN4Ó+¢êË2;‚gee2Ë:R†£ ëÝN3^{P•—cßÈ_®/*¬Ô€—+zÀ¸üvËñ®üÖ(<ô1šTiñ¶÷9}:¦çÚ¥#º^d~‡7v'sq4ìõÙ)k­_@”`qƒxï|ßp0&2¹iŽžlq°ð/?Uä‹÷L}Ž÷½Bsc ”å04øÞ§u2!á¶cs¢¤Íõ+zæõÇwyì\ÞKÈmº×`f“:äH¨Ô «P˜ågÍL¦±ú/¯Ù='°ç¦…ÑA¼éOZ®ëq~ˆšfjÑñ³ Eh l憡ðˆìfµ‘@L®ÈàM'Wa©ãtŸ‹îp\îÓð¹·?9Ü‘tä]ãßîáö¿¢åUÇ <áÍV3õðJ¤iGÂú5”·YŸOÆõŠV—–Ðj=4j¾ÇÞÉ­W—}Ò#€ó ©;¨ w/ñ×Ïw½ù™? >h}˜ÿÄ0 òáða¬“eú:œ1Eé`¨á*þûQ“p>T (Žðyàdå"C BƒïÁól÷¡C»»û#Þ%¥¥Ð]—]Vn§š…È;÷¡º‰êIõÓEß3™ŒpÚ¨Lˆ—”—x85£+JFî°Û¦7Ñg ]¹úÓ$¸˜Ñ6Ã)èÞt²ûF}/ÁØ{ïÒþ0¢b ‚$‚³1tϼXÊaÈóˆrß(i‚{´ý©gì½ó$;©ñnŒÌ—-v 'r>hþ¥ÝäLÛÚj(ÇSJð#ªöº@^(Ûš%¹•/~,²H¿ÃÍþÒ«Çò= rQßv¯MË6B¿sæ«”¬ŽÖVpÔê* ìÏÜ¿¢ÖðÇÖöÄ_޹S Õ¾ŽÂNˆˆ=A¤ç5&Ÿ%ˆ™ÁªK‡ÁCÿLªLEý¦²> a õÄðèÔ´VÏrþzÇšš¨ØÔ!KªŒ¶ˆêÄ‚zW>ëò='¨¿&Nœ–¨$$ÔšÞâVnI áÇÈ¥ØhP-Œ>®œ_Œáç—yà °å¨Jp+ÉÌø{aâ ,pFô€<·/ × vrжh©2äçXàŸÂóZ¥ü3fY>%’¿ÍjAÛâ·Ã¹Ó”W¡§üMß÷ÀIäKj¶Ö‘¨]Oxï>˜à iõ¨š ¦Ý£íè“Æ]»Ã8¥<ÜE-œ4•IüO½n õM:I›nH— Ëùi¬ààx>²¡e£Wô¯ÑA—& A¿%†°ª¡%G¡_£Šç –ó7OŠè©!D7[Ä4¥ù²‰þ =ñƒ_»­ÛÊ4*þjsþiLÉ «'¸ajm­¡" "êSCß¾/ó-¡Lp!sb6P¦s”úÉ ¤Q;Nú`F†›$¢ºŸ5;‰ßšôòÅ0AºŒ&ᥒÐ(ë¥OL£بØk”æõ šzŸ²¥œÂ£Cìl$*°ÀŒ;}EØò|FL”pŠ4¨#'wÇø¬ôšsbR1’ªnŒŽ¾ÇVúçD glÝ{àÊ—Ú¸ý§˜üDƒîiL³”èšp>ia‚³§+³š5~’Dlþ0 åNÓc‘ “Ïmßím–9§–”s;>z½“¯ë+c…h{Ž<Õ`[³3U+þÞÜ !ýå“€9û7x ŽÍ¢G^Êùó‹b&ã2 Ñ/hb™ñ0ôÞ“ëNTXßic Ó ´­cëÇ­ayû…wìY¬ (ØbGpá-÷óH{ƒIIGOÀnt8@ŽB¢ %WàÞõlRWoyOuŒõßE‰ªlsÜ|¬M8¬d`ðßâ®k”ñ°ô@’Ú°§žêÒžXe_i¥u÷vÿëÛ‘·+ ¯”ßI‹aƒ-BuÁ ¿3áÆáŸ¸”ŸÕÀeQ Á€‘ŒYLN¿«@*‘ ?rØ÷j£ãÉTvXE{Û·þÈÁáX]éè˜^¿åƒdÜ)¼aànÄ6ÞSÉ|åa!UœÜ˜7%›d"öõ_ó²´Qz]y¤{\'±5¤wF¤Ö×~Ùä'”i©‰ìÞ< Q´ÜßêJb«Wönt{‹)QKù¿z½ÜÍÍG'0¢ãcIÑïEMx·bá’Qæ÷±ß{É\ôü Â~m¬¨Ë5ºC.7¶¹¯ú¥0æKÁßåºåðp«l«µÿºÞýÜ!®³“çÝ aºîý0Ïæ…Þ̳ ×_¤V§¤©’þÁ…_ªãຂÒÈ•-BO~«ƒ´¯Ž9‰€ÇÆÜíDˆý‰"¤zÑú bxËR ƒÌgAÞ€>[n±çõQz†cüòéǹÏ7Dëþº“_àwš‰{f î„ó‹Tÿár¼“,ÇÏËâ.N¹G…hCÉFrÆVáÞF×@e¼Æ:b&,\ÿÛÜDXJè«sæ…µqH_í0@ž¨sñlñW껓u{I·o*(ú÷ÎðâêFùtÒB¿ ÚÌDœÁ_;׊}M”‰3ø…$Y/ƒfØG9Õ+û,ƒá<¶š¨0tæ&0… µ¬ø†:ѶœLFô˜šC*n›`Ä9{ˆ7óªU¥r7;6¥këä–Ðä44yúÒçòHUª"ƉîsžÀÀË@%÷*}ºTšXŸ¯§[ t.–ê ±ÆÂEá ”Ð¥È|5Ê= åàw{R(öÁîˆQî”Ü_Z±¦õ§fgÀ›ó!ÓÆá±› ¬š>¡ÔkúŸÑsb‚#H«í*ü÷ãGF=Ôm¿Çxct³«ÛÙ¶nì`ÎÒ†tBõþDQK3ì£Þ¾°–LaP«½[:Kˆ¸òi®’Ýr$ˆlÔïl¶‡-å ØYsàk½ MÒ+8¶.¢/¬áÑyÎEMÿ“bB9Uë©“Yz†o(›u¶Æ#ÝÀâJá S$Äó8p¾\Mªã¹kŒzår¯>©+a|˜ó=Oªá¿yÕ¸qÒ«kœˆ¥+ÅùgM(oÐߥ»1?1¼G0¶b±ó³86ÍÌ‚—HVÓrç,~õ©Ÿº€ðâA(àZ\mÚÉGP¶ó“ã ê*÷Ñå앺mÛ£“ÛúŒ<“ÛæìðÌŠÆM­Š´ZƒŒ)‡bÂåøJ5ÃeQYåfN+ñƒ™ìh=OšR±sÌÅaZÐÒl¤‹æü„Ë…ÿKUû1ŸÞÔ÷ÊÊó8ôjuêR0å îsæÐ¤‰˜R® 3±H½®Œ-‹ƒŒü¨:D_ €Zé`Ðl‡fæú„ÀdOç¼O[`T/º;«ºÉ;a©8ö‚XG¬«Ý! ƒD Ç,ž›ã±¥ò>¯2ì£Ä@Vm„Ý_R](ª -€.L½LŒé c—KšÛõ@â¨ù%>l·C6V¸~ º ¼ÞGê•J×Ð4t¦¨-¯^½øÎì6Ñí¾5n§8Uý¢-é`„×W÷ tË„‘.BÆK‘ÿµ6[¹ºy|h ©Lò>‘¢(²ò•Ù¸þÑg¦“øßåPšç=¢ëò4“m?VæÏx 7Î9öy=O¤e ‹y6‰ì®õaµÚ¹M®¹"2"¨2åêç[ÍY çEõlY­*׆Ÿ™@ïC×4(HöÔ¬+?ïŸã’¦+¾ý¼àyGA ¬g·Ð 45,hØ[¶›v'˜bäÚø}5&R£Âƒ©>©ùsãôåñ¡N¿‚}Ê8Ëù¤Lr3‹30“p`vÖ/L@‡ÛýkÅ~.…“·¬5“˜­¿¢ò¦™ #pÆMÞY“å¹HÜ…E ·,î¡|ô©>Mí`I!±æÕ¸(Œ§P›[<óÿs¼y‰v¿S‡}€Y#$˜ƒ–ß;.ðž™â“í`!e,±×)ó_¢…i§ƒœ+~ÜÕi!»‘…_ °ÞŸ™©Ž‹åÿÍ¥üÌÜ–1Ч %þô#U›ˆYn4´S‚1ku8yMAM³¼îî÷Šã§±59é!ÏXzÇ)gƒ:¦ÀÈ—]vOöjÈЃTm9…h(Þw“p„ÀI§†gœû[iÈ4^±› ™6àp¥L²ôའH @Ù¢3pBïø|™–j¿ÏV|÷tP3é†<$£ ª5££‰0±žcÄÖîʸèiÀÁÕI™2=‹OøšŽì9  ËniLÑÛŒ÷NsèÂñyÓZ6€ë~8¾$I2v%µ’OSpéÁ? fˆÉOöñ©qÆ•˜‰3Åć^KƒÃü¿ÒCe¡Ñ›ãˆ» FpIyœ#ô>®,øò#äw«qŽ\±+‡‰¨¢gÁî¦ÔX.ñú…íYK8dÊw”Tʹwê¦ßåjà¬<ô—üü¹>7 #±äo7t4â.É1©õ‡æ»ÉWãvA'ìÅÍMñ)L]S¶Ÿ—õ!iuô eF©ÙbÆ~¼zƒ®ßA~ t%$çúïxµ{tÜMK‚ž²éãÔ;1ºC~)XzEº×âN+ú Z{ª¸-2—ÉÎÜ ùa8únìü/Óy„¶´JÕ›àQÀ¹K°ËÂÇPR ¾ ¿Í˜xýq`øf IÁëÔ»¿hîÞ{Œä¡‡‰¶Q oníï\òŠáÉtUZÍÑD¦)Síךqq®k|k9Eõ‰Šú0.Ççq>†Ú¼-ÖKßÃ$IO´É¢g‰è`O¾pˆ%Ǻ™6Ňà <–¿ùñÖæ7wöÒš4‹ÙOª¿|9—F—uŽ ’QÝLh"o&|¤À霡G½Þl!>؃Á´Æù‚V¶n`Ší±± ô>kϨ°‰ÙJÂ@ø8"½N[.¸B[$yü«üÎBø/' ÌELà¢'h(L¤V­ÿ\Ñê­ìCžáÄgðZßI i·þlÉÏ ”Ê‹:nQ¢ëóq'ähò“ÏFÑ$¾†dþ¦q=Mîî>Òe*œóÞä*•FÞ^­/ɺ½øR4»b>Œuܸ޲FCDžr˜SŸ0ºßîMù—c>SH Ù’øu1VÃ1AAè…·†£ÕÐŬ!n¦}:[Ù)è=ù¶óŒ[¤<Ïk /]ã4>¦+s“#ˆPFjæcbOÂnˆuŠÀ˜µj‡¦”wfŽÓé’VÜÐ4§îºTí¹C²ºOœø{ϪdKÆÝŽîI°;ìš&7J(KµX>Z·XQÞU‡[`šNè*8˧$×Lr%ÿÒ9?~û‹Ürv¼‘7µåÚ|ö>®Þ¾Õ1s¢ST—üo¯ðv]õ_è6lúaMŸ´€>¯t’ ¯¸˜‰)muP&^ßO”îTL–ØsJ8€h‰®¬ÅB7ù˜†ŒÊã2(áæâFRU:á4%´öÉ/ȰT¿fúßø(Ù{$Ù>-lZhJT–!B›öìù°IÎ \سäÈQØyØ ˜9uó$Môÿn, |é8Jôºz,@=å¦Ò<ñT¿;0"eëø™DáX Ÿðw"7¿€ÖÝÊ#ÄBü`/tT¶îÞ¯ìs¸óAšùïñ ì¨6÷a¬û‘Dé*”mú­•î 4n»¸™ñ÷°›i¶¡g¼8}®]£ˆw’M]´j6Å@ü5•Y|:Íå₟×EÈK)«0–mYOêo.ÐÈSïŸ —–ßÃí@Òñ%{wkG.L_Í͵nÓ­ËS ¤¥ðk…¡Pz<ŠË×þ9ð.a@Ò@Oâœä•-^P±«4ùm¹ð1ÄõÓ·G ”bEH\V2†+ÇüNÞ@-L3V~óÄàO7u¨ÙÔjPÁ&Ýz“·M¯Ì3ÚÝÆM*Œ™ßp'ì.ÈÚ€ ,š¾SÅDÞÚ¿Ü ˜G|$'û(Šmõ&ÕÆjŸ®Àz |Ï–š¨7œ:­ò:¹Ühzʘ›øo$ò?m”i­U·^1¯^JTH·,÷oë3Ùœ™d„DƒðàÆu€6U™Ý0!ÃoÚíih¸xlnÂÍ—UEÊNÒ^°–£,WSg  ˆ•›*,ƯÂþÚÖÆ—ó#ÀGæ„nÀŠvê\ “ærpQ#B‚ÿê˜rpk) Œž©%¯íœš,¾ÛßE'”¨`®œÊ­30@ÅŽô8?혇єÁ ·SˆýÅDa™:§(W'´0·z‘TÂäö'lþÖbÑœ!‚LʬàÚÚ7alÀ‡Û¨…NJraÿHÔ΃éÕ@ÅÇðfþøŸ–Xo¨‹qï„,ëkÒòsÙ>_+’è °úÇrÁ.ù8JðV,…iLûÝ¿ÛË” Ð!=à[ýp@Ö‘!ˆ ©ÈŸìì–hÇ/Ö¤Ê÷f™Ëœ+Cý B«­ëˆÝâu¨òâŸþWöË ·+ÂnðìÝ)þš$0TŸá«å‹Æ){ýRéœt>ýƒ·æ#RUó¹xAƒT³ÉÔîßé½ÍšµËOáÄ÷¥;ŽÂýÇaN#÷Ó/±T9†€Gér/wóœ)êo‚QÔU¤àUã7ûYL(?’pªL•ÊXÆ-^°\O莖[ªš%ZSƒZ0v€uÚ®0ŒPE|Z²Ê‡Kú€„ÂJ,D"d‚Ére^ËhhiæÚd´Îbžƒ½±½§Ó4†WII…R¥–$/™å”¦9Ýx‹b·2É:ÖÕ%#äØlln]1­xk!FŒ/µi½@T­%:\2WÙ²n5PÏé.±­¸â‘¹+?±iÝ¢žwùAžN˜fgRìûäbáG‚餖¹ü›8aÓÏax%ðY—üS‡“ÃßcM8Ÿ}ª5è/GÊ@|c…q¸¼¡›-i|uÎ+aqê 9€[CJ° Éð™ ?-—Ï`sRFïÑ@B»Îip°Ö^ÂÏ#„FÏwïœxhNÓŒ2)ËND˜³Ÿ’+ÎŒ)~NÚÝÜÉÞˆô¹Æ$:{\Q`&–\ª¬(kèžʲ,X¡gŽ©6ö€NxÚêüôPØKЧ¡ƒ;ËCÞ²SƒAúMe ¨€ëÄ̾ׯGDŒo4ƨíF0¥Š,rtCJ98á— Ž£Í@ǸûD X™bj¶Ç+à—‡I7]’ª3X7®(nÂU9•Eâ øzsQòn™ÎÁËÊK EÙZÌR©¾…¸L¸2x/Ű²+pÎúW6bŸ@K\ù “ù~®Tr¡ f€[æ$ù`ö>þ/ÃaáêE2™I=1,v"!™d§ 5-ËÐ{s7Üü@_Þ&ê·.B˜E¶xMx¤$L«'Â/sQú†&ÇöúbŠTâºZ¡n-l5¨±%g)5H+g¤-’]ƒRIŽÝI:íÊïÖ¶B#ŽëÕU*¥ )·:‹ªÊõzAýêmÉ€¸z^¾õi¬ÒÈøêù¹µÌ[YûÔò‘à»y$Q6ƒhl,#•8úž]ËW<áªÕ¨_qv0tËtI#ã]¥«ÈtïažÜÌ^ŸÛÀõÓw¡€§H„Lj]Û÷Û1ûºQCĨ1Ð?Ëü\³XˆÕ³ Ôå[ܰ `Ô‰’gØ1lX—²<Kײ ̈ëɹFÙÉ 7Ÿ.™ƒ¤EË=s5xØ@òç"Ëq1ª«˜ö©&È´V0›*†-x‰Å¤æqÇ*ºa§íÖÐÊTC†Ò #kCl¬¼¶#sî­¹APw!G8P…i&2Êì×°‘R÷íVÛú¡ù$ëÆ ÷³Bböõ¯Çò‚·&ôÆ‘› ZÔ/œÂKŸí¥±ÚðIdjxÂc³õ‘Nk-îØ¼sX-›µŸ÷lN½e˜fl\>|®Øl…µ9ú(çw”år5 +;¯ßˆY “X*f% ¤^œ:j ±¿4¶R!èPGe;ÿ®æ§±éeö½rPx©úÛ¶˜|N4ǰª²íQÐàà[¶®ýÀ¾óoî5kG^…k U"32ŽÏÄk¾3øúûŸ!>§}XÚ ónËî >ØãŽ(±Ùuª­Ò={w§ ½E…å!sàßî9¾ÜÓwËíñ Îæ•nÏAÓ©,u<Ó5` h‹q£VžI^¨Ø«ØÄmfiDÍD5î?„óÒFlj•{ ¦môø\Àý6ÆEËt–õûH.MÔ}—°Ûñâã;‡§äoß«XB‡Éy&C ½0/üËåçFçI‡“÷+ÑR„;l…4wU9ì´\³Yâ Üs^g¸d+±»ÜÙ³®.@Ÿ…ÒS¾_B·H:ê1¿1 P”“ôQ[å¬võàJj1?fÀÝÙúöa2}jj¬¶U¿@¿ÇÜÆDô ?a·‘b­æ9ªÕâ’ît/å7¬’â5/ZÏGKþ‡çO™WEu+¤§aß¶ôñ ¨ƒË FèËk .лU|Z´€°4\÷ØE—1CÆÇ_¼˜Š Ù9S"|åzVV&ÓÏñH”ûµ ”-Yn¦?³íreu" ry` ¨ ß‹Kx$:ÆDU!øÀ¦OÝÛkú:Žþ©¤rÑØ¸ ~ùV  b³Pm}„îa çËå/¯ãfÂmµô.{@Tbz’ܪzºS:8rïÓÿíÒQ‘­”#çÕÕõ:„)üXå¯õi›”¯áe¹wòÏÉe¯NV'úˆôkhNØ@Å¥_¦Ê6©`!C‰ÅÜÇkÅ·n0tAÿ!€ðÞ7(¥}\þª‡þ>îfEÝn W²(ý‚̯Pi«É{¶ö«Ø€îŠ|ƒµ ô N»zݧ+Î-æþWÅžÕ-ùFÛ‰÷?³û½CFY* Û)©¸6J$.,Þ4öÞöàO<³âª:äÃÜ®'ꉥÚYAëgIæÁ%h#b=ùÃЈï/@©¬ì©#ûùË£_|g@ÝÕ;šp.ÆmK°¨‹Ränú¦²—±œ«óª&žÄ]]-Õ[Ë’¾%W1Òacìù¸5më˜ )õUÑw%g€6Hñ°d‡+u6${ª†“•¤RÒ¿ ´õj«<ñ±˜¦:ƒxèÃ>Jèf ”`®å­ZžÍ÷—o3T˜Ó`üI’/¡Î÷xÌ×Ú”Îq€ÙíÕ‰MN[È$I ÒÉÑàÂfÄ4eŒa‚ø±öfÙSû<\¶ÜY‚siýõ8>Õ'Ië'È?IFê°Äkîÿ I··âý=õÅa0 ½æcõ[iui Öm= Q~4—ýè t .$gø¸KÎóE‘?ë}S·@áô£I‚#~Èl*F¿[9ÀÉíðŽ endstream endobj 336 0 obj << /Type /FontDescriptor /FontName /VDRGEW+Iwona-Bold /Flags 4 /FontBBox [-226 -2960 1456 1099] /Ascent 700 /CapHeight 700 /Descent -230 /ItalicAngle 0 /StemV 110 /XHeight 450 /CharSet (/A/B/C/D/E/F/G/H/I/L/M/O/P/R/S/T/U/W/a/b/c/comma/d/e/eight/f/five/four/g/h/i/k/l/m/n/nine/o/one/p/period/r/s/seven/six/t/three/two/u/w/x/z/zero) /FontFile 335 0 R >> endobj 337 0 obj << /Length1 1083 /Length2 25709 /Length3 0 /Length 26422 /Filter /FlateDecode >> stream xÚ´»sçþ¶.Üö´§mÛ¶mÛÖ·m›Ó¶mÛœiÛ¶mwßÙ¿sÏ{ÎÞuÿ}+•JÖó¬µ>KI%• )¡‚2­  ÀÈT `çLËHÇÀE é°3¤U25w±1t$` ãäd„!%v45t¶؉:›r0°Ñ10Ñ110°Ãˆ›Ú™:þ…MŒ<dM U<ìM ( ÿNδF†NiS;sK;SÊ¿&Â{GKs g cJ‚¿~X DL,Ííþqahcpô4t6$r1ñø{ %`ädg¥#±4·t¶ôü¯•¤ í\œ< déän†ÆÖ–Õþå‰î¯A.vV¦¿;ÃßðEíL„¶¶¦vÎN0ÿJUÄÒÑÔØàèAÿïéZÛÜì¼þ4³´31ûkD`âbO¯jgéàb*)òUÿB0ÿƒ™›:0˜:˜º[Ðÿk¡Õâ˜ñ_°¡‰—=ÀžÀÌÐÆÉÔÇÒÌôïÆËÉÐÕ”ÀÙÑÅÔÇëÿ.Á0²˜X;™þ-#Ì?Þ%íÌœÿÿä¿)WSG§¿½¢ø§y”;g°³ñ 015ƒ¡—8[›RüÿÚÿXRÌÅÆFÎÐÖ”âßÊúŸJ†¶–6ÿ£ö´ºé¿‚¥8ÚÚügé$fénj¢`éllñ_•ý/\ÒÙÐÆÒXÐÎÜÆôoWþTíLLmþNáß±´ü×<Ðþø?8 Kck;S''¦(S;‚ÿˆöoñÿ+½¢¨¨Š<õ¿OÌ?:¢vÆK;seç¿}7t4ùÿ€hCËÿ; ÿãó™ñ¿degG€µ©º¥‰³ÅÿV‘5tv´t×f c``ü‹ÿÝþûL÷ßb$ýŸ±ü_ÖBBw¯¿9³üMœ“‘€‘…•€‘‘‘Ýçߌ]ÿ^,ÿ Ößìÿ[6³ü[JSSwSc˜Õ%€1w°UjKh¹¯háL8)'ÝEŸ†T<ØjÆL6†HÞ‘)Q@›&Y@F‚K×79À®Dƒ4ø§Í×V{Rõôƒ‰¢À¾¡¯¬/6¼¨àx®j`¦ìŠEå©Tnf)Ë\fG|êø™0gWïk ÓÔ7Ò] ‘NEÇF>¸[ñc+ª£ ²û "V7öÊL7°ó÷+jl´á€à*Õ¼AA(Ú¸„}/¢öŽtEâŒ*ð®MF¢÷?ºÛÉN QþGð@d‘wΦN1‘Û<­f}ÈâÛðívãæFÞçƒi ݲãN^¶»ßlŠÕö%%²±ÅÛä7µt‹•$T¯¢,>¨ÐnÚö=ñ :vK®*[½VÛôÏç”Xí`DÂ?cÐÉíÔ¹äÃ&»æç©1ŒpÜt'\mè á£0ý‹"ľç°ö¼Sé¶xŠoÞH&œÍIôÆÑ¢¦¾Ž§&bÀð×GŒ§ºÄØ=°.‡Q™yø7û`gü0Yߟo»ìÅOP­"ÑôPÞ$ÐAôp9œl\·ae犻쩚¯xEsЩjæ:—9#C3Þ„¾¿ÁÕÞNO|ûlaðeíït¥q@ÛÆ·ÄWöo[5T‘Skl;)º‚8‰%*¯îN\Q t&;/ä;Õô)&lóH `‘Hå¯'g`ÐÞS*-× ëËQ"¶éfï~èÕÆuþ¢öTÓ„,º#Ë•®X¸ pT®]ž…*ã}~ƒl¡lž[Øjs%>F¯³òÄ*ðÚÚRÓÔ-Ã;ÜÜEù£k„¨<Ìû¦b^Û/îk²dNf>Ȇêoªuw–¦^Üÿr+pÏ£n‚T7ÅZœÑ¼§ ¹D³hÍ逜º¶(6Ä>´ ½ŠÂ¹:ÀÌ¿Êq ®P@­ÝQ¥L4ãázHS»©Ùz‡9ÂZ”5kÞ€ŒAjnŸÀ²dkìB6{+¨šÄ~È´ö’HÔÛ«¡…ÏW©úNúÝ̼(v¤ë7Gˆ‰÷ïs)Å®ÜF´…[ÂʕуXR¨-ôݳŽSf¯è‰[p«M÷É•¹û ¯; !nmgÀøâ*†5°šà‡Ó?‰Zô§ZÞQ¤•% ô\7áÖ¶>T>/ÝËE¬ÖÆñkðÿ?¦3€Ê£ßx3¶œD­R–]ZÚàÁŒxÁщ !ët™¶$ÉeåC_yK{<°E„|*1®§82l½;ç°£Ü=ð7Ü;GEº6–J´ÍïmÚ E˨5*Æ÷˜}îŠ7á”ÏÄ'‚Ïx{éå­©ÄÈÖO¬bˆÎÄÕj¹àfw´4 H ä±›GQ€„æRKd‹ßâù2üÂÜ*Œ£ça><XžÝŧS&nRRÖ¯2Ä…’ðHd¤VÙR»³Ò\ƒ€çÒt5'ñ/=÷©,ÍP|Ûy÷6Óý« \W+‹QYQw ±?÷gkP핽¦Wp¶)lÀ±#ÃI€£.{ÝÅ8MäÅËàM&JœgIè–¸z&25¨®×Ðu™Þ“Ú×ÈÜÜÔÚvšµÎ߈qÏ %²ã¨[çúÄHîá¼9—Ì/áõ”@ék[¢9¾ðú\ìôÜÓËr6w@?Ãú&=¸1ûa‘_Àkë[%dôúØaîxÐI¶˜˜å¼²È3óP†ÜŒëÆ5±`;Ltç §>òT‘htRö'Õ ‰5Ùvs²¨;ÓéHá»÷ì3„ì*¬}UÓ }˜=ΉR~‰œßÄ7“V»öjU}ÎŒfð'0A—Ö™]‰~CÀï¥USy¯ B·>÷Õ?“ cºéB—÷ͱj 3åÉ…$ø‘Ì穳?²p™þÀ™ÆºyýfÞ2¶•”žËÔaê­ÂwW@$‡,{ƒh"¶i?*@oÈå%@YÁ°a"]VðÚªÏKͧôé$A[¹?Zˆ° g1×>²Ùvˆ¯#›ý»5`‘&q¶XTéz˜¶k \’ø‚ó÷ê Ÿ÷œ‹ ÜmHdý.w¸4T!Š.)`#ör…LŽ•ù®³‹E¬½fæŸ0bhú=¦¦Îs„c=x¬tB9&ò@þ ©êæ>‰Õ»Båñt¿†™;Üû¶ÚhQ ›¥¶ÐZC7˘L¦Õy[ÞuÞôõ£÷~1°¢Øü4¡µ‘é‰åúæl´Ÿ^Ññ¶'Úz¢]˜ Z©+i˜_¾¬“‘^Ë8ZSmcxYd‰ë­¥(Vûý“EYÂ)ROÌ©¨Þ¿¬û,SÒç½£[ØjÅzM ­,2l_Ak‰Ÿ&ïÛz¿mšûZkbSaŸÐ×:´òÚkq¸nt׃¥·¬…ÚâÎvp|‹|ÕðXÁ•»Èr¡´ßvÓmtOÊÖDcÞ²~‘Z)n °À¬+5?)ÆŽÎçÐvIªßøÂŸ–æœ$&£»£ëâ´›xòGÇí'§r|ŧ1˜ûÑe}³¾p-4‡?"Mpº’¶ã)EÆHÆgßš‚lÑÇŠôÖÊ3µbúNh‡ûàgýÆÐÜŸ†ð¿®BjKEÖ&ÙƒºXÛS8Oܾ+ä×Åîu¹%Ú¯j (~>­u®Ú&VÓ“`ë”5kßÅt£9ÂÖÑddµ…òS÷ÿvBÔ' H1‹Uœ°žmúm)¢„ç*œ©;æÆTËž°¦±k²¥vô:UcøÞ¦0˜ÆîŤjÎùô,¦gócs%ÚÍcÒÉ6'òžeÍÉ¥é¡ x®‚Vºî¨bvl:µnp×Å™yVxš—&ìêQwž.©›N¬’ØÀ©ÁMÆh F–Gò>̪ ›9å†à–ÕZ—I¯ÝY[~ÇXºå‰e‘škY2ÎCá…î%ºs/Sâð~é4?t~ƒt.€K”Oe† H Ö÷GÝW)uÓlÍ…+Tµù~=?1PìŽPô˨`yT²ˆ)÷Çl>úê©°–¼{÷(7ö‰²@—ö”ãA_Ǥ"ª¿U>Ýs:X& r‹¡ÿ„[w³Š” Ã䓟(–~¼’ÿäùÍ}逮£îœ‚ûÖWèµýȬa¸x8pá«éΓ—…càÆ I©œ°ÐU”üàòMxo¤ØYÇw†LÓ+Ý&XÇ2N‰Y“ˆ””„Qi!•ЄáÓáÜBöBì…”RÚå.—fZÒ”ÿ+Ü@òö!1[U‡)Håõþ¡æšZzòO÷û£zx×Ã8 ûr5/KØw‘µÊ<ƒ–BhôŠVjVº"P!Hب_<ÚO!/ÇÈ&%¿¶@€úáãâht ,¿»S¾ÉɰÚ$:_6/‘aE&¿¥eò$hÚ žÚý«˜‘oõF.yG?¼h#bu4ÒW[q°"1O¯d«Ú}ÞøŠÑo+10Ÿ$µüS “mYÌ`WüæÀ‹}G»óމǭ$ûï¼™÷t´ê–ÀÀ­¯µúh ˆçP§äP×F”»Á='ëÍf{{<[oyÒnÓBŸT/Ö„áøÔÓ‹¸…sÕƒQô8·ó.™ŽêZI&Éö®ÊC¼.Z¿qËó ¶yEÃÆsÖ=/<šEå0D·õ†„3Aä Nŋܣ»R‰î“vòQ‹TU40ÞC|y~W¬k­ø)ßz “Þ^®Ì^SÁcvöeä£?V–ïm‡¹‰-zLQ#¢äU‰VÍŽ7…­ý>õM² =_ël-ÐÌ È)T:Ì?m¤3.hKæè°Q±ä˜Ñ.ñÉ@Ì  ¾Ä ÚX%³Y‹s:Hs—°‡­˜¸H»É¶O¬oÕb³õ«ïöñ]¬Ó#¬Ù*¦*Y-;MÈ7Ì0;ªñVÚ²”S5Yø±Òvøûâ{ñ2 ûŒt%wmØÐp=±£ø­Ñ~–ºYÇ@æZ´‡y—.aŒ:Ã'‡@ZžËô˜º…Ã^÷>B:6É cK=æ<Ûá§é.AÑGZÝ—¦ãE†Øºûzƒdc³cÁgÂæ’ÁMWb³ÅCM¬òå c~XgÁyŸà˜"`0#Ø'žió×"¦¹½U…¥¬—À˜yz«ùXuÌQUùù»·µð•%Ä¡rª\ćUàä猨rTÃÍL? ùs³‰ÕVÙHÏ-$þ|Ýר>7Cƒ‰Íàp³¥%I§ì¡½¤®p•Üh T±\®å[>eº‹Æï"‚SUÚTF ÚP­s‰AÙ¹A|‰”–E ªtne„òp…·ó|¬3‚ì’ "taFl ²÷tŽu A—± (Am×°˜¾^`öoõNÿ c9âC³©†Å ×þ,é7ÞÚO§¿ožn€sLûrçJÝŽg›üþ6’JÐÒú+|2Ø®[|ùWß9béò„[Ó(ÛûC y²åG¡‘qx.²Ù½®›nY·¥ó<ÛZLÒ"`´*DŽ ”Wž°ppò±&;tî€ÍE-‘…yKÕƒhàG4®tÿ½Èø¥ˆ·˜;»A—z)}ÎŒ…›‹g”«€JÓ‡sþzyõ@ÓÒ~tÿó¼->Ð?6)×,i™smÿq±~¯!l_õ éßÓþP×=„ƒ±éäJžRU\£ü#V˜çV|ØÏ€¸?ß^*Rb½MdÎïÖUÍgí·Ðƒ6ñD¬˜ð6BÈà¢Ü)Õ”ª›QX¬ÓB¼+÷=“"Xz~²òï.i,Am§w|Ëš8¼tìÖÊ‚›çl]­ÁÍÈöW»ÖÀýNT*bŸ·ÚgyÆB¡‰”©¸˜uqq@Ì^Rø Þϼš«Hw“dÝð(,£Ùo·3“OÄÄ.¡Ù{û¸Ò[ØCtÍ馈O'¾Ü².Út™9ÐÖ¸!ÀÌ(%»8.³DF^azTZ@6ÌÜÀ»jÃ2õšçE"²›Ð).Ah`òbF[¿ß¤„Ä,óÕ2ípÛ‘ÃÓ|?†'ûòò:"b{øâëµÛìàë{ÚëöhhjTšIPò!{µ5­kã¨cL^ÖÂŽÕr»¾%ãxôð9ä{v/…ÍOÎ ‡–‡y˜+RDŽö³üïyßjjÓ5UCè|ÀÆy-ËÉËΔš!×éû ÔSª ç^}Z» žiÉj¥ÏÑM´ \|Ö¶õdá!€Zl__µr 1ŸüÒ{ ܱ]Ùá)¢f¾4$³—ǵ_^"üØn2,Ô}ý‘B€?mûb4yŽP½¹,ÄޯŨ3‰ íµð7ÄI(¨mG§ä­yœ™¿4D‹os(&Uz4‹ 0Pâ,{JÀG+#v…\~½ä!ÍŠ¸‹ÚUÄ¡OU‹ÆzÊ&ƒ0+òå«SÔÆ«Ï wyô~‚ bÿJEôÿÙ†á]2dM‰…ÝlJêlmgyšG%#¤]îzÖKä¦IYOF™p'ùhP÷‘wÈQ³2ÑŽ_uO4ÁNâé™÷f¤º&îÅKòþ²i{?!õ†1ÑλÍ<£Rñªûû×Á‹¼J‡¾ÜXÇósïꤤ¯Ùø¾cÀ¶SÏŽ»ÿØ=S2–ÒŸ(8ü5?v¦àµ©GËuíHyÊTË;MÚº1î¡NcÎwæŠï` Ç‘èÜ*¿ž 2ISÇé'P×L¸*§‡œºè¼å` ›°¡1ë!>Uáf9ëOl}ñ–5ó“µ¶©T§¾F [šqÛRãYϱu,ò=‘)>²àŸ½¶l­”NÛê÷ëØÇ£˜=aõ `ZŒOOGm¡ñïò:’aºêçÆ•‹lb_UラòBØ tõžëvޝ~è×FVžŒ_½ÇëY¨çäT´‹AŸZsŸàz^\8ê7Åh½@uwd­ Yf³Ä}áÁ§s>ýß$‘|5àqÓDkÖ‹FX’r%\L8¹‡ôZ{„¾uÆùÇ #iv÷…îOÆ8댸~åËŠë6ïE¢ÍÍYa*HRk4FçË-ŒÉËuÏêøâ%Æwâ-£É/i'}!GÆÕŸ1 =zd³ûˆœŠ×–qX m"‚CëœÈªêÒ~ßuÏàkßÔÄ nL–@øaã± Rï“‚h~^NƒÐ¡béJT®=ï^Ûâtø†VbÃ4S©&[æ!S­a»-O}ž E<™Xè~>kCdi¾žúÙ‰3Ô¿:ë–k–ËÍ‹á.à>óÔ×È*ä©zñËïÉľujZ†m+–ªé=Ý^ín%ô„h4~”ZÔ;ÇH„í£ó„ꔀ5€¨ì®ÆÈÕ¹êx¥;@㪌lF˜M8º¥D[G>•Ô=%«Ö9e:ûT1²¶ÅíÚ¹¸ jöþ”>¾Ål]êüâ“x,Y§³Q«rB¦3#®0)j;vsÿ¯{Ô›ÉPK…«+ŠØœ˜´yM9ó†OŸïÀì¬Æ‰Á»xùÏ7ˆÀ5›Àhž¬­²¾…önÒº¹Ä—|ZíŒH˜“ÑnæÚ‰%ÆÛ¤Þ×=Ù¾yëÅãöž¼5ùI0ðÄ ç+_Û"?§åÈæ7[h]_äK¾¾”ì=ÊŠŽ¸¸ÿ™}ºó–°Ħa<’®¯U;‹t¨Ó“ÞÈk-«>Â¥Á²—¯Å«6ІPàšÓ¬yjém̨EŠ:ƒ„m~…v Ó’8U›…|Ýé‚P[ï1§¾§¯’Ù4ÈMËÀ,\>S¢„Äx`r>€/üÛ*ŒÚIOfé1Ö Àj £ów(·rÞ†K/—´Kü%ägýû“-œ,ðé´@Ò¯Œ G×É}|ܦ¯ç»ªf^Žˆ¿ŠG>.†£HDPõÉŒÜà³/±–•"ìåv³”6ò9¢ýì"±'‰·LÐ¥§ Ù ¡–¤†0~ã~ågÕ° òk w+îÍ9rwLïY(ßlç:©lW}¨ýÜòKîýP÷>ß§’Êý‰BP ýMÇ©D†^Ëý›ˆxÈ1 ÃÛumJ@Äš'å;+ŒÐäsû·qW‹0ÝK¾v?S˜Q{öï¦bä®Î%³¬µ®ürFEÂuæn}‡ðJaX \íq^-CÑP¾î›¡*Y+-kp9«{Îuå¡y¨þ4ô›1Dz¥²¤fÍ<Çë)ø WAA4ë?ÀžÍ‚'Úü̹ußßdb§‚óðÝÏ\¤íñe­ etú²HÜ[d:pVp$ýª48¥îÀ%>ÄÔc'G8qiÛË —ÕŠ±tg‚“Ü·óo­2Ô–Êîì­?úâÂ7yõ‹(ÚÕ-1=éO¦t¯j^ÆèÉʯ› ìö `úº¼H²:ÿ/õ§q¸Vê»›‹M ,Ð3ó0¿ÍËÔOï§-Y[¹yûë<9), dàÙ\*û•Ë>ºÒ²2>ÚŸ«>:º†ˆk®=L ÈWIk‡XÒ Ø…íý–"&À‘é—ÖÀØ.†úRÖÕR‹‡Ç0q@ìV¢ñ‡Ï€m²z^‚¨º_ºg3‰?)­R~Ї¥›a…jÀt@ŽÙQ¡nNù9¤×› Çm¥wÇ¢0?ÓN]XKZΘ ”,qûVÃ'Ñä³}§ÛT>K2 –\%›#ØS>14\=X ívòœ"צæN½œš£óW*”äù°  ¶üëÜÚ˜=\tgUýƒZÞ¶v£ðŒ Ø·"_Ê;Ÿb‡íꀧégB7JWΨ“fJM#¿eªÚ-¦O2¼ÄhкâÃñþO~šŠk¢Z£ØŽýýgFØóÞ4×ÊÝnJ í3„ïŸS ì$2ñž(²%´„À²Â…Ê˘õÒ$ža‘)?ž¢á ÙºnšÖ¨dQ7P '’UÖéÄê ¥ÒI©LnJ+[µx}¦›JAk×û_´8†ÀÉoLGøºÈ|ÂO;œ"H®´è\YŒ‰å[å4ÜOˆ¡§y!‘ó¡\06BáJØEX¦;UÀÄz÷PI¹ùÌIܵðfk®LJ?«¥Ö°íæ5³ì×w(V.~˜9Ò1k£ñ ˜6FtÚ~ªµm¿JÆ?=!|e€CUz®úX9{sóÏ_£øÐ´ÆiáJÏzÔ¨ƒó”eŠûhy—wI?Á‡áÄ• kªý–Ëa‹.ñó(ߌ?_èêE4T« Õö€ù¼þ«“jËܸ; àý,¿}S!p½sg‹kr;ÿûLÚ„¦ÁL˜0êÔH½äW° ¹±ÝèÒ«pç¾,£q9XïFÚÄÌÎ{Ú8p£§£¼ÉjÏø”kdöýû¡î3¾£’†JóP˜CJîfõv*þ7bdb&ôö]˜¤³‡[ªR` !A§ÂÆhÇZ˜AµÈ>*Ú•\Y`ÿ‚f¸NÄÔ"ÿ9¦Ûs¨.âTê¹óE딽yÀ TõÏÈýª§Gà÷™§‚ˆºèã'º/KÛ;6®p B;{…bìÏ€âõa~ÿI½ŽhfÖ]Õ‡ü$ÖQ+'w ¼1„qIÜÕ&ZÞ‘µÜrUL}íÖDí3"ÚÙè¿ßpò¼ÉG‘¾ŠH! i°ÄW¢ý¢Lé¥Ö†DÜ‹XNðÌÏtA}¤èÈ É­€,cšß½ÿOlÌ-Ä <_dvØ»·J`{žØf8·¤4_€´%(Ť­ªIh Iq¡m6Ås'ëæ®x9…i#+ ŠÇ½H6L~t³%øC‡ñR’'~†0²¶]#6+3¼µ9?7ÀèpETÚ½L|—)¦©4¨ìšjć…çBüñù0²çTr‹Æw¸SR×l:1( [,® µ'ׯ…'ÖÇ‘7q`Õ´&cÛWg~$ܸ’é6M‡½‘³¢/áâjø|¡ç$=ŠÃbÄÞ .Ü#öœ,Œ]¤¹ßÿÔ-@Ï¡&Æ*h©@Ù÷‹dÞ ©ö"èáÚ_h²—žBŽþ’{C‡íÄ–8í+6ŠììÜPñKq9q†ðÂ0(…_¬Mb‘¡·^tÇúööÄô‚÷à …ŸsÈ݈šˆŽò ¹X;"iS2zsÞ„ÚÜßÛPJ/îya5*Þ V¿Á“SŸxfJàsÍè˜h™5u4Á]gÓü+u¦+ƒÂY‹»ÀÄöyI£Ü¥ª‘ãü¸’C w‹6šH«yGÌvŒ6”RW\•ÆU‹TöuLÙ¹â;úd†ïEú³p_‘•Èè¡#W O¸L)ÚÄ'¢£YøNÛðó˜è +ÿÀîÃÁRaò×"åùjàÑË›¼Ñ1ú àϸ^øAvñÛõ-Y.@–½pVp¨â &Ç©âл^Öx`~¼~4lU<™–ÜÜ_}ég$Þ§Õ¥”,ÅSvŸ—›i^"‚ý:ro÷ëU,±rîëí1…Ób–) '^¢Go[$ñe¸x‘Wòº !Þk¶9þH–žød:ì>hd=ˆÃ”Ke`¯Ó+ ã@u<ïM`"ð…6.ª`ÜwP“ tOsQf'ÑØ •ucNÖ|kþwõ#Ýå¡ïý٨Ȫ#b¼ÍxÁ ¯ýdÍ\[{²¦I²³Fm´PÌëqYzîAaÝ…sõEˆÓÌt²³WD<7{Wå'¿Zª½m:ý9ØÓ•êja½Œã=-4BÖ›ö$¤{Æ«BÔîù¸­És`… /²úÖftˆMÞ8‰¹Û¨hs[ ÍWbqc{£öû~͉ðWäBy7ë4àPV©ŠTõA½ æRÊHŠúóÐ#Z²K³š½üò¯ó{ žá(©2ó q¼¯BbÞbþp&)Š¢ßS1Œï?˼ï5žp Ö‡W«EÇøº‹‘‹(O®Ij¼ŽFÐÄOÚÀŠRÊ%,ÍÕ-÷nÉË]âæ+›Çæ&—ŸÞ?@ 7ýð(!wA1:N§ÿÝöKŽ…R°U³“{å¤;šÆ2â|}ÜhîÉÔÊÞÙºå…-{}ÀB+)Q«¢¬e 6>tÚŽ¤Yéæµ•‚Ó¸f§ÊoJ¯’¡A$•â",Y;û×!ù‡6Þb~ùÑåÔ½µ5 þ1ž”Ën‹“w(F¬z~âÄd}[­0ɾ~ÿÏ á@ >šÅnºkžFûá¨o¿_‚Ë>1V}uú’ÕÑOiÛú¹Ä¤ú£§Ø4_ȳÏà"jÎÌ{äò¿Ûë•þìÒcá ú‰PMRg­kJçâb½ÎÔýa“,Öî±f*ûN± ølç_ðŠŸjµ¨öqږ̸Y5yýzï÷_îÙ°¹ n]L+ÿÁ[! òbBݺ¢Ü~ip-Ü–_w·ŒÎÇñ^Â8¤3têŒa³– A¶g>†ªx4Z«­Yåɬ05&~]€ÅTOÊv\Æq<=1¬6ÊÂç:¸M¼Ò­¥‰Å@gð–¿œ œÒèFiTòk׿)Ë Z†x””ÌI¾WÅsK·µ¼]ÛãyšÄ§>^<Ÿ$‰·³ îõHh‚\dß?ÈÎV]/ãÜ—z•Ôýd0MÉ„Go`œ‡{a•3Ó¥l5hƒñø€îfÎÏVòñÊ¿¥K=øˆð\«º a@…ûtGŽ@ÕÑY°PÏ Äþ¼[óy`Üú€ÊSº‡¸é ºGwQ, @„̬vÛX?…à·—f-¶}9IÈä0šÈu¼âLšm™®„[XàÙl‰÷ï+ÔDAy)œ^{Õêk“âJAš_ìPJcÊ×™äUh³µÒhËüœHUlÁû…Ò’Y/›)¦È §E¸G°'Qsuê¨ …’{Ï_zLÙ þ~öHRk9lï Tk4Nü>Æ.5¾Yˆ¬Ðý,§ìô±€ìƒ/WAÕ|ùþ·c”:°Æ‡Ði|h M[N@hDf&“ErKBØÐ_N!Ø|ibÉ‹§ @ÁKï-5Úq Èw'¥Ï'¿&d>šò’ Є1Qö²U—s ‚Õâ:\>}ÔÈÓ6&åÔîÒ}caŠù9âÎÀ¡Êk_G[ðF>qsŸ¹3*S›*6Gˆg¶Èsá-DlG¤…õ°lõÉT ï£:Àš“ă»D{Úa<΄Ó9‡úa‰@Xá3m Ä¢¢*¨D±šŽb‰­¬3#ën!øË&ÐÏÜ_¤æ8W`¬á8rŒJ/ZgE+‹ÑqQ¸Y©vw”Ñ…¢[MýSÝ|sŸ_çÓÄÃâR檚®ÄË-™J @$á3½†ƒÒï }¯à·¶‘™¬n1(‚ýTÞµç’+ÁŒK¼ÄÔWݬi.²hm .³¨âºÈ[Ô-O#úUolå@-À¦iVK"{’N뀬Z­žº@¶Îhû:Y ¸ûÓ·¯Px“ò˜„ƒ°Éþ@ž¿©g™ïƒ–ª¿¾ÓÛíä³ÏמÐX<ŠÇ®›öá!e3±à(𦓠ÿ\B{ZbÃ2¦½GÞ1t¤Õ‚d©¾–ºùf4Ñ7|¼ct»mÑõ¾’Úæ—ï@kÚÞIg#´ì(‰Yz\FŸÁƉJœ|ûqWî¤~!±zµ4±Ç䘔/©–‰±ß˜uÓ¶»Ï’¦d 6¿6A¯‰ö\éQyp(åuáê.ÿ|l ¾J{2ß\UË`b²á—Õeuó^NwëÅ·làSÇDGuò Ÿg]WŸxŒµN€(¬ý¦H|š.·êòÐ$£å£¤Þíˆ>¼•¨!DOÞÈûó᱈B™j°wwã(içežÊrmÿ$¨ýN Í7ù`g˜j×;°Uåô->I XY²¦Þ®f–jóüÂé3XÒ!ýÊ/N»KÕ™WâüŽÖ'9]îb£Yì9nhN….?Â"Ùn±›pÏ^à~ñ|šDµÀ/\ ØñúYÛu«[•FˆSúé:‰]Æ;ˆñħxÖô®öèýÀèά~LÊ•in–lÉ•?Í®xŸpÁò1ÎaúmÙlq‹ìd7¢uÊ.š•ÚÍÁA_›Xë¶*QaÉ­ ‘C€ ·bÒÇkÕÐ&t†cË>ènÚŽO!Œ17¤â¨•PÓ¬ÞªwplaÐl± €|_Þçò`Kwº*|Úc~•ì ÁÒhÞ95ص /«…š¤[áÄley/PSmåu6ÆC† ¡>2‚ mZ­JM æ¯çK‡³‰7žCv<ù©1,¯„üÀ*¸…àÍl Ÿ¦´¨ Á¹ú`(G÷rPJCÂBkÑ<Þ>ã2âY¾G– óª­‡ïβӀˆØ'#-y­bB‹zŠÎVqÊMxòDmNÜ›ŒyÌ ­i:þIÇdòÇÆð>/:›\ì`ò'¡é» Ì VI¡UóÎ%Dr ­kBŒòòË€nc¸¿xÖðyµøÆ­kE€gÐ}õÃ`s Å߸Œ‰v—´Ìx’òf‚‘¹XOý ¦êœ_§®ƒ£ËÐ-8pTYâ¼ôÜOm ž<¥¬×ëÆÃ“hä¾c‰c'\Ï,ËÑÝèd>ƒph„-\GðÿFeˆ:÷‹V³#o]ÿ‘úMXè\!D8™RŸ‡f…^=#Ó"ŸÜؘžVîÕX»ö£+sf<ÔѨ)3}(d-ÿ Ý-ß1?„_WN±.*Žm! Î›òòHCJYsÕ«×ãëi ò;Ä› ¯øeF´hñ ÖŒ­3n¶ÐJ™,¦5ДxwAÒÍíj1JŸö¢žÀ ¶3˜–¸uîˆ ½`ê(L–® ï 0j…dÔfÃ@~Âì+]>–z¡Ë/òaÿð¾`Ô—ÖSˆ*Ñ’È´P‘šôP®þ\æ^v‡ÞøÂUh ».´¥$,dÑLˆnßâÎ_¶ž7¯[yþ –® rÜfruú½§™>Àî³#ë;¨ ’Æ…0rèÉš‡JÞ:öVŸ\ãB‚¾R·E>ÁVc ã|3 éÚÀíZx)(.°âöjƒguð(õ e(ßù‹ x¨Ñå±ZÓ£LRF ­8@o©¸$òý~P'[s.0ÝA]2Ãã7(‡u¯”0òÀ‡™)ßÄwý½EvDªDèU³ÖkdêT¥-dõ>ß4ÂíÀ¶Ú™pr5¥œ¢l¯xfw*yâ¶—r‡tú›ªkªìDQm0¨ÜyQÙÁ=D€ñîñc]â)ÍŠ0pžÈŠ—žìbÝð¬9œb2}#b[òD"% ‘÷z5%ò§jŒ:k[BþSV4VÀÔ‡ÌCZæ…[AßîˆG——Ãñ(æ•%­3‰RßÔŠù/¥×¸Ï#«êb³9ZF`cÃçtªÇCUÍ6<[KCæû ÷Èý)íßé2<«…¹¸IÑfJD Œ(Y˜C$”CùîÙûž§¶VÆ5càáD®”Pqê³¥ðô ¥O¯­òÇßÒÑ.« °‚‹É´‡.¶ㄼÆW¢{ÕdÊ×ò&JÜ&"úÍGD‡”Ô†y÷ò æÔÁ+}ôs€éEÊÜï.»*‡qÓ±ÈÅЬÑOoL©“Å9—ÇisIwoPß\¶õ”C¥¦Ë7GLé¯ ïˆâyËÊñ|Õ§:Ný+ñмjËM.ìæQ)þªEö¶‰írâüˆk à¾y %ò[Ê¥sv/ÉÃø(›¤Ë¸ùØþ"]w…U´bZÉޏr¿íë®z}beí°Å^­<_¼„!Ò§"Ç$ÃrðÄ.½~Há¨?¦ÁoæDË5EÈÛ°Í/Ö¯Õtï:&EН¸ž`äÞQö¸½ÐŠŸ8L=}°é4œSGÖ“qcs¦^pŽÒ‹ÅÉ\q°ͯƒ ¸®G»Õy.Ð_¹?‚Àå¹m#BÂäd*4e-:AÒy0‰br*n³É¤ü¤qHs¤«XuVg7á™}Ú¿C 'èŒäœb ú<ŸÏz·Ø’½C³Áã,¯¯Qº‚˜Ì¨bçŸpÃÍ‘OÑ_ã1WˆŒWÀ1ŽK} kt4ݹ&°³ŸËhî(M‘!¹yóäO§î%Âþdé÷µ @âÄz‘5´#K§[®zG—+° R,ú#$¹–ÙÊ&…š³Ïì±-èÇ]$ˆJl©2¤&‹®¼¼ºæ±¥UZlúä[\%ÒÉ{!'Õ‰‹.@bO ÎÛ¤¨-ÃøæÌÇ-·Q­Ž×N² ?{Ø<Ù$ÜÚ­X §D¾ƒJ?¤¦iíëÞgöøv U Ì]¬£ïêÓOrÀâ“4ÐÊu¯_`¸kK³ xE©úB!}¿¶|ـɻ’i„)'4³JÏÇl wðÛf¨GÖ’€l·7êüR›³HÉdÙɬPÍ!˜,”:RàiÆVD`uňj‘ÆXTÖ10W™Ò €H®¶œÿqDÆü®ÄƒkÅ|œ-çì{ú¤r(ÊmÁÙ5kéÒ‘ ·gYž±Î4°ü‘ Ã_xÒaVHïÎy +¡ê¬yŽÀ! Èå í_Y4>&C¦£Œz»½ç`Ç:Mƒö¢bžƒÀFòÓàsÚÈP§ZæQåb&À…×6…|±N¢#é Àr?Ý‹~gs¦U€®’¹N I»ú=ëac¸eËóûk„€Q´oœº8ó—maébç86t¦Ç· «Ð µ‡èµg!ž=à$˜¤ƒú1E7L¦=!¹¥ µoÔºÁÎq‡šqé÷>Ïžn’¤'ìüýO‰ éƒk0ƒÊ%Þ<ÆÐ‹¼G…$Ò_}ãf' vI®HöÓÊ…¹C©?ª“5À€Ç¦*;úê#hfY£#J~£F Å€uŸ!4I¿²ˆl(áÎÉ<º¡jèµHÑâArR»‘¹Š®A°“qKÜÒ1­ÉÇ©dšóGò9e+¨ãÉí““³*lY”šc€èÁöíÓVS¶äÖÝñFè`Od ÅJãs˜ô¿}ö`;w<‡†Rå³¹%/-gôÖ PfXt¯ûwmÐkáúÎ쉺ºÕÏ+±0r…$ŸÔCß íd,¼cITIkic¯rOv>t¡µnWñÇL€µR5ÚÈp«õAS©éð¸!;¨"ýà÷’¨-1R¥!1ÔJ7Ìì´=Õá¼ýÌç©ï]úÀ#S–ŠI ¡›¤>àn–™ùÓŽ‚JörVÀ̬0÷yz£X–à ¹“.5¤}QhÑôó¨Qˆ™\OÝØR}.áò`ø"úâ>KMÐÒÎ Áªè²0)¨¨<0 T­øZ½Û?MY%­–hAù”’•D²°í‰ÍàÎ.éà*,ÀR¢•ýŠíÔÙor˜ ‘ô=Y3_m£­2óx—éÙ=üŠBo=è–nkp"Þ]aì/n“ŧ§¸¹$‚°@w®W‰7«²vqe ¬‚ät'P!o¯ürBSv'e{tv…Åc íÚµ7ïöæ.B­ À%ÇÒGÈë€ÂíÖDT>îÙ€?êïò²¬G\ÿ˜_r¸µb$ ·6£³ýªù˜Çì—›X1XöHPrŸ¢±¯Ouƒr_yº| †‰rÆ7Ñ—¾c„ô$¡èi|Ó»Ìä»M^g‡ð©l 5êŸÍ'õÅ71˜:4٢ƪ5•uý¾‚-¨ÚÄŒbß—ÓCŠ D…ž€¢!¯Òæ3X9’åüŸ¬Ë©r×D {á9@¥ä+²![jò_^çÍÎçS¤óOê ,k. =’%][|tˆ ¢`n:Áà0.N†?âá+y ªXj°Þ‡½Ž ýˆYLy‹h[ùIyqìÝÊíøg^x;jM‚C»Ô5‘£¥+GÒ¿­%u·²;ô·ƒíÉê©)$(¹6‚„íÍç¶’o¨nHajlç¸à”KÕ›·ZF½ösNÆ(݃LdPeuk>=­rž< Öm·4éˆæeý'[ƪ5ª¢EHï„;B¶™Å#}§Ñ€¾¸ncÞИ (±ÚôEWb¸¬ðt~:M•ÔÕ޽Úñ0¹[¶¡ù7ÙVeMÛUÎÊô&~7ŒÜÑ;ú…®« u2‘ Æ¥,MQ+€u"º¢ DÍÐÌ!3°1oÁ:PöÑ2;Ž"=ýuÒ”d÷¦jÀxrövÖÕV ~†ÿ‰²5îxÂKå„0è9Ðu¤«C'ã­»(éi8+@r¼ !¥™ïo–OÿºÄR½‹µDµzÏ/Ÿè>>h›'!ô¥=ݼ®0¶)k–LV¡»Òœ¶bœÐÄþòšµêÍ+qi|álÖ‹×j(øç2ÒåHDì›a$XïÅÏEï¯âAâ’(Äœ[¦^*nÉ~OÎô“ær˜¶$ʦÃF ¾e±ÀTÀXzû5 ÄÁzƒMÕG¦Sð_Ú—Á_ñ‘`L®ìÂ!/Ôhª:Œøª? ‹c¯*ɯÿU~þadŽ£–8ûB®Yå¢gyèÏnéx Rµ¨öøHÿËin_iÈÚ%äqÞŠ`;2\í³¢ŒÎÝRßN+éÇÑ–ÃúªX¤œ¦IgÐ Ye›`[5Hí.R©‰WÄGà5]DQS¯ÓùÊßõvÖXPü^VRì¹Ñ;“bœí±²Ñz|ïÒ3å‚zƒ¸Í{¦î§›p4Á„„­·úA&Á«1žmÒ¹¨ö†ÖªŽs  1¥-2VI¯ 2r z½í"Û?$ÄœŠÖëïtxݘUS9ö½ß$vâ9,cÀNñ:–óÙñv,ÄÙ|ö[…6 S±”ÜCBÝ}Ë-¦ZGéÄ—*x1«6eŽáqƲ-cÝèE-dmê<¬î5éP {¤Á?‘•´æ’.óí¸`Ûÿñ<}¬CµA˜ç}‰öÖ n—MãGسäÈQØyÛ¶nZ€2üൠ· O~>Rrå}ëš$·(;‚&Ð+ï(.M_áq·b'"‰"*æ´º%Ñ?][ût—Q'˜¼Ö/Ô  «ŠöãiÓÒV_Xßœ“·Ñ+=üÝ‘Eø¾\ü-XdîÛŠðåÏŒävËíË @sG]ûtÂW\­À6ƒzG¬žøïѼçç,Ï::BšÃ}Xˆ³P¬×?MûñR7½12—>?„Ö²èG)m×ÔKaZlÁ<¨c7ŸcLÄO\‚¬&Œ¤^5=_N3xOÐÉ—EÈÍC ™<µÙËÜ…"‚¡lãñqlãeÀÖj™:ºóK²C¼Þ9 Ú2b —rqOxåšd×Ô¸íƸ˜âõ¶&˜T»?'-Øj­n½+À!÷ç›N^k›ÂFýš–ŸÖM£úàŸ% ƒ˜ÒWÏø¬MÅ›Cßܦ&ø¢{É0LÙ×9߈ÆU\Œ¥\zåŽn´3è9nÑh¹™ ôwL¹ädtÓR‚Õ–Þ¦¯zÒŽ›ýh±pt/¾¥ò4^ŽæX&*G_ì±ö´É¸ÌñÍÊeEô»Î`îÎë+{›9+^ ÊÂÿ^àÙ]iw]Ù2Ö̶þVÿ-2 ÌC&.[¼Ñ’ œ„žšQyZ­K÷ˆt€¾_¥ƒº´qA¾<½ · ¥l»Èø”°j¶š†{"÷ úFmª‘ƒŽ×˾i“»tUË7LF>UL^>Í•uÇØ¶=‡e{1¤à1]ò†â÷íÀ,±|¯Ô?s+®\‚šdñ‰Û?²IëwZï4æ¥Q¯¿«®JóWV‚æ¨g’ÿH‡½Òß=1î’£}<ÜTöÔ£äzS&hjŠ<Œ<ǰY#C.@°.. <3f Ž3A¼`e2d癃*F9œ¹ñj©¥f¬ËŸX6h¥°Y_ýêr-ظi{¸³[¿ÞJæG†x7Õ¢šgžp?¹zÒT<P×QPüŽÉÅF•_0§lk$4‡®Zd… n'á¹€-­3Ž"@*0È#Ýe]¬G#Y‰Ènß–9ä%ep—[%ÆÁðlý²ý0ÌÙ €Kv?Þ–½²íýÁ >o­¢Xõ}³_=Øó>}×MX|¯]rÚ›qÔâqÁë~Q]~Ò±£ =L…(eôîæ`Ú²*ò£“z7f.ZŸbá1èÇÀY­:×á.¨û¯ Ü5Ú!:c.1¼¦?i"IC ü=„ÝòO€Ð—X·#°âH~ku%6>ÑU t•]Â}öQi›-:UEÕ=ßÿŠ3ᙵJÕsÀ8nùòÁÆÛVýïA&:®szÎ/ë12Ò·Áð`Vi'¤ëÑñ5\;ÖÊÆWoÀë)ˆZѩԿܛãìöË)å(*š!×I6_š‹èÅ¢p°Î%ΙýëHÆ¿±W[º(±”üê˜kŸL¢¯D7¨¹¤ãª€oèR…{ÉË]~¾\±Ø¡“²#ĹÀPèÍ$$…_KSõ ÚZ1¸ªùûOK™+#SÿXêü ,É}åáÚ6kºÀ:&nÃ{Øœ\ó?PðºðW2ÁûVÛXÂÙÜ}¿§í³´ÉsÒˆ‰®Æ»o95dóB«Ñ³ðCÊÈŽFQrÉÚ¢FÉßÚl*§Š7×Ѿ×_»8tm>ŸÏû:ê¾ô ö'2ÎX/ÒŸ4›Ó*G‘#ZÞ™Æ8Ñ\ŸUm¬–Q Ü0œ0#Ð-‰suP›“kz[66ºLœÓ²gi­¢†ÉË*CÜÃ#1ÓOã St^$’luñ2M'È_{§F³Ü]‡&™K·JJ‹Š†jƒ¥§ñvÁ-)¾ ɯ?§CÓhËy¨GBpÎFù}Ñ ó£2”@SÚ«V±Z 82"RÑú’!ýaóFÊÕ[ ïFtšÍk.™_“#éž <øDÔ ¹ÃU= '̃À¾„µ¸ˆ¶áêDW`§<O< ñ‰¹·x¼§=R}38³èšÅ£Ûõu½-μâ™~y(ƒº±ŒêXÕ–½í1¦œà®wÒ¹˜ =“µVý9Ê@¾N¾tº‚~}º•z¡?{¦õ3Ó®–ïŽÊdjŒ<ȃ„Ä_3¿n?îôÝ®ðHº:é"Òõ£ñ7ðùæíà2Ñ$(€¯ÓžÞøµOàL8øk vLlõ'9\:S)òïú4ܹ¥Äu8Æ’€UêɩӰ¢·ªM9Ò›¦h‹²XÏFwZ©XÂ{êsûAËæÌãdÚ•O‰T6­Ž4«k2µ?]iY{>¾ñ€“v½P'âÇY>õeŠœ¡˜Cf®×Öÿ¥4jv»åN6±ÒHaÛX´¤èþàONõ±óá»åÐfž…F2ö»9⪻óGý¸ `÷ÿö &·{zÛñ嘜·&ÓÿÒHᚈ8d ïð)p‚¹³€[Ù•²èu'VÇߦ$} ®#QìW© Ø ¤-Ìä»@·›i:(8²…c ŸsÞ;€Z1÷¹žŸ‰€æ1ÇGH ŒuÕ…¼JmsÌÐÏvÃv73''ú¸P£ëE/•&Uu-àDÄL7Z¬ÖmßÚˆÕ>˜þ&ÞB~1æü¥¤þ¤ê®î²áÉ¥¹ˆkòÎmJn—Œ¸èŽßBl•ÕP Œ ÆÉ¸ï¥ÚI¯‡Š¶h”§~)ýQÂà? Q]¢#«’è©|,â¼Ò´Zاâ׌óÑø?/Ç )‰ò:¤¼ˆ"õ¬¹PVLýz÷ oR¶¡°–Út×M´Ä;ÜÕ?ÖÚNvÕaŽ$ÙðA”¼ùX„H vçÉMcäâAbnœ›ë@4ú9'M.†ÌïyIÁ«<øÅë,S¹ž‘¸VûL ÞugSˆš‘€¢‹ð›’mýåó”¥@†ì²| >ÑØ0<9¬ˆ{)4œ–¤þ™F9A9ñF!Œò6'O布î„ýô6­?£¹8Ÿ§dSG«JSÓFbü·Í¥ ›jŒ“è Sn‡Ì¨ jB¥”5Ù­’ØÐÉ[%ó¬;0ßÕRóŠ“ð—¢„›s™ÛãÍ ¯ò2Ô¬NCGçE‘š]â"uhC-ìSÎÇ!3e8"b€I€•`ä ¡&ÌwÂÅŸ•rݞəPÓ @(:½žûil„ˆ¾Ï„€Å¦ýœx¬*?‰™ª½ªsÕF‰"yÉ_·¤÷è@ÝSØÎ™¡HŠüÁ®ç×Dc£bÝN!ùTØQp®D°*îX¹„ü›]`EÙ7¦ÂÝ|# Ü7„võpi錮ͤoÈ® Ær>V &L¾%´HeÆÞ7•@¹^Úà)-å÷z¾5²×8å4>¤ê´Õ}vƒ‘YJÿqS§µÔDÈÅKSÝýÍ&Ì7CP`ô`Ó}=ŸÞ7CZصi [Êm¹å õ)x=ê.âòОsl/žD“öÿEtŒÔú‘8çÆä±Ìf_K†7f¢A@t¥àÖÐÔ Ž¥2¡úÌ 6™’ÿ´i¥2&ªË„.÷-Å):Üú>?Dߥ÷$¼–=8%ñD*|𻸃‚]B˜g.‡ §{t«÷Z®ê”R=‚FÎ| ùSàù#ìrˆ°zVœûÆÓI¬ž\ò¨ÝœRg6¹lÛHÈÍæ[ hÌ@4MHœû‘ÑéÔ‘±> ¾å>ðÑùÈa¿¥²!mp¹›ÇÔÊ áZ·±,д¯u‚Y t˜å¸eÍã“Ãó3HTÅ×IVxÞuJð®Ôy’ñ’N:[È! ÞDPíÑÆZ=TßsZH¾rŠ«HØÓ}#Š“]WB¾ƒ!Iú¨ƒž­Òš‰7D_nCᇌö–Œ¡Ír…i¥.ø¶êÊ šæqÿI®j¢·u\Kα…ËöóbÁF¢ÕÇý/³–†£¢hÅz6‰öoìi”g{_P}i¿^`ÉZo¬,ùÖpñüл|òüwPFa‰/`HÃû"¿Èƒk•²ø;ú’ýn²°þ&xƒ=(í–c<¡ò2ºîpŒž&––uõó¹À’cìdÑ7؈êL `ÏP¨ª˜/¼÷µÇ)ªõ³5Î8 ¸íÂL1@äíBÌ‚,vH)T5}vøæ#7 ‚ä#¤ö-ø`í†ìlý¢'à?®/WÙÀ ìv)–~PjÎ゜&E†\VÓÁ¨=†‰¹¦ƒ¾ÄbÄ×õ/òxWêV¡Þ ,⻈Ã0n6>D<oÔÑ­'1ÊU*²!mº×דæÄgùËeð1þ5S'¥‚–…HÑÅdŒ¾k©<ê ä ÿC7É  ^[Uà¹ÐBÞ MHÓi£q÷•®ã߯@Z×5 ´§Šî¹j¶°¼1Žamr˜x»!8·ÿUlÝ¯Ø Ÿë[$ikAÜÖðûK­ÞûSç¦ÉóRßø;MËkyÅNOv·‚ËGö˸ަӤšƒˆm²`^B;Bnü®¿ª‡øX.¬è8OK`9<Æî¨6“C;)e_%ÈžeJRÌ`Gˆ_AÛ…úŸsPIX Œ›Px:ñ,ã“>U‚·î™7‡qnÅLg`@9qÝaêÛÞåq§!Ηáýšþ“vVÇ>ï87/G›à} ãeŒm;é”\‚ê:͹‡]Ì–)ê`+ ,OxðÃà„_1²¢mpàuZC ÒG¯2Ío³à–äû¤áÞ¸‡v„Œ¥$!¹ª!a…Ôï²ábHÁ!œø0†Vöïj§€KI-Út.'vû“'åvEJ† Â²$àÞÖjÎCò:ñ@Ê~ˆ’»öÌÔ*èj¢"¬òù×zÓn0qö1¥#Íï3)Ú$'ôbᵈ½”&9Á˜¡12(bµ~¨ ‚~]_Y(ýy;®)e€±-dŽÕ«H''àe „¬•lkX‡1^•,O‚±ÍLA‚2Ÿ•«GA¢–;÷°_k/Íž âÔ;ÚjDGÒódîš!~f³Š©"ƒoªÕ »›µC¯*†©ŸMQ"áø&â‡vs†4¢]VȘá䌧PàÕ¤ñù®ŽÆ[q‚½H­1EûjT§”¡|ÎÕ.Bi˜¿@Àÿ0.N†?àx™ê JJèñ¬ìÑ3š?Àøe mz"ýHé@ì9¾·ñ.VêYéÂEžêUÝŸÐ-"=dÐHÎ4V ¿Äa⤺ “€ù{[ U7/æp›Y¬A½N%cásáþWp­ìþÄûb¤–Ç»Öïi?Èæé\^PŸ0§UåM ZjecÓ*QAV‚2h3Ï)–‘uqÔ¢!t+—}–gCË|ÉÅýÈY]ýemfð¯»L‡Ës!G*¢¸ê›:>9€Îîøö¡ óFèøøt0&Pu¨ÜÁ‚[R:YCÛ®ç“Ï3q?ÈãÐàžäŸ.qÈä4îfî´Óù å_Þ]µÔû‡×¨h¤ >‹uq2]¶6…í21þ–]ÇÎ-¦XÙOG0‚*P¸ï5¨ß|²,×€¶Ó»r]zï4óN*£¤÷ÅȹcZe -4Ã1]õ‘¥O8êg) fMfÎ ü·T OÆ£¨TÛ}¿§í³´¦i¤7–²ók¯÷Ë{´¬Ôª$Ÿx1ãÉ †!²øõêµàY²ç´  1øÏG¸ë¥H'Ƈ“Õ +…‹Ÿ$œVªdod¯T: û'Š‘•qr3À¥'¤kV5Yà” ùXT¦™bÉüŸšÝrhzM£oÑ­hÙÛ‡`{K¼º™¤±!ê87žšMÏs¼Ë…§ ¸HQ¾ØýUO+ûE7º¹ðÎ;*Ue¯ZŸª±‡—ïx—`çD©ÿæÔ+F] 1rEPTlõ~ú@G½GyÍ Û”P ”˜½†¬»úmí$¥z”ýÎè“Äàcè¦HӤЊ£óû¸F²|4ý‡ã‚Èlœ ˵;ä'½ùÔ+P+UÛvy\~Æä`ô ’&Vf×W›»&£Õ5vù§$[£’$LÍ솖Œ1`|Êú!6dÿ.ͶVíÖ¥8âµMÇK Ò´šË{]lïmÆÞ9x¼’Œ!cXâµQ“æÆ}("o˜—¹ŒÜà(‰§±¦ €%B®`•7oÌjÖé5,KæÄQœÌíÓ©Á¾Õv Ó7V&UØW‡åN~纻JWŽó“üñÛ˽˜ y|LkÔ&&Ã'ÄÔ°d湊-’ Tý~™ng±s £ª‹W^€ãþ†o—¦è%Œ“&¿ɹq|TŸ!@Ÿ’ÈþfŽžo#%IŽ˜Äã›i}¸ÓçK™{'=!nä@B"ºóô¥Ib³>ž’N%hu%ÌËrþ“Ô5*!’¢fB¹ß»þ¦&(-ñ« ç';Œ@¢bÚ±‹Ñ©ƒ2X¹Ó5õ³ÁÚûlïÒxUœØF#ÊxÏl×{áò@¶(>ò‚ù#pÓ—Øch‹5ê‡(E÷*ÂL.®(ú¯£Ow²üŒ÷ôœ;™*á~þ+ šÅX­a„^—]@úsõJé´à(¬ûZœn‹Q³dFŽ ±b õL o¬Z~>Œvˆ¼Ãa*ÄÑ©—tjÐߘ–¸vJ´Ô¾ÜIÃßß$¼v#K œIR+¸±æ±aM¨ÅÞ6WÑÛP]&÷:UçÖ¶Ó¯óÒYxÚ%1ÑÌp"€…¾3Hײ7ÜÄ ð Z‰{øñ†BÆÈ¶ôÊ9¬,OËf´“1WŽÏkð°¶X÷@ò® MàwÈy¡^ õÄ,GˆÒ ¸Œ†Žˆû‰>Ãg¡9éÓÅ«ª::#³ÊÑHvýˆ3«Tì)“½øÅö¼¿t MõÂØu ÷‘´(âDÆâGà ¨ºïöè0ý/»ÑìÅ´RlÀ¹3wËEpiê-«>Qí"\¬DįI½ 1/\˜cI*·®ë˜)Ö»]— ÇJè Ž(=4P›—¼"ñÝ´Ö<° K¹`_Ýqá<Ô|Ë믣G±Š6·aðe<âhÅýÐF þ!êŠlÕQÙt:Iùœ;èì[ÜãÎ|á·. ák·^Ÿ‚¦q ÉÉJžÇ¤diÕšk‚—Ìž#ׇÞâ ‘Íqzðäù¨ÜÂnmcÜ™òr;â6d{ózÉHnT¨6 ¨qNj„rTv<®qÐ (èãÄöÁ¨µE 0=Û¢æÛAósú$árGÇ·¶ËóÕ½ºÉpòÁ¬‡N„Õ+/È_Ö É¾ôî%8aI“…Pº€ì\ñ)êþ†À¤m[zç£ý­üýÞÏsnc Ïu±;n¾¢^_‚„´˜§2ò1Ámjjìë=¿VW€f︶ùß ËÛvéïuØjD@»ÇF¿Žµ°zŒ¨tÜÿ++:Ø;‰–%°C¡°ÄKo3œm•øoÑ·Ò8o8«Ÿ°Å4Ц›Ÿìp1*9úp5Wh÷™»ŸÏ9¶Cy1?±9.@`úòW92io-þzCv·,FÛÑbr;¿f¶¡åO÷ .7±d(ïÊntömÇt‰á.„n¤þf²KB|›‰Ìx´OÕšMP¿hÞUyá;úÚµRO²«UPDi“_ô3LÍ@°Á Æ}^wFÓj•œ÷Çz¢Ôë‘ÜiwZ »j—f§ºms/’c¢ø¥n{,éšY-»_ÆÊî‘Ä“ÓEèp™ÄùáÙº'ök»òžêý(ßå`â"HbõÖ­S(«ý,žöm\žØþI= 1J‘IJòçhÕaÌ~—ô}ˆy%)" ¿Úé÷wpè»È.í<™–%nm™Oä×дóv ã§ï<­ ­ZÞá"(8ƒbl7¿R,š[ò¥ -C?&=uÊ,)(¯Rµê¬?W €í–ïú÷¥”_×s€=ÉfJνä–c*vO´·iKå^([4òš·˜F–BxÏ0à¿1 6LD"^÷Pf X…w§åC‚-fÂiÑc•Ù4y³½b»GÂÍN¤ TÜm·¯8€~^íÕ-y ™Ô}Eé§ã˜âÎ æ9‡CÔ"“ ¥{i¿ú¹Ãž<“¤¬Ïôë——nó(Ö|¨?h¥…¸Ékiâ«®Z'1• =.CĹCž[Xý&&¥¢d†)¯¿!üô~ÑÙß”·¨€'ôp^+*,+ëE.ÁÚ/Ü޳,o‡t+t6 Åå=·…Œ£5}ãÃ飦æÀoìRO&•»û™jLB«0À»ˆÑ¥Ž¶ý0šÂ¬" ´­q>è:ÂÜߪ‡R—ôÌý¶Ëš6˜é5_“׊<8‡K þ†FÌ÷2.9ÒíÉÃz¿ €Ó­lUÉíþ½?Úþ\Œ‚¾JÜ7 ÷擈m4v‚üqëûÎ} }¹Kâàݲþ=ó°¥OÖÃ♨jX;—ÜÌ‘°Õ‡1’°†ë5½2K$ ¸ÿJðC‚× ±sAˆÔÂÜÎ ú ä‡c÷œA xº»KGü­L¤Ø“¼‹žÒX2O¦³q;¶?±Ãqz?$MtAb90›¡)æ•ñÀqîÐ%? -ön‘GϿɗvb‹£VßsÏÕéKpIdåÓª}ºxÛÈ9ë¬÷#>:Ó³«ê É@_âXVƒ (¼21D’zåÀ+ÛYmí½&DLWÕ±[ÄÏÇM‹Á›ŒÍºŠ–›žE$ µÿCÐo¬—¯*OÿU¥–„Ñ[%ùô‰´'ѿʠ0ÆãæµÙãî*HfM D°­çË.Œۨ¯¬Ò°§ÈŠÚŽÝN¢vwA»°ðšêÅ<nqâûlRlažùJ_ËXúìšX…o"ƒŸ2FË'@V¯j²H8™Êx…ßþ¼g^dÈ 4r²„XJÛ â?Ü!â½\[}¬ÿ²4€çàc-S¸#´4XGMQ.Àɽªñ+†Ù/6ù×°èÁ<„ˆ7ôª.¹$±ÝW.Íâ°ÜêšZƒ=dHa•nWª›Ó‚ðÁ\A‡µ„!‰Ä<,Ò"ð’^/€¡3óŒ¼é2#‰a~; ŸÏ¸gy¬ãOm|Ï›ú<à T×´9ЧS° }´Â@•n©dnä} ä†h0Òi0Ò'7êm¨~'Ž·ùb4ÎJñM|)L¾ìñL†ÊÀ`A”“Ø(£s4#UøÈa•q¾d3Ö°”æÃÛoìzé®÷/Ñ4h5©~{šzf†„“¥øtïMíø ¡Xö\î'²ú׃Ëá¼”âèÌ¿ª_>¤¦^®€}ÅÌ݉ë½Y'³÷jü«ôP¿È—ØÃdã’6K«0p-‰Y ÷¬—žè£X( SI$¥Žd‚ñK@Î4®;B*Ê‚=Eɸ4x`å96»+5?wÙhFQ1†êÿI‹IèÐwZns¹šKƒ_zÀÈžà/Í<ÆPç®çwáݼhGâÉLÌD£Œ–iOvü+]¶&?šî”Øu^¼IíW575Yà>gÏ¡µæDLÐLñ´oůfÿ')oDRp(ßTêùø5¿½œ’>:" ¿¡Öe=íà n^yŸ_“ŒüÃ[7!'¼Lóþ¼ åo¹£ùÿÈ¿‡zNÒ.‰+ÈÐ>0êŽX~26hÄÄ¡ÓÌÚ£ÉU`Q›_ñÔç¥4Ï ^‹ýn e÷ë§»?AAŒÿÅS¶æru'{…îúÛvó_š‰š™§õM%uG¬YŒ³‚î1“<øš)RÖ¹•Xï=áæªil®}µ;eÁë¶§ãDuå=¶>.ŽIP¶@,bf!­I4l$ ÙË‚'Tˆ~±wÖ¸iˆV— ý%Cz_~^V!8›`â³<¸F–0@yÒûé Ÿa×"óÅâýSK±.£Ád×(Ä[4åHy¢··f¤¬ãž—“í?s†‘<¡5’>¨&ÌXüÆa…µ‡ú;wH²¿Ä½ PØ\˜°Ü`+ž¿z½3 €„kv«i¬<ñ¾‚Ьf[î(|‘ãÒ/’ºi ËL> endobj 339 0 obj << /Length1 1081 /Length2 15843 /Length3 0 /Length 16555 /Filter /FlateDecode >> stream xÚµºst'QÖ.Û¶m»cÛvò‹m۶ѱí¤ã;¶mÛ¸=3w¾÷Y÷ßoÕªuj?ÛûìªS§V‘+ªÐ ™ÚÄíí\虘xˆ¤ÜííŒè¥\Œl,Mˆ˜¸¹™aÈÉEœF.–öv¢F."&&&&Nr" €Àé/lJdìI$p1Rõt0Qý“P´wv¡76rþËØ™[Ú¨ÿªˆØ;x:Yš[¸Q™PýµÃN$ p¶4·û§ #s{'/##"aWSÏ¿=37';‘¨¥¹¥‹¥×¿Ë™&ÝqNŸÐd†æÍô'iñkõ#Ðésùg2F«iïpEÁðbõÞ Žll‹~-pÚP°¿Ù.üÈ›Ýk‚&–g¬´ ÎøùkS¡GEEk81â»Ó–‹Ú2cµ*50\¦[1¶‹&}æ2 â%fo{—9>!¸€}YdŒ;‡ŽÇ âW­SâCLñ½ÒûòRoý¡'¼ o­g©Š˜BÚ²¥¢LýòªkD­dÓNƒªB4<5ÑŒE"3Þ9;!˜’uZÓ2»ßX'î<Õ$°¨«%eí0ì8¹óÛÜaç0^µ÷³í€ÃšÈoà-Yh4ÿ6v]ü " M¦ ws²¤˜PgB<1Ã}0S; ¹qlÑ«‹ÍJúÖF ñÜ8þ€UË)lŠ`°áR§Ìé9Û«×jk§úùq˜ Æf;¢%‚\1,ÙD>ŒÌ¡Rh,íÏküÊ…ûŠ9gƒäoüö[Ò†[DŵÖu¥ô5êxÃ0u˜á%× ¹@#ÖÂ×»1Ìàáx\a;ØjèKâ°h\2¦cEÇyñ%Zi↤éÈ%äìn0ú˜ãƒ>µ°ÛUXKsbQ1-J`4擊xLf~Ó¯7Ô`Ž”UUB ȸ1ž!NÄ\€~MHŸŽË y6xgÂDÈ/Eâ¹V37†ýÑ™såºûÉv^¬ÆzT»ØåþéîÑ„L?ÂXK«eæÇë.‰K*q +B-ضoqíÆÒMEél›ŸÉ`ÒÅe7 5ÔLóœ¥å¹¨«ÊxgRg  ïá±éÒ3ÒîÐîïƒx ñ/]8¬áhã_öe»W&sXŒ £Ãù#K¿žN›`Œ¹Üpè d+ûŒÎëj1†£ŒÚƳžÕŠscÔ˜(W˜HúµkE*9º³í±ô¶øÌ±÷/u4ž>ÄÙ€$QYߊa‘AU›ª«kÿâë‰"8ö'ÈÇ~º*%¨<*äÈÓ‹-wÄb¬a—¯ù Õ|3Ûãä¢÷³W4ذDGvñøˆ[­yêl~w›÷Ü䜊MÑ•8jlKO‹2sA9ó@‘Ç)êñSuz1â¸ß‘gixâ©dÁ!HËu}âOcÕŒºÍbeˆ/ûAoûÁÍeÞ$91Ÿä˜õ¤<°ÄˆŸÉjÚ¾ìÝinϸFÉdCCªÙ´XdôòÝëXÑEbîÒÌ@­Ì^UxŒdÎM‡—CyæÛ™ H?[BRõ}‡¹FNY·†~ZŠ?ŸP,ÌillOCèSË ‡éL«&+þAÄ*ê¤' 5ÌÍ.!3éo‘é„™‡ï ‰ª®ž®xû¨V~}ª¾Ÿý]´¯õ>u6|âU%²âÄ7:´“¿¹>iÇèœN&×øLA ­f--q½ÃRb¯“¬&âq‚Õº)y:Â^ ‰÷ÑèZAL¬ÂøÈu8»¨Srô¸ÇG¬b%íÔ"àoÈ «}ÓëƒÉ¹bÕOO#ÔÐöJ ¹‚´Í£ñwNâ{'yöá~±tÖ’ ‹áhZPüTb à ó«„2¯Ql«ž\‹z9Ð6ú…¼ª•”UöCÁ©/Ù8‡ôÞ3Ñð[0üøO,o·ýîFК¡¦ðOðzzY3Ж% Ö… ›SÜàº{/—ä“Ä!'k³9ÏczÕwtÈ‹9Vƒy²ùÉg·³‡»ŸQY+»¾A%å¢ß# 5½@iÒ/B"ˆÑ¢à­”}å\†y ?b^iÓr ¹ƒ±C´²Ío¾V[ò.%ǦÝ À^Øí ÿx–¾×`âì¯,Pú¥Ý|{ú„µ±9Ž HNÅ“$Ö¦_Óɉ ëëÒœ«ÔesyʃÅì o@¦dHõŸ°Z'KzùRMqãN÷^çìùÔ4ö_ÁÂë y)¸Å®IŽÂ†º?ßàØr›ÃÏÑ¢ž’Ð×ךž`"TèÒä­tÞ‡|g}#ašæj7Kj“8½¾ºó‘MB좫|Q5%ûn²KëëðDÊàrBÆ Ä™ •—†ÁyUEü÷–CMNfvò·~ÅA zW*Ê„‹ cÈ•°•—=¦,®òèƒÎB¢4¸‹Q©uÝØÅiªßíd ÜÒfÌ%Wó6L•èö*I ·1š2w¬0'ßI{ÛÙì–u8Úâ"HôŸ0+´‡ãÈ•ªTz×Ö¥p\Op̤­n3…šf)EìÂMŠyY®¡Œcë¯å?挨 ú¢@kZÔýœËãú—ÅoLZèX."ÒÜ\»éðqE“‚#íï¢Dš™ÆÖ†ZZÛh‚Ú3×´~ { êHX7SÎN=ªyzàš'¿±iÔ‡tu.Á|EÂÇœŠþnwš@;Q3ć¥ºv›‡–‰ç*ðÔŠÂ*ë_P¢ö¹ùûÂG,QÊ•½µ!ø¡.í!Z´8©Ð0Ï%ÖeI„èŒ8p‹œPÆÀ`{…rDìW2¡&í¦)—ºRG2³®ŸéΖ‰ö.ÉûÄ:p™'~uKWRâoõ=/~&èjÝÿ"ØÙ_ª¼#ÃÇÇô­æø®.Vê#¶,¨<ü¤7å{Uyß~­Rx^kÄ)m—@ÓbE†ÜP¶'këu+oõØF1tÕê¸ÇÜwPù5x¶. ÇI*SnÂ,’Háõ-¤EúL§sßÃEŸú& [‰Q<†îý$ÅåžØ©C¸ºH:7\5ð+'bÕ!«äâ’ëáÌž ³Äur9 n~ãè³O#kµgÞÛTÍ¢Ò¿lKr-sÛŸͰÌÖ´w/§ÃyFee¾44©ÄªOõ´RÄSN®7!›J³†”Î!å¤!¡at,M7¼=;¿MÙûùfù³þ¦£¤>`ò²÷¡t2fàÍl|PŸÕ"A”Ï’DJöãGÈ&îBÀLºúìSº)°r 0<ù(ÇÛJ»znm­M1Ü¥p©Ý]Wkc.†¤ß›}$Í‹R–C*C»8vÈ<‰\OÃEí!†à~:2Ïb'3èŸ{äþ¶™¨¨JôgL.ìÎv¸xÈAƒád¼FÁ¸û•,k#È„Ï \0ö‘³ÉU¯Ìµëk«Ä8ñeãÈsÜ~=öôY]‰A¹`½æäÚi“H)a·Ïâ$•´:y†[H„1åxØ‘Ëð50¨ýç¥ ôEúZÓÛ`Æ ýÁÅâÇ©rÓ‡WÈgÁ£ËeXjL§F={§ÐE2Ô5Ίq®Î»ÑS"õ˨ýžpSæþ~¼^¶œ›"ÒìB¬›I·ßaúФórî ›œáKÂjwÖ?(–›tXÑmd².èKçpÑp™äY1. ɪZœì” 0„h½Mˆ«éB˜>ÑùÂU³GB>]ÿpÜñÁžéªÕPÆ”/ªA"Ïá}T采 ]fÁ§èLÌÛaÓ^Lê{p#éQ1´ªtSµ-3+³O¬Ú¹¢.äaF˰hž·ÊÓˆüßQáßÕkœï)Bsé:â2±POIÔñ:áW; fãÒe¸Kxõ&§W߉ _Vá„•Rðñ#m‘×bC½˜œ¤MÜHsTdS±/"²0N|MrEÇ †u1X†¿@ϯ¡ØÉoF€=¨íRíMôæåÒ‰Ë!üpÖ,ý _ŽÜcÙ{Ñ =ÇýG«Ø‹Tpç ›ÏoNh!^¯SÚ‘†€µúóáEq5ßf®Ž¨[èî^J&îóh7ãør%‰^Ëqt©§£Í@ºÞ{éŽEÙcïwŸIY³‚H7ç¡ÃÒ9JWçiØr2è¸ ×µêׯ«:]¤ i‹o2y‡]—Ü_´h>Ú„`Êë Ä‘õP„ŠºÖµÐ§[pN⊋ HŠ2¡}¬ÊbË+v£6gøÝ¶4æÃïÐså§r0먑*Aee±~ý¾dóòáÞq0(Sé8-1\ÃԂ͈{7vé)éÓ4¬FMžLD™×‹-\Êô` ˆ3£É´cÏ13öŽ}ûÌx¡cüq¢GKº#%O»ucb3€ôdÂ’bÄ8›rh PßzÁ_ûci¾zŒL³64WíF·ûíÒË|—«_çͽ¥L€4¹ÌóE_É_É>ÒÌËÅð²«JÐ93¹Æp>õÊvõ(•À-®M¾³«õ *ûeüÇE ×%Æ{)§šQë&Ý=²ä†áS[| À®¦¾àRÈôCƒ£Ÿ¾*þ!m#’hÀ-&ï<Äè@ö|˜0M±L ±Àað?'Ü"<^¢NÂ?=P"ÑtµüTp…•4Ι‰Ñ×@"Œ?=2ÒV»¼#Ÿï´@”JHÈ9ý×}còµÉ¤—ïïPíyè ÀÇ=ã £ð¥¯ÞT5ŽZËhùŸyøE×:axǽ¼ZÃA½LˆHÏÝ ŽÍžÛZ‚ÿ|M»%ò³P¡»£œè§³åW;SÙïBø,¥*S«Q ÉØNeÁ~| >Œ›öÈ¢óŒ¡)Ý’t/Žý åÔUËø¤•á Ï]Çà~‚{·K{ˆø³­#^× S꯿` æ£Õ^ú ÃФMá–²ûágü ”&)&}YÌ™í]ãéÎÕïΛ5×Lû›y kN`Û®ª†ÙîOu4|ψêÅm\s§`F³sC=´ÌÉp'õbÞ/ˆšÇR4JUoAÙ¹cyéOb×ûŽ8 ½oÖ@Å®#ðE!° V˜¿‰í"©D±³Ö–Ð(  ÛT¸Ñ!?}ÇÁW'ù$¨a·!u]-ƒ§]‘ZsJ‹^·,|Ì4Kq2€‚Ý!–4<¢kÜÒʦÄ0³Ä%¥’xm#ÖcKØôhRVÀ7QܯºwcàáM«®!>€|…jçw¼ÁùT?ÛÀ çZŠØ<,üƉ40– ~|Þn~;§+"4芃ôeà v1¾2ÔL~]¬?¯¦Ë Ó œþÞÈ"éuéïZsvÏ"®Pdu…È•V¨Ú@üV;Ä×›œžÔ:ÉûÓåîïFž8™ E9Z°l̵¬©k«)…Šhþ„®^‚…•Aw´­¦)[8;9u»N-nù3±}õN憄8/ ÿUÊ]ÈÔ¨ˆ•Ÿ>Òm|È’NLtÜï-pE”3lïÆ.<' ްû©0L(°r9 K¨ô#ñ| ´Š3³šRó7ÏÔy&š8 ض,’$öWº?±sb¬e*¡”Ã|BûØL)>=n„%€§ 1ÈýéÊÐ'ÑSµÝŸ’ë ßJÆQýk C øåÇ}géÏK~d±^$’7s–îï·}‰º“(‘°…â×»?d™w­î«q *ÉÈщEÊ=PŒŠÂ¡Æ“±Äð£L2~îªÈ÷£Ä<‘•½û2Å yrËóüŽª2š»"ž¸nê¶ìsf-üsš—e K(ôÞ1ƒëþ”Ùl4vR®K­×ß”¤y·¬"J®é¬ÇwÃßÛª`%uñÔ$ÀÚÝ8d,œúŸ—+".±ãù™Í¾ŠÒHBtKá`}8Œ?}÷´Áœxt|s´ï/gÂ9ˆf»yUœ3èR&¼4àR‚†×“cæØxÿéŠMG#ËÊòa‰õo>*RÄH®“DAðÁ8jHåd¬•Aý¾`Âñsx˜{^~7탵[fãYkÅ»x²˜oñµ»U=› ¢Ü!-#ò’ ÀK~¦Uá ’2JË*`öG‹A¿ßÕé!ïÓ½ÙC±…•·fO?©UkKà´2´A ÇL®CfÉi ²½]y*:×0ÓÕÎxôøÉ-D 8kßjAìÕ,HYÝ"?œ¿Åî7^ Œ_š•ãBDõ.Lÿ˜w¢G7MÛ%jôj(]%XÆ;·–á×R¸^ʆDû·ûNp;Tc@ÍmQ¯N0$ÐðÉÚ²M„Ô½ðBº¡ü87Å*ks>6²®bxúE$ãši-sN`ü!RÝ_mX²£•%˜t6PTÄ5ðxFoT~fµZ x "ã5ÃE™)EQí2Gôoýb–9@‡‹„vÞeÇ :ñäá˜Â5VõFZ³/Œ˜»ÁgO‚¦“ÑcrUî]P`öJ6ëê(NÂl4›ç¹[öSž î|¹àæxW¶¢‡ŒmG³M윌‹m¾ËÕ¥±Ò—-÷¦E5 è¤Èlý²õàrúúÒ§ $XìÌH/XÒ1:Ó¿-\pî®idªÌ}a7Ü’/f/ú’(¡K¡\…PˆÚɵñN:^¬» ù±×ÀcÞ‚sÒÀ óõy¸J{üK0ÜÂßdÉH¨ëdzÓWI¸Ô.÷§ƒ®Æ›1 bµys8Ù €„ØâM0«OeŒ]Ës¬’ VÆ–{_t9D0UßÊóÌJ±ç=ÈÆQ¤•Ú'™xÛks<XŠ2]PØŽ´³™:fR¢z2C€åÚäW¢~ µ<ÑS „YŒ™üâ¾/š vŠpu·>&ÒÐQ˜ì¢«2)Æ$î“6Ì9ö7–¹¿#S‹žæv+²|f,2˜ÆŠÄ×…¶Ï&S¥æÑ|%ð¾mÜÛFýÝ*›ý©4°#ðS-=e8Á½ T"±mˆ=ý· LZe”½QómJ ÉÉPhÀZžpŒ½×U ›”‚“ëžYzå=7Ä€T^|+sº™ðôì³ÌÄ¥ðGA?ûú,EàYջРzo ñѳ›ô ¸¹èæMÑÀQMI? ÷ÅR/ÙŠÍz•¡l‡ˆúc‚'ö–ñ(<ù¶ÎfLÖ?F¸‹.5݃QœÈåI; ~yX‚°™ÕøÃIH$‰÷‰{‚EhéC%¿Ì0íÙôJBªìÄÞO,0¥ õðHÈ«ýÉêˆÌ4Z’qH“„°"~b/Š5“[fŽnl^°›ÁSIŸ'Mž)š{ B0JЦž®wrtr¢ÅÃò &rã4D’…Òÿ%´V4RÁ ª]Ù k¶A•÷yñ%·¸%„L~F>˜JÌ;Ðó+ZÞÖg\ö¥Æ†ã¡¡¶Ð¼y§ ¯·ñ­9ìË{à€ùJÀ(ìE£ñQ÷|B¹ç‚†Xþ»/%ISÁÿ ô%aBÍ f/މÕÝ”ÞF¶'žç›»É•g¿ÝHºy¼% Â@ûeü+vãáÓüÇŸ¢ŸÍ¨²L—#¯žP›ÃÇ]€é(Í­Ø]ËRÖ{)tÅ>¯Î&„êøEå«ùgÅål( Ñ"³ØDDܲlÖiNk -‡ß𠉯 ~‚¨Ÿ±£Èù†eÎrƒ… ů” uŒ“Ÿ&]Åß ²X ¨í •Œƒ‘¥.ÚÂÈ£Ӆ;ó“fÑÐ0™ ¢ñR$§c¤<ÛÉñ0ÀÀP ËÅ?ø¨·›Ý´if_ü­ã|X†)–GÌìÕ…Æ^ÑNÐÞÈú‚ê·“0 Ps&-éPênNy½ ·Rµ§ãÆÒ/MýLyßæµ;þѳ‘bVд@Ïoݶ÷©Yã2¾{1¨ÅÆ&ðí•ãcÙ¿Ñ e¿5—XÃÛb‹y:xª¯)¼øî¥V¹Y'Û]‚5Ëå9•MBM¨‰\ž/€{øTe‹7†sdüÇù„b“¸¬ßyñ ’êå¡ …‚[Iš|º•ò¯ñ òZ¶Úr;3V)x®Óþ+§Ë93q2‚Q°œ€0¥];\o`bµñF|9•NNi÷M˜`¸nDäN—qú!¹>ä”Ï  ÿa:ü€ý³øÁŸ j“ŽôA‹ƒ,ò ÜÅòfÍCSË®ó§afbÂD›õíæ(ZÐ’Öñ™Ùäuøî[‰hsÔ,÷ð­7Õ™ÀNêñ^öì:‘ÝþŽzX,­÷I™šh¢›MX7““™.˜—íÄph†­ÛA›%M±žêx;LÛ³'ËD×àˆ_´<(žÞ÷%²™ƒ‚´´g4 It—ª~é‹Od.\?^´ûöÍýÁMýÊ3ë*Ýn[º´ qc_{eôrMG‘& Ô$Ôx¼RrhâòÕM Æ®äÂ/¯UûŽCCv8´ýM¢¼¼%÷ı÷³:b%R?.üÒÄ€ivŒ™ 6Ë$G˜ç6~iÛIôTtœ•L’ÿÿxW¢œ~™]Ìh‘¹%@w‘^ 6S^¢lYv0%”bàkwÿâŠòWµ¨SþîÇéУÈó…í\ڞ΋E˜ŠûíÓ±„g í«øIýÑ)P§©s¼ÚŸåfžJæ’tª*ö‰CO²ß á Ín-j £¬bjþ›,Ñ)—¹î0±ƒöå¥tˆ‹ñi×z¨¾×=y'. ·fk:/_5 ‘ˆÉ×5ûƒ0±À†ƒ…¨­ÕVœõðÙS[¦žlkš‡ëÙµTŒÅA¤Üב©”EoëÜ™‚JJ^’Š%õÃ×j¼‘®›æ´¸ízóã’tDe½x½ló‰0¿‘”*ý‹Ø®²É8{„àçä:æþQO=Á¸`·.=FOVÊ="õ´FQ“žï=º0U OàwÖÊIÓ0î[tÞŸíI0ß½¤$8GdlÎ!\o—§Zç¬ EÜÝÏì¯R>?¬V:z‡ÂKžT½ZœX\ )íZa~¨˜ò·$rX*nü¤5XŽ™©!+zj¯·0¼ÇwÛÏ­B§{Uœ ¼oXRÎ~(@®(Sw5v1†êôÝï?{3A‚+ ?Ñ‚[a†ÐË?Û5Eêýºå®dš`bÕˆk¸Jvàëg7Ãy …rÈQZ`ç1ºSÑÔV8öSL<j|vrñVýMZåb2é’Ù®»—@w´É%è¸)¾þ=¨¥5A!| 럧[ŸH•l[±`XçFš,˜û«Ñ±2¹Ug¤I4jLzqºÇHØåˆÙo®ÙÛ½§ðB  SX¹°L™gàÁçÊRu:Ü_MÌJØk É"¢à•ø1»{ëZ`‹Q< 0ÀJëš„]lXÔ%”|ÿJ$¿Cë»v#ð±3ú)ð¦æ°'>ÈŽÊ£¾Ô¸f\Œ'‚™u>uw·j_ ÍqõSþ½ƒZþ%Ÿ•Ÿ`³‚)ûLd­eÕ2>BÊp›‰‹}_a3±È/LYe¹I³o'‰)eŽsÔ¶Û“íŽúÀvKÂdÜÃgÁ&çL` Ìá9Ï ¨ú°Ðg¿ô|.Žwœûµ˜&Ú^@Å瓯”"1“¬‘[èŒöðÒÉh©\Œ8}œ°ÑQö1ýx¢[ ]Në¥Ð]ƒå¹{-gIrÓä§gÏb¿-üÊíV0k _¯kš‰«¨7I‘¿LΧÑÇ-–ÕCÊŸÝËNo“übâ+x˜Ý¶=›£¥~JæÖˆ<¸NN„B µ°ÐPfÛí}Z]“)êÄKbñJìdž>è@çËÿ‚é–€T<üvjFÄ$ãßbÎÔs'åãiäfpýÌ>Ãhú$9ÏE=^>×ZVü9I`¥t‡Žeœ×UعËÑÍ”ù…’—£:a—È¿Cù»l×}0Kç;ŒfjNÎA=ªy ‘Ù—/ ¡ Ö±RÅ£´6c~‡¹ŠD/©œÕ2Ô~ú&£uNë4³Ö-4ü4¾´´2"Re\uG°Åm&“ßÍöyŽœeÚ[J?eoOTÝÜ¡ÃÎxàCªSÀRæAô.¶`”:uÇ»þÄàˆ«tÍÜB šÇfóƒÔÏ'LtŽé órÈWЧý9pýÜØ‰ý’qË_Ó6»²˜L´$³ÜøÖ™Oó®¦Í:~eÈàë{*¬U>»)™Ê$‡K9X*æ`…žAmnð‘éòÔs¬ÒYvÈŠ×æ#YïÕÒïбû2è,Ë`­%º=@Ÿlº“o|’aÈ´Ž3R~.õ‹bX³ ¼Åfj‹óÞÑü}ºp"ëA~¢Öˆ¶7à¡Æ­xˆÕòšæ›<ãà`/7wŽõq1ð%ÚŸ©µ‹öÓýª#Z7/9"̷ԷاA«‰RyDà¼È.:¶Ÿ¤A„ƺ¢¼ôï¾Ì@@Ó;Ž„úU—žÐÖçç²ò:#LΤjÔ~˜÷ŸÇ ©ä‹+çõüÏ7mH¼¬(¬NuÜ·YOna7®Ò„•»Æ.HUjL³/칞NÀ}Í—}šÎ‘åï¶zñ’"e‡çEèu #žNºq‚rd€8»ÈQ;güãQYç›ÓàOXï¡ïw䘈é‚Xˆå«v¸óÛkÕ%*Äóм<­¯vžÂ£Sy]ËŸ‚jÜb½iù3»îI2v‰Õ­#½€ý-xR–ï¾mèFx¦1ÈâæÑ›…‘‰Uf)ÒG–½¸ BùÁ™£ŒâÃG~ëéòúÈUéAð.Üny†n)âpŸ€ï¤·H¤AæÃ“Á¥¡–÷8XÓÇ÷ý}Ð\ãÍ£ÏØÓ§£'…qþEËïP±,@ÜC%»Æ ËÖh€œŒ» ¢Íó¤ ;uÐÈ.ûá¹—?~=pW5mAßÔ'üvå ¢;Nâ\"Ú+-–p:㶘‡„°PÔ\÷Öu…ˆ'¶·ü>Á"8²W¢ä¿9«ªÜj+-$ͶPÑôõ¦é?µõ¯ñ¢Ÿæô’¿¹Ëƒ¡ìѰƒ™ÙºüÖÚJŠh¶©ú ›ðÇ¢J}Š´Ê²3m®zò :áÙ±_< $ K_Ö/?$]e‹±Ò¥Êäº ¦ë&WT†.ªé×å– ³OÅ’BÀ}T@d>³§ÕmuN›¢÷ñÓ櫓PÄú¡ ?`µvÎ[nl¬oçõË\ð0³7Xäj Ü{š¬26=$ð Fa *Cœg4ÈRÏã›°+—¤§Š%ÔPyyZĤKëÙœ+â &vÚÜ,àÝ~gfù5½ç(‡ºIì°báéPì'®¿¼ÏÊŠß'ךÙÖÊ£þè/ÿ˜jÃ{ bcQìLeSb¥^<c½VòžùèEÒ,Oð[øAÊ9|·n–("3N+¯–£9Cg›¦ ÚîÕ¿S}u¶Ç`Pª2`¾³ã:…;NfÆxÓêÁÏî}·N *Ãy|eGÌÓYG`ó/T5êÆv}^]¥Kv6Bìʮ֣G˜øÝ)MJkñ™„]ù”`Lï(pAVjZdhãÛÜ$‚s&¦:¦¥â‹Ó—¢ŠÊ\ÿ’÷ ™–¨8To™ˆ³37°è¶¾T&ÐÜçD«"‘æ® ]¡µ׸f– ƒD©Ì\tàSp¸xО¶¨cì¿[¿zy‘ŽüpU¡÷hÖœ€ú`Ân1‘72Èöùî«VˆÍƒ{oªªXà™ázN·3BõÿXÝf},ÈÿPÆöP雳ħõhø ÂÚìÜb4†ºÀÈ•¹­ ­Ö½Æ~«|3U5?ìj½ÿ.9Z¾˜6¹ãÍÉŽÃJãYR-ˆ=¹‘VR­ï¥êtôb¥ƒ E÷¡‡¢nï¿ï›”κ‚™Ç 8tJU%õ)?P=i_´Âƒä(æXÏõïá¤ÜÁj4“–ïŽÏ hö62¥I#wš^§ÉZàõ¬ÛT¦;Xß“A+{‚Ø«—\ø-锿”Tùô…ñD³!Êã'jøõrHõ›xk=¥¹)Â,Þ/–†œ…(uMe¦oˆ¤E~µ ¼ÇÛ¿WNó»KŠlXš1{z2®_ÚqKÄ’D¹Ü0úYð+ý’Wo^Zá]m2rf õ« £oIš†jÚb|U|ÿ²M *Û¤a Œ&wÈ/› 1óð|ìgçUËÐnÁ6Ü­] Jè%›ƒœþÓ¾m…®l5ÁÆFyánáB&OùùK}Ù7á~$¹=kÞˆ*…)^ž…Èåª}/ƒˆ0R»C˜mH{ÐÄJ‹^5Z¦åWˆ¤|*y:CÆS.Yj§63óV|ðÛ‡áÀ°\‘ªÈ7ç„ë¯XKE³>0[z¡¼=%c¹£Ïß±e|%«d "¤·yÌzà ;íÀ¥Ø#Æi9+[ä ¥3“õ—ÑÇk¹=çÕW>¹·;úÖ_y3î·¨0ÙC»6ØÐö1 ²I¼íGø+Éh¦Þ‘[hR—¦%¥¶± ïOôõñ¨¤<â WÇWÇX™€|%…9kî=ø[µ›¿ðÏuï.OÌV8÷Rû•€þ¶èBÌÇ—DÊaÐ# “®Éà#KžÆ”4â÷á òô¿)hÄ™x§ÆO“G³Ðž ¸›vníâ«ÓJ«R(´ƒÀg4LÑͲ¿OP“ 0ä"¸”áhš¹û]hNÊç\ðm¨¹¾dñ›O‰½Êç×­7)¦ûsbò±1ñ‹ð'"7 /¬ü¡nºî³"õÐUôHJf¤~øÜ}D!÷¢¬2®_ÙbQzøṎ•œï'±$åúeý‰µø²ó6¶––¶DFI¨vÅìÁ1ú ¹rIÊ’\"g—b¼¬ƒ”J—Å5ô8cY2ÎzŠ; '` ÏþqyN_wO/–u,sërje©øN\[¼ivn¦šZe©¦Åñ=¼åñ­ñ ÃYêÔà˜w¶d=‰Gíq !)O²CÛƒÙ˜ vR´ñóÀR=¬µtqCÌô¬[âõåšµrq'°CNŠºÂÑAra*l@0>½ÞÌÌø²!Ñï2‚}ä˨ÓÏôbLõÄÍBøÔ¤œ†{ðƒ[=¸<óMòùcOjR²v ‡h¾½–æÁ%´BfžžÞ”{ªæ”æ>\WÒ@êi¬¼~™RóôÂpCˆå€0 QÞí¹õ ¶ÁdM68u6ÿB“išÿ‚8Õµ¶øÛÛÃh+Œÿ@‡¢êãЫÎù´x`D¬ú«ˆ¡Ýd@ýI;^ðЧoì ]V6µmÛk?;BÌóÑæõ[›2Ó¯yY­¨ äÈÙˆ©SÜãtІ‚8õ‰4ô¶h&`+~|–ÆŽ5o ”¬Ôd_T«®Z´çJ·dºœZ.Ъ ʼnØí!üý‰üÖ{¬Z©Cqkåä!z”Ka’!I½¹]Žg=<г•nü˜:jÛ=R„ù’¼×Rm÷ÇÏæí½þH^ÄP™íßR—brØ~Ñ\Duñ±PäèîIIˆC712¯ûœbC¡ÈêXmû nr@D|Ä·3Jµ›ÈO;·ru—ÈȤ¶éÊ«ÖPÉlàë­Ó8@“ÎÏ«Ù¢ú/BŠVÁ ^àÏš0ØíÐü}ÉKÛ¥±‰§'‚0ʳ ¥nr„É›Sº$™õ¢t G›wm”64Õ$\úxhíˬeîÖº7ÖÖÍ–ótU«}J@Ñ÷]´õÝÿ±'cý˜nt7Ÿ”Æ@ò™g2Ì%ª¦›uU•…í! êMf¸Za(ÀâE¢ ¯âÃ)ˆi©“|IñÍ~»{ôG´‘^ÎX0íæ¡û‘Þ[D>öÞÂîv„b?Ú̾iÈ”öíG5«¼K <^cDw^Lq%·öZˆØDÎ:- «ëÐ%Ñy®DÍô ¼Rs!ö$¼a Eêg-8_áèÞá‚·~%–í\n=GeüÞ êMé6Û‡÷3z@ñOgÕ2V±ÌaôÆT7jMNJlD®0Vµ¨^Ä* ;°À“›ò^‹9Ér&sq¶õÓ ÈÒk~~ÒÃPÜ€ a˜¿Zfö™˜¼Ú© ƒ¶Tæ êæÊ=¼)òï@FåÆsäö¼-°]2&Ì3ãmü0 ¿óýްJtšø¡<Š›Ôš@Ö\¼¡ˆbw¦xÇSò,áGà˜<5 Q5ŠÔÕâ0-yØ7Ì€/:F¦ÕãöUpÛÀÇ¿qÃ'ýyUaÒäVDn*àí~«ìáÈ¢Å`WEnúÏy‡šó¥&ËÐöÉÝáÙ–·EìWÉÚc\P {Dÿ\Ã|±¦ã»& F£+Wìóho¦BÁÊÊü>/Ž·üA…8¾þ÷ëƒæw±K±q1XÁÚŽiåEm{ïj¨d7_­´µ " ææ²9Dù³`Ë´Ñ rYsÇ׳B ÂÔ·ó!G#ʙ͕7èpÕY¦‡7ý$è7èyã#Me?7v]½º¿æõ&Îóže±U­’°Qïê–-;ò5Ú¯‘Ù¹ö)¿%ÉÚÈXŽŸypl¬lû(§aËÞjdvÏê Ì~DŒ¿³6y;ôLžŠ&X‘AY´çÐ#eÀÉÛ“º•w§;p ¾"_cßÕô‰ÞywFÓÁ nûDÈ›qÖUä–2±²X]äT,(È:óÈ”éùm¦a¬—Gqv~§¿{f/_ŸÃZÄd2pè“ÞÛ£Æ<ÚXD(Tl]‚}Œÿ4ÐU[aƒCÐAC[„m°¤ˆ!”kŠÝ#ƒ®aH3•*Ñ,äDZñ2Â]·3ÆÏeßEê…!­¾ç³‰švñÔýTHšÙd²(¦æQ•õ&bŠ|ÉBW'n±G{{HËØÓ^þqAZå)_:ˆG6º†Y©Œ’OŽºó®™Üþ]§£«G¼¨üáuä Ù» ”>è»[(Û/fxîË^ôqˆØð~és³njµ¡%î…!À·‰[ZT“x† ®Á=yÙ<*^dgð%h QíÐ9˜H„U^Zýn°!{ÂÊšf.Q_Céï ­ÐIÐDq–Õ&™#׋ŽÊ[ñóðí»¸FA:º÷°{‹éiä)… ì¶5Ø› 1F†Û>[¸{FÞ,yМ—Ãó Q·šÉnA.jtXârª~‚IKî%š:> Èܲ•Aq1^Änµø 3¬œ7…õ ˜Pøø£Œ Ì]€ëwm¶‚¤>4ˆûÖ2¸ßIõ¼ïžSRúX4—m¶yŸ0» |O/øØoÆ`8Õ `•ôÎ"²1¦„àSƒ„mªœað%ì«Åÿó›í endstream endobj 340 0 obj << /Type /FontDescriptor /FontName /MBIYHI+Iwona-Italic /Flags 4 /FontBBox [-225 -2961 1487 1117] /Ascent 750 /CapHeight 690 /Descent -230 /ItalicAngle -12 /StemV 50 /XHeight 450 /CharSet (/a/b/bullet/c/d/e/f/ff/fi/g/h/hyphen/i/k/l/m/n/o/p/question/r/s/t/u/v/w/x/y) /FontFile 339 0 R >> endobj 319 0 obj << /Type /Encoding /Differences [11/ff/fi/fl/ffi/ffl 33/exclam/quotedblright 37/percent/ampersand/quoteright/parenleft/parenright 43/plus/comma/hyphen/period/slash/zero/one/two/three/four/five/six/seven/eight/nine/colon/semicolon 61/equal 63/question/at/A/B/C/D/E/F/G/H/I/J 76/L/M/N/O/P 82/R/S/T/U 87/W/X/Y 92/quotedblleft 97/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z 124/emdash] >> endobj 314 0 obj << /Type /Encoding /Differences [15/bullet] >> endobj 203 0 obj << /Type /Font /Subtype /Type1 /BaseFont /MQMSHZ+CMMI12 /FontDescriptor 324 0 R /FirstChar 58 /LastChar 118 /Widths 313 0 R >> endobj 205 0 obj << /Type /Font /Subtype /Type1 /BaseFont /JEIAJT+CMMI8 /FontDescriptor 326 0 R /FirstChar 105 /LastChar 110 /Widths 311 0 R >> endobj 186 0 obj << /Type /Font /Subtype /Type1 /BaseFont /KBXRLW+CMR12 /FontDescriptor 328 0 R /FirstChar 48 /LastChar 55 /Widths 317 0 R >> endobj 204 0 obj << /Type /Font /Subtype /Type1 /BaseFont /GUNUDE+CMR8 /FontDescriptor 330 0 R /FirstChar 43 /LastChar 49 /Widths 312 0 R >> endobj 187 0 obj << /Type /Font /Subtype /Type1 /BaseFont /TMCDBM+CMSY8 /FontDescriptor 332 0 R /FirstChar 0 /LastChar 0 /Widths 316 0 R >> endobj 177 0 obj << /Type /Font /Subtype /Type1 /BaseFont /MOOGIM+CMTT12 /FontDescriptor 334 0 R /FirstChar 33 /LastChar 121 /Widths 318 0 R >> endobj 127 0 obj << /Type /Font /Subtype /Type1 /BaseFont /VDRGEW+Iwona-Bold /FontDescriptor 336 0 R /FirstChar 44 /LastChar 122 /Widths 322 0 R /Encoding 319 0 R >> endobj 134 0 obj << /Type /Font /Subtype /Type1 /BaseFont /QEETBO+Iwona-Regular /FontDescriptor 338 0 R /FirstChar 11 /LastChar 124 /Widths 321 0 R /Encoding 319 0 R >> endobj 135 0 obj << /Type /Font /Subtype /Type1 /BaseFont /MBIYHI+Iwona-Italic /FontDescriptor 340 0 R /FirstChar 11 /LastChar 121 /Widths 320 0 R /Encoding 319 0 R >> endobj 192 0 obj << /Type /Font /Subtype /Type1 /BaseFont /MBIYHI+Iwona-Italic /FontDescriptor 340 0 R /FirstChar 15 /LastChar 15 /Widths 315 0 R /Encoding 314 0 R >> endobj 128 0 obj << /Type /Pages /Count 6 /Parent 341 0 R /Kids [122 0 R 131 0 R 169 0 R 174 0 R 179 0 R 183 0 R] >> endobj 193 0 obj << /Type /Pages /Count 6 /Parent 341 0 R /Kids [189 0 R 195 0 R 200 0 R 209 0 R 222 0 R 235 0 R] >> endobj 253 0 obj << /Type /Pages /Count 6 /Parent 341 0 R /Kids [250 0 R 267 0 R 279 0 R 291 0 R 304 0 R 308 0 R] >> endobj 341 0 obj << /Type /Pages /Count 18 /Kids [128 0 R 193 0 R 253 0 R] >> endobj 342 0 obj << /Type /Outlines /First 7 0 R /Last 119 0 R /Count 4 >> endobj 119 0 obj << /Title 120 0 R /A 117 0 R /Parent 342 0 R /Prev 31 0 R >> endobj 115 0 obj << /Title 116 0 R /A 113 0 R /Parent 31 0 R /Prev 39 0 R >> endobj 111 0 obj << /Title 112 0 R /A 109 0 R /Parent 39 0 R /Prev 107 0 R >> endobj 107 0 obj << /Title 108 0 R /A 105 0 R /Parent 39 0 R /Prev 103 0 R /Next 111 0 R >> endobj 103 0 obj << /Title 104 0 R /A 101 0 R /Parent 39 0 R /Prev 99 0 R /Next 107 0 R >> endobj 99 0 obj << /Title 100 0 R /A 97 0 R /Parent 39 0 R /Prev 95 0 R /Next 103 0 R >> endobj 95 0 obj << /Title 96 0 R /A 93 0 R /Parent 39 0 R /Prev 91 0 R /Next 99 0 R >> endobj 91 0 obj << /Title 92 0 R /A 89 0 R /Parent 39 0 R /Prev 87 0 R /Next 95 0 R >> endobj 87 0 obj << /Title 88 0 R /A 85 0 R /Parent 39 0 R /Prev 83 0 R /Next 91 0 R >> endobj 83 0 obj << /Title 84 0 R /A 81 0 R /Parent 39 0 R /Prev 79 0 R /Next 87 0 R >> endobj 79 0 obj << /Title 80 0 R /A 77 0 R /Parent 39 0 R /Prev 75 0 R /Next 83 0 R >> endobj 75 0 obj << /Title 76 0 R /A 73 0 R /Parent 39 0 R /Prev 71 0 R /Next 79 0 R >> endobj 71 0 obj << /Title 72 0 R /A 69 0 R /Parent 39 0 R /Prev 67 0 R /Next 75 0 R >> endobj 67 0 obj << /Title 68 0 R /A 65 0 R /Parent 39 0 R /Prev 63 0 R /Next 71 0 R >> endobj 63 0 obj << /Title 64 0 R /A 61 0 R /Parent 39 0 R /Prev 59 0 R /Next 67 0 R >> endobj 59 0 obj << /Title 60 0 R /A 57 0 R /Parent 39 0 R /Prev 55 0 R /Next 63 0 R >> endobj 55 0 obj << /Title 56 0 R /A 53 0 R /Parent 39 0 R /Prev 51 0 R /Next 59 0 R >> endobj 51 0 obj << /Title 52 0 R /A 49 0 R /Parent 39 0 R /Prev 47 0 R /Next 55 0 R >> endobj 47 0 obj << /Title 48 0 R /A 45 0 R /Parent 39 0 R /Prev 43 0 R /Next 51 0 R >> endobj 43 0 obj << /Title 44 0 R /A 41 0 R /Parent 39 0 R /Next 47 0 R >> endobj 39 0 obj << /Title 40 0 R /A 37 0 R /Parent 31 0 R /Prev 35 0 R /Next 115 0 R /First 43 0 R /Last 111 0 R /Count -18 >> endobj 35 0 obj << /Title 36 0 R /A 33 0 R /Parent 31 0 R /Next 39 0 R >> endobj 31 0 obj << /Title 32 0 R /A 29 0 R /Parent 342 0 R /Prev 11 0 R /Next 119 0 R /First 35 0 R /Last 115 0 R /Count -3 >> endobj 27 0 obj << /Title 28 0 R /A 25 0 R /Parent 11 0 R /Prev 23 0 R >> endobj 23 0 obj << /Title 24 0 R /A 21 0 R /Parent 11 0 R /Prev 19 0 R /Next 27 0 R >> endobj 19 0 obj << /Title 20 0 R /A 17 0 R /Parent 11 0 R /Prev 15 0 R /Next 23 0 R >> endobj 15 0 obj << /Title 16 0 R /A 13 0 R /Parent 11 0 R /Next 19 0 R >> endobj 11 0 obj << /Title 12 0 R /A 9 0 R /Parent 342 0 R /Prev 7 0 R /Next 31 0 R /First 15 0 R /Last 27 0 R /Count -4 >> endobj 7 0 obj << /Title 8 0 R /A 5 0 R /Parent 342 0 R /Next 11 0 R >> endobj 343 0 obj << /Names [(Doc-Start) 126 0 R (page.1) 125 0 R (page.10) 211 0 R (page.11) 224 0 R (page.12) 237 0 R (page.13) 252 0 R] /Limits [(Doc-Start) (page.13)] >> endobj 344 0 obj << /Names [(page.14) 269 0 R (page.15) 281 0 R (page.16) 293 0 R (page.17) 306 0 R (page.18) 310 0 R (page.2) 133 0 R] /Limits [(page.14) (page.2)] >> endobj 345 0 obj << /Names [(page.3) 171 0 R (page.4) 176 0 R (page.5) 181 0 R (page.6) 185 0 R (page.7) 191 0 R (page.8) 197 0 R] /Limits [(page.3) (page.8)] >> endobj 346 0 obj << /Names [(page.9) 202 0 R (section*.1) 172 0 R (section.1) 6 0 R (section.2) 10 0 R (section.3) 30 0 R (section.4) 118 0 R] /Limits [(page.9) (section.4)] >> endobj 347 0 obj << /Names [(subsection.2.1) 14 0 R (subsection.2.2) 18 0 R (subsection.2.3) 22 0 R (subsection.2.4) 26 0 R (subsection.3.1) 34 0 R (subsection.3.2) 38 0 R] /Limits [(subsection.2.1) (subsection.3.2)] >> endobj 348 0 obj << /Names [(subsection.3.3) 114 0 R (subsubsection.3.2.1) 42 0 R (subsubsection.3.2.10) 78 0 R (subsubsection.3.2.11) 82 0 R (subsubsection.3.2.12) 86 0 R (subsubsection.3.2.13) 90 0 R] /Limits [(subsection.3.3) (subsubsection.3.2.13)] >> endobj 349 0 obj << /Names [(subsubsection.3.2.14) 94 0 R (subsubsection.3.2.15) 98 0 R (subsubsection.3.2.16) 102 0 R (subsubsection.3.2.17) 106 0 R (subsubsection.3.2.18) 110 0 R (subsubsection.3.2.2) 46 0 R] /Limits [(subsubsection.3.2.14) (subsubsection.3.2.2)] >> endobj 350 0 obj << /Names [(subsubsection.3.2.3) 50 0 R (subsubsection.3.2.4) 54 0 R (subsubsection.3.2.5) 58 0 R (subsubsection.3.2.6) 62 0 R (subsubsection.3.2.7) 66 0 R (subsubsection.3.2.8) 70 0 R] /Limits [(subsubsection.3.2.3) (subsubsection.3.2.8)] >> endobj 351 0 obj << /Names [(subsubsection.3.2.9) 74 0 R] /Limits [(subsubsection.3.2.9) (subsubsection.3.2.9)] >> endobj 352 0 obj << /Kids [343 0 R 344 0 R 345 0 R 346 0 R 347 0 R 348 0 R] /Limits [(Doc-Start) (subsubsection.3.2.13)] >> endobj 353 0 obj << /Kids [349 0 R 350 0 R 351 0 R] /Limits [(subsubsection.3.2.14) (subsubsection.3.2.9)] >> endobj 354 0 obj << /Kids [352 0 R 353 0 R] /Limits [(Doc-Start) (subsubsection.3.2.9)] >> endobj 355 0 obj << /Dests 354 0 R >> endobj 356 0 obj << /Type /Catalog /Pages 341 0 R /Outlines 342 0 R /Names 355 0 R /PageMode/UseOutlines /OpenAction 121 0 R >> endobj 357 0 obj << /Title(Dicelab Manual) /Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.3)/Keywords() /CreationDate (D:20091125105809Z) /ModDate (D:20091125105809Z) /Trapped /False /PTEX.Fullbanner (This is pdfTeX using libpoppler, Version 3.141592-1.40.3-2.2 (Web2C 7.5.6) kpathsea version 3.5.6) >> endobj xref 0 358 0000000001 65535 f 0000000002 00000 f 0000000003 00000 f 0000000004 00000 f 0000000000 00000 f 0000000015 00000 n 0000013769 00000 n 0000214008 00000 n 0000000060 00000 n 0000000101 00000 n 0000016557 00000 n 0000213885 00000 n 0000000146 00000 n 0000000187 00000 n 0000016613 00000 n 0000213811 00000 n 0000000238 00000 n 0000000277 00000 n 0000016669 00000 n 0000213724 00000 n 0000000328 00000 n 0000000355 00000 n 0000016725 00000 n 0000213637 00000 n 0000000406 00000 n 0000000432 00000 n 0000016781 00000 n 0000213563 00000 n 0000000483 00000 n 0000000509 00000 n 0000022814 00000 n 0000213436 00000 n 0000000555 00000 n 0000000594 00000 n 0000022869 00000 n 0000213362 00000 n 0000000645 00000 n 0000000676 00000 n 0000031303 00000 n 0000213235 00000 n 0000000727 00000 n 0000000755 00000 n 0000031359 00000 n 0000213161 00000 n 0000000811 00000 n 0000000862 00000 n 0000038726 00000 n 0000213074 00000 n 0000000918 00000 n 0000000944 00000 n 0000038782 00000 n 0000212987 00000 n 0000001000 00000 n 0000001032 00000 n 0000050457 00000 n 0000212900 00000 n 0000001088 00000 n 0000001127 00000 n 0000050513 00000 n 0000212813 00000 n 0000001183 00000 n 0000001231 00000 n 0000061247 00000 n 0000212726 00000 n 0000001287 00000 n 0000001337 00000 n 0000061302 00000 n 0000212639 00000 n 0000001393 00000 n 0000001430 00000 n 0000061358 00000 n 0000212552 00000 n 0000001486 00000 n 0000001529 00000 n 0000072948 00000 n 0000212465 00000 n 0000001585 00000 n 0000001618 00000 n 0000073003 00000 n 0000212378 00000 n 0000001675 00000 n 0000001721 00000 n 0000073059 00000 n 0000212291 00000 n 0000001778 00000 n 0000001820 00000 n 0000085266 00000 n 0000212204 00000 n 0000001877 00000 n 0000001918 00000 n 0000085322 00000 n 0000212117 00000 n 0000001975 00000 n 0000002018 00000 n 0000095925 00000 n 0000212030 00000 n 0000002075 00000 n 0000002113 00000 n 0000095980 00000 n 0000211941 00000 n 0000002170 00000 n 0000002202 00000 n 0000112555 00000 n 0000211850 00000 n 0000002260 00000 n 0000002296 00000 n 0000112611 00000 n 0000211758 00000 n 0000002354 00000 n 0000002388 00000 n 0000112668 00000 n 0000211680 00000 n 0000002446 00000 n 0000002477 00000 n 0000114048 00000 n 0000211603 00000 n 0000002529 00000 n 0000002557 00000 n 0000116323 00000 n 0000211525 00000 n 0000002604 00000 n 0000002632 00000 n 0000002900 00000 n 0000003131 00000 n 0000002684 00000 n 0000003019 00000 n 0000003075 00000 n 0000210351 00000 n 0000211021 00000 n 0000004249 00000 n 0000005259 00000 n 0000004130 00000 n 0000003203 00000 n 0000005203 00000 n 0000210517 00000 n 0000210686 00000 n 0000004992 00000 n 0000005120 00000 n 0000005141 00000 n 0000006660 00000 n 0000006811 00000 n 0000006962 00000 n 0000007117 00000 n 0000007273 00000 n 0000007427 00000 n 0000007583 00000 n 0000007733 00000 n 0000007885 00000 n 0000008041 00000 n 0000008202 00000 n 0000008363 00000 n 0000008524 00000 n 0000008686 00000 n 0000008847 00000 n 0000009009 00000 n 0000009171 00000 n 0000009333 00000 n 0000009495 00000 n 0000009658 00000 n 0000009821 00000 n 0000009984 00000 n 0000010147 00000 n 0000010310 00000 n 0000010473 00000 n 0000010636 00000 n 0000010799 00000 n 0000010962 00000 n 0000011118 00000 n 0000011381 00000 n 0000006297 00000 n 0000005372 00000 n 0000011268 00000 n 0000011324 00000 n 0000013823 00000 n 0000013594 00000 n 0000011466 00000 n 0000013713 00000 n 0000210207 00000 n 0000016837 00000 n 0000016382 00000 n 0000013921 00000 n 0000016501 00000 n 0000019868 00000 n 0000019693 00000 n 0000016935 00000 n 0000019812 00000 n 0000209784 00000 n 0000210067 00000 n 0000022925 00000 n 0000022639 00000 n 0000019992 00000 n 0000022758 00000 n 0000210854 00000 n 0000211138 00000 n 0000027026 00000 n 0000026851 00000 n 0000023049 00000 n 0000026970 00000 n 0000031091 00000 n 0000031415 00000 n 0000030952 00000 n 0000027111 00000 n 0000031247 00000 n 0000209496 00000 n 0000209926 00000 n 0000209640 00000 n 0000033843 00000 n 0000036627 00000 n 0000038837 00000 n 0000033724 00000 n 0000031565 00000 n 0000038670 00000 n 0000036415 00000 n 0000036543 00000 n 0000036565 00000 n 0000038458 00000 n 0000038586 00000 n 0000038608 00000 n 0000040410 00000 n 0000048057 00000 n 0000052541 00000 n 0000050569 00000 n 0000040291 00000 n 0000038989 00000 n 0000050401 00000 n 0000047845 00000 n 0000047973 00000 n 0000047995 00000 n 0000050189 00000 n 0000050317 00000 n 0000050339 00000 n 0000056239 00000 n 0000058748 00000 n 0000063182 00000 n 0000061414 00000 n 0000052422 00000 n 0000050721 00000 n 0000061191 00000 n 0000056027 00000 n 0000056155 00000 n 0000056177 00000 n 0000058536 00000 n 0000058664 00000 n 0000058686 00000 n 0000060979 00000 n 0000061107 00000 n 0000061129 00000 n 0000065582 00000 n 0000068160 00000 n 0000073115 00000 n 0000063063 00000 n 0000061579 00000 n 0000072892 00000 n 0000211255 00000 n 0000065370 00000 n 0000065498 00000 n 0000065520 00000 n 0000067948 00000 n 0000068076 00000 n 0000068098 00000 n 0000072680 00000 n 0000072808 00000 n 0000072830 00000 n 0000075014 00000 n 0000079852 00000 n 0000086858 00000 n 0000085378 00000 n 0000074895 00000 n 0000073282 00000 n 0000085210 00000 n 0000079640 00000 n 0000079768 00000 n 0000079790 00000 n 0000084998 00000 n 0000085126 00000 n 0000085148 00000 n 0000091654 00000 n 0000098470 00000 n 0000096036 00000 n 0000086739 00000 n 0000085532 00000 n 0000095869 00000 n 0000091442 00000 n 0000091570 00000 n 0000091592 00000 n 0000095657 00000 n 0000095785 00000 n 0000095807 00000 n 0000103577 00000 n 0000108067 00000 n 0000112724 00000 n 0000098351 00000 n 0000096190 00000 n 0000112499 00000 n 0000103365 00000 n 0000103493 00000 n 0000103515 00000 n 0000107855 00000 n 0000107983 00000 n 0000108005 00000 n 0000112287 00000 n 0000112415 00000 n 0000112437 00000 n 0000114104 00000 n 0000113873 00000 n 0000112918 00000 n 0000113992 00000 n 0000116380 00000 n 0000116148 00000 n 0000114202 00000 n 0000116267 00000 n 0000116491 00000 n 0000116546 00000 n 0000116607 00000 n 0000209432 00000 n 0000116976 00000 n 0000116999 00000 n 0000117024 00000 n 0000117091 00000 n 0000209022 00000 n 0000117644 00000 n 0000118109 00000 n 0000118587 00000 n 0000118922 00000 n 0000121106 00000 n 0000121354 00000 n 0000123716 00000 n 0000123941 00000 n 0000125954 00000 n 0000126185 00000 n 0000128178 00000 n 0000128408 00000 n 0000129618 00000 n 0000129843 00000 n 0000140911 00000 n 0000141419 00000 n 0000164583 00000 n 0000164952 00000 n 0000191495 00000 n 0000192042 00000 n 0000208718 00000 n 0000211372 00000 n 0000211450 00000 n 0000214080 00000 n 0000214253 00000 n 0000214421 00000 n 0000214583 00000 n 0000214760 00000 n 0000214980 00000 n 0000215236 00000 n 0000215505 00000 n 0000215765 00000 n 0000215880 00000 n 0000216004 00000 n 0000216114 00000 n 0000216205 00000 n 0000216243 00000 n 0000216371 00000 n trailer << /Size 358 /Root 356 0 R /Info 357 0 R /ID [<320748F14DBC72AE6FA0B23B43F595BF> <320748F14DBC72AE6FA0B23B43F595BF>] >> startxref 216714 %%EOF dicelab-0.7/docs/dicelab_manual.tex0000644000175000017500000010356311303206024014255 00000000000000\documentclass[12pt,a4paper,rail]{article} \usepackage[latin1]{inputenc} \usepackage[pdftex]{graphicx,color} \usepackage{microtype} \usepackage{iwona} \usepackage{multicol} \usepackage[linkcolor=blue, colorlinks=true]{hyperref} \pdfinfo { /Title(Dicelab Manual) } \setlength{\hoffset}{0pt} \setlength{\voffset}{0pt} \setlength{\oddsidemargin}{0pt} \setlength{\topmargin}{0pt} \setlength{\headheight}{0pt} \setlength{\headsep}{0pt} \setlength{\textheight}{\paperheight} \setlength{\parindent}{0cm} \setlength{\parskip}{.2cm} \setlength{\tabcolsep}{.2cm} \addtolength{\textheight}{-2in} \setlength{\textwidth}{\paperwidth} \addtolength{\textwidth}{-2in} \clubpenalty = 10000 \widowpenalty = 10000 \displaywidowpenalty = 10000 \begin{document} % title page \thispagestyle{empty} ~\\~\vspace{3cm} \begin{center} \rule{\textwidth}{1.5pt}\vspace{4mm} {\Huge\bf Dicelab Manual} \rule{\textwidth}{1.5pt} \end{center} \clearpage \thispagestyle{empty} ~\vspace{\stretch{1}}\\ \begin{minipage}[b]{.18\textwidth} \includegraphics[width=.8\textwidth]{copyleft.pdf} \vspace{2.0cm} \end{minipage} \begin{minipage}[b]{.8\textwidth}\small \setlength{\parskip}{.1cm} This document is part of Dicelab, and as such, this document is released under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. Dicelab is distributed in the hope that it will be useful, but {\em without and waranty}; without even the implied warranty of {\em merchantability} or {\em fitness for a particular purpose}. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Dicelab; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA \end{minipage} \cleardoublepage % table of contents \tableofcontents \cleardoublepage \section{Introduction to Dicelab} \label{sec:dicelab} Dicelab is a computer program to calculate the probability distributions of arbitrary dice rolls. This can be used to analyze games and design games, and perhaps it even comes in in some more serious scenarios (as if there was anything more serious than gaming!). To allow dicelab to analyze any dice rolling scheme, and not just a few predefined ones, it uses a specific language called "bones". The bones language was put together by Joel Uckelman, and both his and my work are inspired by and based on the program "roll" by Torben Mogensen. So assuming you are in the middle of an intense table-top roleplaying session, and the future of the whole federation of stars depends on you making the right decision, you might want to know what the odds are. If we assume that you have to roll 3 dice with 6 sides each, remove one of them (the lowest), sum up the remaining ones and compare with a threshold that depends on the situation and your skill, then you could check your odds to beat a threshold of 10 with the following input to dicelab: \begin{verbatim} count >10 sum keep high 2 3#d6; \end{verbatim} which would yield the following output: \begin{verbatim} 0 0.800926 1 0.199074 \end{verbatim} Almost 20\%, the federation has seen worse times! Or imagine you got tangled up in a long standoff in risk, armies have built up on both sides and the decisive final battle is getting closer. An opportunity to disrupt your enemies actions has arisen, but what exactly are the odds for each round in the battle? In risk the attacker rolls 3 dice, and the defender rolls 2 (assuming has has two or more armies left). The highest attacker die is then matched with the highest defender die, the second highest attacker die is matched with the lowest defender die. For both matches the highest wins, ties go to the defender. So each round of battle, a total of two armies are destroyed. The outcome probabilities for the number of wins of the attacker could be calculated using dicelab with the following input: \begin{verbatim} let a = 3#d6 in let b = 2#d6 in count( (<(high 1 a) high 1 b), (<(high 1 low 2 a) low 1 b)) \end{verbatim} Which would result in the following output: \begin{verbatim} 0 0.292567 1 0.335777 2 0.371656 \end{verbatim} You can clearly see where the name of the game comes from! As you can hopefully see, dicelab is quite powerfull and capable to precisely calculate the probability distributions in complicated dice rolls. You will also notice that the input language is quite complicated and that the results are sometimes hard to interpret correctly. This manual hopefully helps to understand dicelab and the bones language. \section{Installation and Usage} \label{sec:installation} Depending on your operating system, there are a couple of different ways to get dicelab up and running. Unless stated otherwise, the files are available from the follwing URL, where you can also check the availability of new versions: http://www.semistable.com/dicelab/. \subsection{Building from Source} \label{sec:building} Should you have the necessary tools and a liking for this, want to modify dicelab or if you cannot find an easier way to get dicelab onto your machines, you can always compile it from source. You would need to get the dicelab package from the URL mentioned above and unpack it on a reasonable modern UNIX (e.g. Linux) system with the necessary build dependencies insatlled. Dicelab uses autotools, so you can simply run \verb|./configure| and \verb|make| to build dicelab. You will need GNU make, gcc, flex, bison and treecc in reasonably current versions to build dicelab. Should you have problems building this manual, then that is probably because it uses some non-standard tools to create teh graphics. Just use the one from the web page for the time being. \subsection{Packages} \label{sec:packages} The easiest way to install dicelab on a Linux system or something similar is to use pre-built packages provided by your OS community. In debian you could for example install dicelab directly with synaptic or your package manager of choice. Should packages for your OS not be available, pester the relevant people or the author of dicelab! In the time they try to fix it, you will have no choice but to build it from source. \subsection{Windows} \label{sec:windows} Dicelab is originally a UNIX program, and the whole mode of operation will feel a bit awkward under Windows. Due to the surprising large popularity of this legacy OS, pre-built windows binaries are available in the same location as the regular sources. Please note that dicelab is not a windows GUI program that has a graphical user interface, to use it you will have to let go of your mouse and work in a command prompt! \subsection{Running} \label{sec:running} Dicelab is a commandline program that is started, reads input and produces output. While this might look awkward to some, especially those that come from a culture of graphical user interfaces, it is in fact very powerfull and also way cooler! So you would have to start dicelab under a command prompt in windows or a shell under UNIX. It does accept a few commandline options and switches, the full syntax (which you can also get by entering {\em dicelab -?}) is as follows: \begin{verbatim} Usage: dicelab [options] [-f ] Options: --help -h -? print this text --version -v print the program version --print-tree -p print the parse tree (for debugging) --eval -e evaluate the statistical distribution by re-rolling --calc -c calculate the distribution --count -n specify the number of rolls used with --eval default is 10000 --roll -r roll the dice as specified, will also be used if no other action is requested --threshold -t cutoff threshold, results with a probability less than this value will be discarded by some operations when using --calc File: --file -f read the dice rolling specs from the file specified, use stdin if not supplied \end{verbatim} The typical use case is to start dicelab with the ``-c'' switch, but without a file. It will then read form the standard input allowing you to use it in some kind of interactive mode. As a quick check you should try this: run \verb|dicelab -c|, then enter ``d6;'' and press the enter key. You should see a list of results from 1 to 6 all having the same probability (0.166667). You could then enter another request (e.g. ``d5;'') and finally stop the program by pressing \verb|Ctrl-C|. In some cases it is very time-consuming to do the maths for a dice rolling scheme, you can then resort to just re-rolling many times and summing up the results by using the ``-e'' instead of the ``-c'' switch. If you do that with the examples above, you will see roughly the same results, but with less accuracy. This can be affected by specifying a larger number to roll with ``-n''. The calculation mode is normally perfectly accurate, but in some cases even this mode has to make comprimises, most notably with ``infinite'' throws, e.g. when you reroll and add every time you roll a 6. In this case dicelab will stop once the probability has reached a given value ($10^-7$ by default), you can modify this with the ``-t'' parameter, but you should hardly ever need to use this. Instead of calculating the distribution of a dice roll, you cann also just do a single roll, which is done bu using ``-r'' or no mode at all. Instead of entering the input by hand, you can also write to a file and instruct dicelab to read that file with the ``-f'' parameter. This is especially handy on UNIX, where you can use a she-bang line to turn a dicelab input into an executable. you could for example take the following file, make it executable with \verb|chmod +x testfile| and execute it directly. \begin{verbatim} #!dicelab --calc --file sum 3#d6; \end{verbatim} \section{The Dicelab Language} \label{sec:language} The most difficult part of using dicelab is to understanding the language and being able to express your problems in it. Unfortunately this is very hard to avoid, so you will have to deal with it. This part of the manual should help you get started and act as a reference. At the end of the day however, expressing something complicated in the bones language will always remain a bit of a puzzle and should be seen in a similar way: an opportunity to grind your brains against something instead of a hassle! To save space and make reading easier, all examples will from now on be typeset next to the relevant output they produce when using them with \verb|dicelab -c|. Where necessary some part of the output is ommited and the relevant lines are replaced with a single line containing \verb|...|. You are encouraged to try out the examples as we go along, to get a ``feel'' for the operation of the program. It is also certainly a a good idea to modify them slightly to find out what happens! \subsection{Introduction} \label{sec:introduction} Let us look at the most simple example, the distribution of a single die: \begin{minipage}[t]{.5\textwidth}\begin{verbatim} d6; \end{verbatim}\end{minipage} \begin{minipage}[t]{.5\textwidth}\begin{verbatim} 1 0.166667 2 0.166667 3 0.166667 4 0.166667 5 0.166667 6 0.166667 \end{verbatim}\end{minipage} There is already a bit more to it than meets the eye: \begin{itemize} \item The input is broken into {\em statements}, each statement will be processed independently. Statements are separated by semicolons and are only processed when the respective semicolon is seen (of course! otherwise it would be impossible to process a statement like \verb|d6 + 2;|). \item The input is read linewise. This is only for efficiency reasons, a statement may be scattered over as many lines as you wish, and a single line may contain many statements (at some point the output will become a bit hard to understand though). \item You can use spaces and tabs to make your input easier to read, but it will not change the meaning of a statement: \verb|d6;| and \verb| d 6 ; | will return the same results. \end{itemize} A statement can be made up out of different syntactical elements, two of which are used in the example above: the ``dice'' operator \verb|d| and a fixed number. You can of course use dice with different numbers of sides, or make up a statement that does not contain the dice operator at all (e.g. \verb|42;|, quite boring!). Other simple operators are \verb|+ - *| and \verb|/| which are simple arithmetic operations. To make things easier to understand you can also use braces to structure your input. Try the following examples and see whether you can understand the reasons for the output: \verb|d6 + 2;| and \verb|d(6+2);|. In the first case a dice is rolled once, and then the number two is added to the result. In the second case 6 and 2 are added up, and the result is used as the number of sides for the dice. If you are the adventurous type, you also have tried \verb|d d6;|, a roll that is quite hard to roll with real dice, and \verb|d6+d6;|. Adding up dice quickly gets tedious if there are many dice to roll, so there is the repetition operator \verb|#|, using \verb|3#d6;| does however not yield the desired result, but an error (``result is not scalar'') instead, you will have to use \verb|sum 3#d6;|, which is just ashorthand for \verb|d6+d6+d6;|. The reason for this is very fundamental to the understanding of dicelab, and you should take some time to make sure you understand it. A dice roll does not necessarily return a single number, but might return a set of numbers, e.g. when rolling multiple dice. Dicelab does not know what you want to do with this set, so it can't just add the dice up. You might e.g. multiply them instead or pick the highest. The result dicelab displays has to be a single value, a set with only one entry. So rolling \verb|2#d6| returns a set with two values, \verb|d6+d6| only a single one. The \verb|sum| operator used above takes all values in a set and sums them up, resulting in a scalar value. In a similar way \verb|prod| multiplies all values in a set and \verb|count| counts the number of values. All are reducing a set to a scalar, the latter one does not make too much sense yet as all our sets had the predetermined lengths. But imagine the input \verb|count (d6 # d6);|, this will roll one die, then use the result to determine how many dice to roll and count them. This of course leads to the same probability distribution as \verb|d6;| alone, summing it up instead of counting might be more interesting. There are some operators that are similar to the ones already covered, but have not been covered yet: \verb|%| which is the modulo operator, the to-the-power-off \verb|^|, scalar concatenation \verb|.| whch turns \verb|3 . 4| into ``34'' and the unary minus operator. Numbers can be negative, but many operators refuse to work with negative numbers, it is e.g. very hard to roll a dice with a negative number of sides! Of course these operators are very basic, so we need a couple of slightly more complicated ones: The already mentioned repetition operator \verb|#| will take the set passed to it, repeat it and build a new set from it. The range operator \verb|..| will build a set of consecutive numbers, e.g. in \verb|sum 1..6;|. In a similar way the list concatenation operator \verb|,| can be used to combine sets, e.g. in \verb|sum(d6,d4);|. Sets are in fact lists, which means they do have an order. The \verb|perm| and \verb|sort| operators randomize the set order or sort sets. The \verb|rev| operator reverses the ordering in a set. This will only be usefull in combination with the \verb|first| and \verb|last| operators: \verb|first 1 perm 1..6;| for example returns exaclty the same as \verb|d6;|. This is only logical, as it builds a set of numbers from 1 to 6, shuffles them and then uses the first one as a result, effectively emulating a dice with playing cards! This operator can also be used to remove elements. e.g. in \verb|sum drop first 2 perm 1..6;|. Instead of ``drop'' you can use ``keep'', which behaves just as if you would not have specified any of them, but is more readable. To avoid unnecessary \verb|rev keep first 1 rev| fragments, there is also a \verb|last| operator that behaves similar. And before you ask: there are also \verb|low| and \verb|high| operators. These are used quite often in games, \verb|sum high 3 5#d6| could e.g. be a character stat generator in a roleplaying game. There is a set of filter operators that are used in a similar fashion: \verb|count >= 5 3#d6| counts the dice that show a 5 or six in a set of three dice. Other filter operators are \verb|==| (equals), \verb|!=| (not equals), \verb|<| and \verb|>| and of course \verb|<=|. To structure your expression in a better way and to solve some specific problems, you can use the \verb|let| operator: it allows you to tie the result from a dice roll to a ``variable'' and use it in different parts of your expression. \verb|let a = d6 in a+a| for example is the same as \verb|d6*2| as opposed to \verb|d6+d6|. Similarily you can use \verb|foreach| to apply an expression to each element of a set using a variable: \verb|foreach v in A do B| will evaluate A, and then iterate over the set and set the variable \verb|v| to the current element. For each element the expression \verb|B| is evaluated. Example: \verb|sum(foreach x in 2#d6 do x+1)| is the same as \verb|sum(2#(d6+1))|. The \verb|if| operator allows you to branch depending on the result of some expression. The result of \verb|if A then B else C| is the evaluation of \verb|B| if the result of \verb|A| is nonempty, and \verb|C| otherwise. For example \verb|if > 4 d6 then 1 else 0| is the same as \verb|count > 4 d6|. Finally the \verb|while| operator allows you to use an unbounded repetition: if \verb|x| is a variable and \verb|E| and \verb|F| are expressions, the \verb|while x = e do f| is the list $v_0, v_1,\ldots, v_n$ where $v_0$ is the result of evaluating \verb|E| and $v_{m+1}$ is the result of assigning $v_m$ to \verb|x| and evaluating \verb|F|, stopping at the first $v_n$ which is empty. A good example is \verb|sum(while x = d6 do keep == 6 d6)| which calculates a d6 that is re-rolled and added on sixes; If you have longer files, you might find it usefull to put comments in your input that explain what a block of lines is doing. This can be done using \verb|\\| which instructs dicelab to ignore the rest of the line. It is also worth noting that braces can be used to make the operator precedence more explicit and the input easier to read. This section is only meant as an introduction to the operators in question, please refer to section \ref{sec:reference} for all the nitty-gritty details of an operator. \subsection{Reference} \label{sec:reference} \subsubsection{Scalars, Lists and Probabilities} \label{sec:scalar_lists} To successfully use dicelab (and understand this reference section) it is important to understand the concepts of {\em scalars}, {\em lists} and {\em probabilities}. If we look at the very simple input \verb|d6|, we will see that this dice rolling scheme will always yield exactly one result value. This is called a {\em scalar}. This scalar has multiple possible {\em values} (1-6) with a {\em probability} each. The output from dicelab is the list of {\em values} for the resulting scalar, ordered by their value, together with their respective probabilities. This means that the final result of a dicelab expression always has to be a scalar! A {\em list} in contrast is a number of scalars, e.g. created by \verb|2#d6|, the result of rolling two dice. This will not return a single number, but two, and cannot be used as a final result in dicelab. In most cases when we say "roll two d6" we actually mean "roll two d6 {\em and sum them up}", \verb|d6+d6| or \verb|sum(2#d6)| in dicelab syntax. Of course a list may contain only one value, in which case it can be used as a scalar, dicelab even uses only lists internally and does not have a seperate type for scalars. The distinction between lists and scalars is still very important, not only because the final result must a scalar, but also because many operators only allow scalars for some of their arguments. For example \verb|d6+2| makes sense, but \verb|2#d6+2| does not: you can't really ad a number to a set of numbers! \subsubsection{Grammar} \label{sec:grammar} \includegraphics[scale=1]{syntax1.pdf}\\ Dicelab accepts input consisting a number of {\em statements} seperated by semicolons, each of them will be executed on their own. In fact having multiple statements in one input is more or less the same as running dicelab multiple times with different input. Using this may be convenient in some cases, but may be confusing as well as it does clutter up the output a bit. The last statement in the input does not need to be followed by a semicolon, but it is good practice to generally end all statements with one anyway. The reason for this is that when dicelab is running interactively by just reading from the standard input (e.g. by running \verb|dicelab -c| and typing your statements directly into dicelab), dicelab will not know when you are finished with your current statement. As noted above, each statement needs to result in a scalar in all cases, dicelab will complain if that is not the case. \subsubsection{Dice Operator} \label{sec:dice} \includegraphics[scale=1]{syntax-dice.pdf}\\ In the most simple form, when the argument is a simple number (e.g. \verb|d5|), the dice operator will create a scalar with that many values and equal probabilities. If the argument is a scalar with multiple values (e.g. \verb|d(d4)|) the argument is evaluated and the dice operator executed for each value. The results from all dice operator evaluations are then combined into one scalar by multiplying the probabilities of the value used and the dice operator result. Try the example above to see! Typical examples are \verb|d6| for a standard dice, \verb|d20| for the 20-sided dice often used in fantasy roleplaying, \verb|d2| or even better \verb|d2-1| could be used to simulate a binary coin-toss. \verb|d1| is technically possible, but a very boring dice in most cases. The dice operator only accepts scalars as arguments and always returns a scalar. All input values must be larger than zero. \subsubsection{Arithmetic Operators} \label{sec:arithmetics} \includegraphics[scale=1]{syntax-math.pdf}\\ This family of operators takes two scalars as arguments and returns a scalar, performing the given mathmatical operation on them. The division operator always rounds down, so \verb|5/2| yields 2. The modulo operator \verb|%| returns the remainder of the division, so \verb|5%2| yields 1. The power operator \verb|^| return the first argument to the power of the second, so \verb|2^8| is 256 and \verb|10^3| is 1000. \subsubsection{Scalar Concatenation Operator} \label{sec:scalar_concatenation} \includegraphics[scale=1]{syntax-scalarconcat.pdf}\\ This operator takes two scalar arguments and returns a scalar that is the {\em text} concatenation of the two arguments. This is sometimes usefull (a \verb|d100| could e.g. be constructed as a \verb|d10.d10|), but in many cases it is safer to express things like that as multiplications (e.g. \verb|d10*10+d10|). The reason for this is that the results are not padded in any way, so \verb|12.3| is equivalent to \verb|1.23|, both returning 123. \subsubsection{Summation and Product Operators} \label{sec:sum_prod} \includegraphics[scale=1]{syntax-sumprod.pdf}\\ These two operators take a list as an argument, and turnthem into a scalar by either summing up or multiplying together all the scalars in it. So \verb|sum(3#d6)| is the same as \verb|d6+d6+d6| and \verb|prod(3#d6)| is the same as \verb|d6*d6*d6|. Please note that \verb|sum(2#d6)| or \verb|d6+d6| is {\em not} the same as \verb|2*d6|, as the first case adds two {\em different} dice together, whereas the second case adds a dice to {\em itself}. \subsubsection{List Size Operator} \label{sec:count} \includegraphics[scale=1]{syntax-count.pdf}\\ This operator takes a list as an argument and returns a scalar containing the number of scalars in that list as a value. For example \verb|count(2#d6)| will always return two, and \verb|count(d5#d3)| is equivalent to \verb|d5|. This operator is normally only usefull in combination with filter opertors, e.g. when trying to determine how many dice beat a given threshold (for example \verb|count(== 6 5#d6)|). \subsubsection{List Repetition Operator} \label{sec:repetition} \includegraphics[scale=1]{syntax-listrep.pdf}\\ This evaluates an expression multiple times and puts all results in a list. A good example is \verb|3#d6|, which is a list of the results of three dice rolls. Please note that this is the {\em list} of the results, not the sum. In essence this is similar to the list concatenation \verb|d6,d6,d6|. Should the expression itself return a list, then these are concatenated together, so \verb|2#3#d6| is the same as \verb|6#d6|. \subsubsection{Range Operator} \label{sec:range} \includegraphics[scale=1]{syntax-range.pdf}\\ The range operator creates a list of values representing the given range, each value having a probability of 1. So e.g. \verb|sum 1..3| returns 6. This operator is normally only usefull in combination with a loop operator like foreach or while, e.g. \verb|sum foreach i in 1..6 do d(i)|, which is the same as \verb|sum d1,d2,d3,d4,d5,d6|. \subsubsection{List Concatenation Operator} \label{sec:list_concatenation} \includegraphics[scale=1]{syntax-listconcat.pdf}\\ List concatenation is simply the combination of two lists, which of course could each be scalar. For example \verb|sum 2#d6,d20| sums up a list of two 6-sided and one 20-sided dice, which is of course the same as \verb|sum(2#d6)+d20|. Please note the usage of parenses in the last example, \verb|sum 2#d6+20| is something slightly different, namely adding a d6 and a d20 to form a single result, and then summing up two of these... \subsubsection{List Ordering Operators} \label{sec:sort_perm_rev} \includegraphics[scale=1]{syntax-ordering.pdf}\\ These operators change the ordering of a list. {\em sort} obviously sorts the list by value, {\em rev} reverses the list and {\em perm} randomizes it. Please note that for many operators the ordering of a list has no consequences, e.g. \verb|sum sort 2#d6| is the same as \verb|sum 2#d6|, in fact dicelab should optimize out the sort operator in this case. Also note that {\em perm} can be outstandingly expensive on all but the smallest lists. \subsubsection{Low and High Operators} \label{sec:low_high} \includegraphics[scale=1]{syntax-lowhigh.pdf}\\ These filter operators remove some elements from a list. For example \verb|sum drop low 1 3#d6| rolls 3 6-sided dice, removes the lowest roll and sums the other two up. You can change the behaviour by using of {\em high} instead of {\em low}, and by using {\em keep} instead of {\em drop}. This means that the statement \verb|sum keep high 2 3#d6| is equivalent to the example above. You can also omit the {\em drop} or {\em keep}|, in which case the behaviour is just as if you would have specified {\em keep}. Please note that the first expression does not need to be constant, you could e.g. do a \verb|sum high d6 6#d6|. This operator does not change the ordering of the list, and might return less than you asked for, e.g. a \verb|high 4 3#d6| of course does not differ from a \verb|3#d6|. \subsubsection{First and Last Operators} \label{sec:first_last} \includegraphics[scale=1]{syntax-firstlast.pdf}\\ In a similar fashion, the {\em first} and {\em last} filters remove entries from a list, but not based on their value, but on their position in the list. So in essence a \verb|sum low 1 3#d6| is the same as a \verb|sum first 1 sort 3#d6|. \subsubsection{Filtering Operators} \label{sec:drop_keep} \includegraphics[scale=1]{syntax-filter.pdf}\\ These also work in a similar way, but do not take the other values in the list into account. Instead they just filter on individual values, you could e.g. filter out all results less that a given value with \verb|sum drop <= 2 3#d6|. \subsubsection{Let Operator} \label{sec:let} \includegraphics[scale=1]{syntax-let.pdf}\\ This assigns a list result to a symbolic variable which you can then use in subexpressions. For example \verb|let A = d6 in A+A| is essentially the same as \verb|d6*2|. Please note that this is very different from \verb|d6+d6|, because in the example using \verb|let| above, the two \verb|A| refer to the same dice roll, whereas in \verb|d6+d6| they refer to two {\em different} rolls, which can have different values. The result is that \verb|let A = d6 in A+A| will never return 3, but \verb|d6+d6| does (1+2). \verb|d6+d6| is in effect \verb|let A = d6 in let B = d6 in A+B|. \subsubsection{Foreach Operator} \label{sec:foreach} \includegraphics[scale=1]{syntax-foreach.pdf}\\ This is a bounded iteration, if \verb|x| is a variable and \verb|e| and \verb|f| are expressions, then \verb|foreach x in e do f| evaluates e and then assigns x to each element of the result in turn to evaluate f. This will result in a list which essentially is the result of \verb|e| with \verb|f| applied to all elements. For example \verb|sum foreach X in 1..3 do d(X)| is the same as \verb|d1+d2+d3|. Of course \verb|f| can return a list for some of the evaluations, in which case the resulting list does not need to have the same length as the result of \verb|e|. For example \verb|sum foreach X in 1..5 do X#d3| is the same as \verb|sum 15#d3|, and the result of the foreach expression has 15 elements, while the result of \verb|e| in this case has only 5 (as can easily be checked with \verb|count|). \subsubsection{While Operator} \label{sec:while} \includegraphics[scale=1]{syntax-while.pdf}\\ This is an unbounded iteration, if \verb|x| is a variable and \verb|e| and \verb|f| are expressions, then \verb|while x = e do f| if the list $v_0, v_1, \ldots, v_n$ where $v_0$ is the result or evaluating \verb|e| and $v_{i+1}$ is the result of assigning $v_i$ to \verb|x| and evaluating \verb|f|, stopping at the first $v_i$ which is empty. For example \verb|sum while x = d6 do ((count == 6 x)#d6)| is rolling a d6, rerolling on a 6 and summing up the result. \subsubsection{If Operator} \label{sec:if} \includegraphics[scale=1]{syntax-if.pdf}\\ This is the branching operator. If \verb|e|, \verb|f|, and \verb|g| are expressions, then \verb|if e then f else g| gives \verb|f| if \verb|e| is nonempty, and \verb|g| otherwise. \\ For example \verb|let A = d6 in if (keep == 6 A) then d20 else A| rolls a d6 and uses the result except on a 6, in which case a d20 is rolled and used instead. %\subsection{Cookbook} %\label{sec:cookbook} % \subsection{Examples} \label{sec:examples} Count the number of dice greater than 7: \begin{verbatim} count >7 5#d10 \end{verbatim} Count the number of dice greater than 7 minus the number of dice equal to 1: \begin{verbatim} let c=5#d10 in (count >7 c)-(count ==1 c) \end{verbatim} Count the number of rolls until a 6 is rolled: \begin{verbatim} count (while x=d6 do ((count <6 x)#d6)) \end{verbatim} Count the number of rolls until a 6 is rolled, more efficiently: \begin{verbatim} count (while x=(d6/6) do ((count <1 x)#(d6/6))) \end{verbatim} Roll attributes for a new D\&D character: \begin{verbatim} 6#sum(drop low 1 4#d6) \end{verbatim} Roll on the 11..66 morale check table in The Gamers' Civil War Brigade Series: \begin{verbatim} d6.d6 \end{verbatim} Find the median of 3 d20s: \begin{verbatim} high 1 low 2 3#d20 \end{verbatim} 3d6 with rerolls on 6s: \begin{verbatim} sum(while x=3#d6 do ((count ==6 x)#d6)) \end{verbatim} Roll 7 d10 and find the largest sum of identical dice: \begin{verbatim} let x = 7#d10 in high 1 (foreach y in 1..10 do sum (==y x)) \end{verbatim} The Fibonacci sequence is defined by Fn = Fn-1 + Fn-2, with F1 = F2 = 1. \begin{verbatim} Calculate the first twenty Fibonacci numbers: let n = 20 in let f = (1,1) in foreach i in 1..n do let f = (f,sum(high 2 f)) in if ==n i then f else () \end{verbatim} Risk has battles where the attacker rolls 3d6 and the defender rolls 2d6. The highest attacker die is matched with the highest defender die and the second highest attacker die to the second highest defender die. For both matches, the highest wins, with ties going to the defender. The number of attacker wins: \begin{verbatim} let a = 3#d6 in let b = 2#d6 in count( (<(high 1 a) high 1 b), (<(high 1 low 2 a) low 1 b)) \end{verbatim} Storyteller die roll with target number 8 and botches indicated at -1: \begin{verbatim} let c=5#d10 in let succs = count >7 c in let ones = count ==1 c in if >0 succs then high 1 (0,succs-ones) else if >0 ones then -1 else 0 \end{verbatim} Combat in Silent Death is rather complex. Three dice are rolled. If their sum is above a target, the roll is a hit. To calculate damage, the same dice are sorted. If all three are equal, all are summed to yield the damage. If the least two are equal, but the third is higher, the high die is the damage. If the two highest are equal, but the third is lower, the two high dice are summed to yield the damage. If all three dice are different, the middle die is the damage. This example assumes that the dice are two d8s and a d10, with a target number of 15: \begin{verbatim} let x = 2#d8,d10 in (count >15 sum x)# let a = low 1 x in // low die let b = high 1 low 2 x in // middle die let c = high 1 x in // high die if ==a ==b c then a+b+c // all equal else if ==a a ==c b then b+c // two high equal else b \end{verbatim} \section{Feedback} \label{sec:feedback} Dicelab has gotten a bit more complicated than I originally hoped, both the implementation and the usage. Making it simpler to use, extend and maintain is therefore quite high on the list of things to do. To do this I need your help: please give feedback on what you are using it for, what you find hard to do, what you found hard to understand when using it first, what is particularily vague in the manual, what expression is especially slow and generally what you do and don't like. Robert Lemmen $<$robertle@semistable.com$>$ \end{document} dicelab-0.7/docs/syntax-lowhigh.svg0000644000175000017500000004161111303206024014314 00000000000000 dicelab-0.7/docs/dicelab_manual.log0000644000175000017500000003765711303206701014252 00000000000000This is pdfTeXk, Version 3.141592-1.40.3 (Web2C 7.5.6) (format=pdflatex 2009.9.28) 25 NOV 2009 10:58 entering extended mode %&-line parsing enabled. **dicelab_manual.tex (./dicelab_manual.tex LaTeX2e <2005/12/01> Babel and hyphenation patterns for english, usenglishmax, dumylang, noh yphenation, croatian, ukrainian, russian, bulgarian, czech, slovak, danish, dut ch, finnish, basque, french, german, ngerman, ibycus, greek, monogreek, ancient greek, hungarian, italian, latin, mongolian, norsk, icelandic, interlingua, tur kish, coptic, romanian, welsh, serbian, slovenian, estonian, esperanto, upperso rbian, indonesian, polish, portuguese, spanish, catalan, galician, swedish, loa ded. (/usr/share/texmf-texlive/tex/latex/base/article.cls Document Class: article 2005/09/16 v1.4f Standard LaTeX document class (/usr/share/texmf-texlive/tex/latex/base/size12.clo File: size12.clo 2005/09/16 v1.4f Standard LaTeX file (size option) ) \c@part=\count79 \c@section=\count80 \c@subsection=\count81 \c@subsubsection=\count82 \c@paragraph=\count83 \c@subparagraph=\count84 \c@figure=\count85 \c@table=\count86 \abovecaptionskip=\skip41 \belowcaptionskip=\skip42 \bibindent=\dimen102 ) (/usr/share/texmf-texlive/tex/latex/base/inputenc.sty Package: inputenc 2006/05/05 v1.1b Input encoding file \inpenc@prehook=\toks14 \inpenc@posthook=\toks15 (/usr/share/texmf-texlive/tex/latex/base/latin1.def File: latin1.def 2006/05/05 v1.1b Input encoding file )) (/usr/share/texmf-texlive/tex/latex/graphics/graphicx.sty Package: graphicx 1999/02/16 v1.0f Enhanced LaTeX Graphics (DPC,SPQR) (/usr/share/texmf-texlive/tex/latex/graphics/keyval.sty Package: keyval 1999/03/16 v1.13 key=value parser (DPC) \KV@toks@=\toks16 ) (/usr/share/texmf-texlive/tex/latex/graphics/graphics.sty Package: graphics 2006/02/20 v1.0o Standard LaTeX Graphics (DPC,SPQR) (/usr/share/texmf-texlive/tex/latex/graphics/trig.sty Package: trig 1999/03/16 v1.09 sin cos tan (DPC) ) (/etc/texmf/tex/latex/config/graphics.cfg File: graphics.cfg 2007/01/18 v1.5 graphics configuration of teTeX/TeXLive ) Package graphics Info: Driver file: pdftex.def on input line 90. (/usr/share/texmf-texlive/tex/latex/pdftex-def/pdftex.def File: pdftex.def 2007/01/08 v0.04d Graphics/color for pdfTeX \Gread@gobject=\count87 )) \Gin@req@height=\dimen103 \Gin@req@width=\dimen104 ) (/usr/share/texmf-texlive/tex/latex/graphics/color.sty Package: color 2005/11/14 v1.0j Standard LaTeX Color (DPC) (/etc/texmf/tex/latex/config/color.cfg File: color.cfg 2007/01/18 v1.5 color configuration of teTeX/TeXLive ) Package color Info: Driver file: pdftex.def on input line 130. ) (/usr/share/texmf-texlive/tex/latex/microtype/microtype.sty Package: microtype 2007/01/21 v2.0 Micro-typography with pdfTeX (RS) \MT@toks=\toks17 \MT@count=\count88 LaTeX Info: Redefining \lsstyle on input line 1370. LaTeX Info: Redefining \lslig on input line 1370. LaTeX Info: Redefining \textls on input line 1371. \MT@lskern=\dimen105 Package microtype Info: Loading configuration file microtype.cfg. (/usr/share/texmf-texlive/tex/latex/microtype/microtype.cfg File: microtype.cfg 2007/01/14 v2.0 microtype main configuration file (RS) )) (/usr/share/texmf-texlive/tex/latex/iwona/iwona.sty Package: iwona 2005/10/03 v.1.2 Iwona package (MW) ) (/usr/share/texmf-texlive/tex/latex/tools/multicol.sty Package: multicol 2006/05/18 v1.6g multicolumn formatting (FMi) \c@tracingmulticols=\count89 \mult@box=\box26 \multicol@leftmargin=\dimen106 \c@unbalance=\count90 \c@collectmore=\count91 \doublecol@number=\count92 \multicoltolerance=\count93 \multicolpretolerance=\count94 \full@width=\dimen107 \page@free=\dimen108 \premulticols=\dimen109 \postmulticols=\dimen110 \multicolsep=\skip43 \multicolbaselineskip=\skip44 \partial@page=\box27 \last@line=\box28 \mult@rightbox=\box29 \mult@grightbox=\box30 \mult@gfirstbox=\box31 \mult@firstbox=\box32 \@tempa=\box33 \@tempa=\box34 \@tempa=\box35 \@tempa=\box36 \@tempa=\box37 \@tempa=\box38 \@tempa=\box39 \@tempa=\box40 \@tempa=\box41 \@tempa=\box42 \@tempa=\box43 \@tempa=\box44 \@tempa=\box45 \@tempa=\box46 \@tempa=\box47 \@tempa=\box48 \@tempa=\box49 \c@columnbadness=\count95 \c@finalcolumnbadness=\count96 \last@try=\dimen111 \multicolovershoot=\dimen112 \multicolundershoot=\dimen113 \mult@nat@firstbox=\box50 \colbreak@box=\box51 ) (/usr/share/texmf-texlive/tex/latex/hyperref/hyperref.sty Package: hyperref 2007/02/07 v6.75r Hypertext links for LaTeX \@linkdim=\dimen114 \Hy@linkcounter=\count97 \Hy@pagecounter=\count98 (/usr/share/texmf-texlive/tex/latex/hyperref/pd1enc.def File: pd1enc.def 2007/02/07 v6.75r Hyperref: PDFDocEncoding definition (HO) ) (/etc/texmf/tex/latex/config/hyperref.cfg File: hyperref.cfg 2002/06/06 v1.2 hyperref configuration of TeXLive ) (/usr/share/texmf-texlive/tex/latex/oberdiek/kvoptions.sty Package: kvoptions 2006/08/22 v2.4 Connects package keyval with LaTeX options ( HO) ) Package hyperref Info: Option `colorlinks' set `true' on input line 2238. Package hyperref Info: Hyper figures OFF on input line 2288. Package hyperref Info: Link nesting OFF on input line 2293. Package hyperref Info: Hyper index ON on input line 2296. Package hyperref Info: Plain pages OFF on input line 2303. Package hyperref Info: Backreferencing OFF on input line 2308. Implicit mode ON; LaTeX internals redefined Package hyperref Info: Bookmarks ON on input line 2444. (/usr/share/texmf-texlive/tex/latex/ltxmisc/url.sty \Urlmuskip=\muskip10 Package: url 2005/06/27 ver 3.2 Verb mode for urls, etc. ) LaTeX Info: Redefining \url on input line 2599. \Fld@menulength=\count99 \Field@Width=\dimen115 \Fld@charsize=\dimen116 \Choice@toks=\toks18 \Field@toks=\toks19 Package hyperref Info: Hyper figures OFF on input line 3102. Package hyperref Info: Link nesting OFF on input line 3107. Package hyperref Info: Hyper index ON on input line 3110. Package hyperref Info: backreferencing OFF on input line 3117. Package hyperref Info: Link coloring ON on input line 3120. \Hy@abspage=\count100 \c@Item=\count101 \c@Hfootnote=\count102 ) *hyperref using default driver hpdftex* (/usr/share/texmf-texlive/tex/latex/hyperref/hpdftex.def File: hpdftex.def 2007/02/07 v6.75r Hyperref driver for pdfTeX \Fld@listcount=\count103 ) LaTeX Warning: Unused global option(s): [rail]. (./dicelab_manual.aux) \openout1 = `dicelab_manual.aux'. LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Checking defaults for PD1/pdf/m/n on input line 30. LaTeX Font Info: ... okay on input line 30. LaTeX Font Info: Try loading font information for OT1+iwona on input line 30 . (/usr/share/texmf-texlive/tex/latex/iwona/ot1iwona.fd File: ot1iwona.fd 2005/10/05 v1.2 font definition file for OT1/iwona (MW) ) (/usr/share/texmf/tex/context/base/supp-pdf.tex [Loading MPS to PDF converter (version 2006.09.02).] \scratchcounter=\count104 \scratchdimen=\dimen117 \scratchbox=\box52 \nofMPsegments=\count105 \nofMParguments=\count106 \everyMPshowfont=\toks20 \MPscratchCnt=\count107 \MPscratchDim=\dimen118 \MPnumerator=\count108 \everyMPtoPDFconversion=\toks21 ) Package microtype Info: Generating PDF output. Package microtype Info: Character protrusion enabled (level 2). Package microtype Info: Using default protrusion set `alltext'. Package microtype Info: Automatic font expansion enabled (level 2), (microtype) stretch: 20, shrink: 20, step: 4, non-selected. Package microtype Info: Using default expansion set `basictext'. Package microtype Info: No tracking. Package microtype Info: No adjustment of interword spacing. Package microtype Info: No adjustment of character kerning. Package hyperref Info: Link coloring ON on input line 30. (/usr/share/texmf-texlive/tex/latex/hyperref/nameref.sty Package: nameref 2006/12/27 v2.28 Cross-referencing by name of section (/usr/share/texmf-texlive/tex/latex/oberdiek/refcount.sty Package: refcount 2006/02/20 v3.0 Data extraction from references (HO) ) \c@section@level=\count109 ) LaTeX Info: Redefining \ref on input line 30. LaTeX Info: Redefining \pageref on input line 30. (./dicelab_manual.out) (./dicelab_manual.out) \@outlinefile=\write3 \openout3 = `dicelab_manual.out'. [1 {/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] File: copyleft.pdf Graphic file (type pdf) [2 <./copyleft.pdf pdfTeX warning: pdflatex (file ./copyleft.pdf): PDF inclusion: Page Group detec ted which pdfTeX can't handle. Ignoring it. >] (./dicelab_manual.toc (/usr/share/texmf-texlive/tex/latex/microtype/mt-cmr.cfg File: mt-cmr.cfg 2005/11/07 v1.9 microtype config. file: Computer Modern Roman (RS) ) LaTeX Font Info: External font `cmex10' loaded for size (Font) <12> on input line 3. LaTeX Font Info: External font `cmex10' loaded for size (Font) <8> on input line 3. LaTeX Font Info: External font `cmex10' loaded for size (Font) <6> on input line 3. ) \tf@toc=\write4 \openout4 = `dicelab_manual.toc'. [3 ] [4 ] [5] [6] Overfull \hbox (2.66399pt too wide) in paragraph at lines 163--174 [][] [] [] LaTeX Font Info: Try loading font information for OMS+iwona on input line 17 7. (/usr/share/texmf-texlive/tex/latex/iwona/omsiwona.fd File: omsiwona.fd 2005/10/05 v1.2 font definition file for OMS/iwona (MW) ) [7] [8] [9] File: syntax1.pdf Graphic file (type pdf) File: syntax-dice.pdf Graphic file (type pdf) [10 <./syntax1.pdf pdfTeX warning: pdflatex (file ./syntax1.pdf): PDF inclusion: Page Group detect ed which pdfTeX can't handle. Ignoring it. > <./syntax-dice.pdf pdfTeX warning: pdflatex (file ./syntax-dice.pdf): PDF inclusion: Page Group de tected which pdfTeX can't handle. Ignoring it. >] File: syntax-math.pdf Graphic file (type pdf) File: syntax-scalarconcat.pdf Graphic file (type pdf) File: syntax-sumprod.pdf Graphic file (type pdf) [11 <./syntax-math.pdf pdfTeX warning: pdflatex (file ./syntax-math.pdf): PDF inclusion: Page Group de tected which pdfTeX can't handle. Ignoring it. > <./syntax-scalarconcat.pdf pdfTeX warning: pdflatex (file ./syntax-scalarconcat.pdf): PDF inclusion: Page Group detected which pdfTeX can't handle. Ignoring it. >] File: syntax-count.pdf Graphic file (type pdf) File: syntax-listrep.pdf Graphic file (type pdf) File: syntax-range.pdf Graphic file (type pdf) [12 <./syntax-sumprod.pdf pdfTeX warning: pdflatex (file ./syntax-sumprod.pdf): PDF inclusion: Page Group detected which pdfTeX can't handle. Ignoring it. > <./syntax-count.pdf pdfTeX warning: pdflatex (file ./syntax-count.pdf): PDF inclusion: Page Group d etected which pdfTeX can't handle. Ignoring it. > <./syntax-listrep.pdf pdfTeX warning: pdflatex (file ./syntax-listrep.pdf): PDF inclusion: Page Group detected which pdfTeX can't handle. Ignoring it. >] File: syntax-listconcat.pdf Graphic file (type pdf) File: syntax-ordering.pdf Graphic file (type pdf) [13 <./syntax-range.pdf pdfTeX warning: pdflatex (file ./syntax-range.pdf): PDF inclusion: Page Group d etected which pdfTeX can't handle. Ignoring it. > <./syntax-listconcat.pdf pdfTeX warning: pdflatex (file ./syntax-listconcat.pdf): PDF inclusion: Page Gr oup detected which pdfTeX can't handle. Ignoring it. > <./syntax-ordering.pdf pdfTeX warning: pdflatex (file ./syntax-ordering.pdf): PDF inclusion: Page Grou p detected which pdfTeX can't handle. Ignoring it. >] File: syntax-lowhigh.pdf Graphic file (type pdf) Overfull \hbox (0.5725pt too wide) in paragraph at lines 284--286 \OT1/iwona/m/n/12 (-20) These fil-ter op-er-a-tors re-move some el-e-ments from a list. For ex-am-ple []\OT1/cmtt/m/n/12 sum drop low 1 3#d6 [] File: syntax-firstlast.pdf Graphic file (type pdf) File: syntax-filter.pdf Graphic file (type pdf) [14 <./syntax-lowhigh.pdf pdfTeX warning: pdflatex (file ./syntax-lowhigh.pdf): PDF inclusion: Page Group detected which pdfTeX can't handle. Ignoring it. > <./syntax-firstlast.pdf pdfTeX warning: pdflatex (file ./syntax-firstlast.pdf): PDF inclusion: Page Gro up detected which pdfTeX can't handle. Ignoring it. >] File: syntax-let.pdf Graphic file (type pdf) File: syntax-foreach.pdf Graphic file (type pdf) [15 <./syntax-filter.pdf pdfTeX warning: pdflatex (file ./syntax-filter.pdf): PDF inclusion: Page Group detected which pdfTeX can't handle. Ignoring it. > <./syntax-let.pdf pdfTeX warning: pdflatex (file ./syntax-let.pdf): PDF inclusion: Page Group det ected which pdfTeX can't handle. Ignoring it. >] File: syntax-while.pdf Graphic file (type pdf) File: syntax-if.pdf Graphic file (type pdf) [16 <./syntax-foreach.pdf pdfTeX warning: pdflatex (file ./syntax-foreach.pdf): PDF inclusion: Page Group detected which pdfTeX can't handle. Ignoring it. > <./syntax-while.pdf pdfTeX warning: pdflatex (file ./syntax-while.pdf): PDF inclusion: Page Group d etected which pdfTeX can't handle. Ignoring it. > <./syntax-if.pdf pdfTeX warning: pdflatex (file ./syntax-if.pdf): PDF inclusion: Page Group dete cted which pdfTeX can't handle. Ignoring it. >] [17] [18] (./dicelab_manual.aux) ) Here is how much of TeX's memory you used: 4517 strings out of 94101 68932 string characters out of 1165810 149851 words of memory out of 1500000 7650 multiletter control sequences out of 10000+50000 37733 words of font info for 62 fonts, out of 1200000 for 2000 637 hyphenation exceptions out of 8191 30i,6n,36p,1446b,434s stack positions out of 5000i,500n,6000p,200000b,5000s {/usr/share/texmf-texlive/fonts/enc/dvips/ iwona/iwona-sy.enc}{/usr/share/texmf-texlive/fonts/enc/dvips/iwona/iwona-qx.enc } Output written on dicelab_manual.pdf (18 pages, 224036 bytes). PDF statistics: 357 PDF objects out of 1000 (max. 8388607) 49 named destinations out of 1000 (max. 131072) 15699 words of extra memory for PDF output out of 17280 (max. 10000000) dicelab-0.7/docs/syntax-foreach.pdf0000644000175000017500000001262611303206672014251 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 388 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•[I®-¹Ç*b×ê›P€¶‡†…(ØFáå ªÞ¾yØI7ÀGùï¡:’¢HŠ¡÷¿G8ñßÿýãüÃ…óÿäþ ¥Ÿ5òŒçoçÂ5¶óÇqý¤ÏÜ>!dz¶ONãÌåS  ¯3çO QÖœ|X² /þ?íÚ;|Ú硳)¤Žõ{2L¨Ï4z¹L„é/ÃfJ`›ºÇ‰-L ”¹{ÅØVÄ\·T KÍgMŸ\çiHôsw}ýœÿôÏÕÖÿ!íŽO›ˆe@Û½5a ä­ùÆ?Ôý”èEæñ™q˜Å‘ÌŠÉžHY„r˜f£¥}F­§[0áTš›t!·æÐPœ“7‡ órìÊÊdœqáC ´$læÇ<1Y^àÃfˉlÄK$tè ¨r>h–Höj­*$íߌç]0•Ò?e׉Àô©ø™¢˜hXEOJh"â\ø X»@2¸Å~eÓGý„YDœÙ Àv0UHn뺾q¡ÂžœŽë/²|[5µ˜yÇ+z¶ÁÐPã°ÑYnÒ:ÙtSl€+©5oNŸ0X¦Î:k$™z¹Ë±mŽM- +6s¶O\Øýðj‰Oß$õ*E–Nfφ.f Â§†L‡þÓa<ÿu¤ó?‰þ?Ç_ÿv†O8ÿûˆáüãIç¢áä%>°É¶_ Gÿvò‰{¯_ܦã6™‰Éÿò éñäy,ýÛƒà ­ÁS±MZðƒºJÓÑ“tîkx›î/_v5èÈ‘>m'9EZÐqÁ)E03¾0¡Zåd 8T#¬Å‡Ž¾µ ޼£±ÃwohþgD ‰°w ¢F1ü99xÛ±œÚè@C¶ÇŠ«¸íC‡ªqcZ7|’™ZÙÆ`ƒmÄ2 ršÑíÚ â¯ÑkâŒðd•NÈU’ŸÌþDÒ®‚Èk[à}5$ŠºÎ‡æàë±r"5VæÓ¸‹ab°`m¤«ÑìLT)¿Eè!›+:µ ½­t½-þ¶Ù¤‚à–ˆÍ™µ³®”ù Ä@*im6™_­Û†Ç@Ö:W{å•Fãè&¶d$׆gç½%3gL–e8\8àœÍàÅË÷¼š‡d´¤²qƒ*ʵz,[—CN=ˆ@$˜4ìX®bXØeá…åQu%V¨0|’,'ÆcºH¸Ì˜Ñ6I_—QÓò)®öΫìtT㳕º‰ã^ä±™b>FòÏ:præ'êû§¾<É’âøCAjgíšrOeQà’Xqäóш`5}ŽbPfßuûºì}dëØv ó’÷Pa^å{1ñ(Ù-Œ‚]žÄþ0)8Ú+iWŽ™o÷›‰Ç(‡Ö:.˜;4hnÍæ×l¸í³Î¿ì€8çÞNf”y›;vŒ nøÐ‚Í/d¾æ»¸·©ò´é{¼ÖãpŽ ¤á¢$qäû¢£M%$¾KØ`óS6ýr[º¼·Ëå'á¾;”Óüó{Ç^65ÊÇæ·”€$W‚z’8ù^ï{F²rh\›:ÈÆê@§/r ìt댒Éàt-BgS? uܧ‹QaOóE@Γ¹|Šr £S!-G°ŽÝÿÅÉå oŸÜ~¨C5¬J¹œ°8¸ë‘ÔSµ¿rwÈïN1¹<áGgÊèrÂjMuëë[÷ïÛQ¤{9ªƒ´C¸íÒŒE.ØJ yJÁµá9s¢Rò³Câ-7”¹œG’Êõ˜ü*b6ÂmIfðÉÅ‹qV¤6 ñ)˜v!Šg¾®DÔT'‹É[ÔÁlJÍ(–‰˜µŠ™!X¥Ý§‹¸7¾{o¤8°)Tk»7¤i˜ ²a×Òy¹8 ]Œ™k¦cß:‡T\ž «,×" ÈfŽ&˜"-1˜§õ ÷8¬>~ÕFA€z[æ4›Ã ÅT#°ûcuÀKrj-ý§Ôÿ†V±xýàænp †O:Œ}ÌVç&Ï2Ûf²,‘áe;·I¤: BÈâñÉPC+¤PåLI<¸TÁ˜ë¼Á08!ÅíÖà¦%D.„6œãhòùŠØ—­ö9¥û¶Á"Íõ&à›‰Ó6è– ‚€š7¢|˜ÔÿJy)¢Âêê ¹CÆ‰Ž¨‡eñ¾ì¬ÛbÄOñéuy!lûÈCž˜ÌNJaV UÂ8ïRûˆg5~CL/ ´½½”©W­ó¡QêCc/JÅÅA¯%‰ kp¸‰i²öXSNg v¯€øp(¾˜%Û³AJ˜Å ýƒk˵¢E5=7›^• c,˜æ@å´M©Þ¬ãˆTQ Ü¡ij48ãy(€Õ ¤*c:q‚8¨iõ ÙµÉ_j^Ìd=¼¹›>Öp‡²¢ªJ à ò Ÿ_ðµÖ‚sW]¾ûWÞì@ÊZ+€(aE#hiòÁBý g¼…d5Rf“2ÎbR9©!h YŒ‚¨ÙZ Á±”ÒØ¡$œ+Š4 ¤Þ^ÙóxQ¼¢ˆ<Š4)ò[¡xW,Š€ó……cMJ9Š4ùhQÄ {P%xÀ}Ù-n3nQë¯ÖÊ‹{ QæW 1‚ûšû†rYkY³hiúUQƒ±À¥Vñ l "-Û5@:dV……› ”`AD‡[ÐùWÁúqâ% "¾¿[y øbç=ó­ sð—'döZ€¨º˜ÕöÈé²êøÅáÈ)ͺ̪”ú¢Z™º9³&9®ŽEÙ¶NÆ|¦~…âU»ø0vß§[ qoIOŸe[&2¶ 'Cá¡:aMÒ\:65)!@÷]жí‘ú/³ vpùööÀ¸kÔ¾–4åM<\“õä³x-‰³à=’õ^η+¯‰¯ØW¾7K¡dB*‹ ‘±wùp¬‘±ã³G÷À×gµ[d$ ¾'%9ŸÔc„í–r·j¡´žô¹ )[Õè) ïÂS¾7t~0ç)®ä¦È_ÂÔœKågƒË܉Àï½CáçPzÓän7',…&ùë•£Ô¦mÌ7aêóA[U=ÀU\ik²ç…~¢Hª(Ÿ¥]dÖ«ŽÁý*@2rÑm©I0.:øÍ¹‡\d°Zöë°ˆŒ§„‡·yK8ù-á&Œ<&Üt& %>¾èð„úx…·ˆ×['EÙñfáT®9Š~O´#A¥9æU!t‚ïbM·pHñÜOK¦€ü´Ðkª©F‹jÒ!ò7|©©&T…§ûÍkÖ¡+ÓP3Â:0:拰ꪼj²²*P‘롱4µ²«,ëe0»L%ZYõ¡!VëSi¿óª~­JM¿Vá'«ø!Y.A u¸5Ë®Mø¢% 0µI„$Ü·‰Ø?Øœ/÷¾²gAJðˆ©ËKóo‚|¬Æâ_ajê’zÙ?N¦IÁtÛ¾µËÖÀà÷·8IâpúÔÓþØ3jW3\"hñLRà^í3>ßÃþnÁ žÈܵÀ:[ƒä»>üZÞ-`M~²*I`3”‡ ©‹ýÞ!{ê‹Á%®çl€%øÓ´Ãæ÷Ú èCÈÆZ”W±ú¬qÛ#0»DÞŸ.|‰øâ†óæy9ÖëªD÷Éí±–\©<|³‡EwnpiAú„ІûÆêükçu}³ åΆ߹çÓ:ô ÓHú˜°lÛº´m˜×¶JýÖ†+ÜRBòöÞ¶m5…ù¶êú¶­Ænrî6î_úµ‡ÎzÿNvÿÆΡÁ4û–ΚêÖ‡MȺ{–Æ=åÞú—7FÿŸCßS<·”;ã²¼RîòšWÊ  )·°”Ûæô!‡¶§Ü€[Ê Žî)÷FÑ?ÃÁˆ•rn)·¯g)7ÚSnà-åvh)÷C‰ü×8x¶ç»Û ý{#HÎ ¸¥ÜK¯–H0Ó+åölx{¦Ü_,|;ŽŒ'D{Jšc¼§ÜèqK¹sL”cn)w¦ëå-å†~ö”î)7zÜRnÊrï)7V¹¥Ü`ä–r?„á]xÊ÷¦‚yO¹ )7à–rçØï)7{ÊcÛSnÀ[Êí„¥ŒòH¹â¶ù&XÊm«ZÊ ®¶”ð–rCª-å6™5å6¸ç¥9Ž[^j)7~o)7VÛSn0·§ÜÀ[ʽ #)÷¦3I¹yÀ–ró„+åÖõÖIQv¼yl)·¢ßíÅHR¹gNð]$–rn)7à=åÎ)ï)7àJ¹sJ÷”Û ëÐ¥xO¹°ŒŽù"¬”›Wõ”hK¹o)7 ±RnÀ•r?4Äj}*íWb^¶¿ÎÉ%üú_æè -™ûÏ[äã4}¤Êñɵì?ùƒ&ÿ¿â!ÛO4ÿýøÓñoL5… endstream endobj 4 0 obj 4495 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 388 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000005042 00000 n 0000004771 00000 n 0000000015 00000 n 0000004748 00000 n 0000004843 00000 n 0000005107 00000 n 0000005232 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 5284 %%EOF dicelab-0.7/docs/syntax-if.bnf0000644000175000017500000000011311303206024013207 00000000000000"Dicelab Full Syntax" { expr = "if" expr "then" expr [ "else" expr]. } dicelab-0.7/docs/syntax-listrep.pdf0000644000175000017500000000545611303206677014334 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 239 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•XI®%5Üûu‚Âóp$$ÐKÄjú,€×'#ÛUï é«]‘ž2ә޸ï/çüûû·ã›_üñÛ?.µÓçv”t¦Ž?…K¨ÇÇÄåŒ>©ž>…£Ô3Å~¤|BNáu¤tzZeÃq.‹¶áÅßáì×Ùþ¬½NwSHËZ4L¨Ô[)gl„í/ÃŽ #F¸MÓÃÀ„êPL<=÷ln+b¯k,†Á\ÒQâ™Ê8 I~®ãž¯ãwG›ã ²Œ:Á¹øcâ|¶€8Y43(ƒŽµÎaÝZ—ÞºÞýõåzs<{â÷iFöçÈ+%äã ñÖn,8›éjzÚ°?KLä`ÖxÓ8Sªkåclói¸ENO–{hg÷ÅÎÿ ìö³ŽÍ@„Ü‘íV«8Ó6|óé~Fô&æ~ŽÐ­â(fÅTO”,BÉ«Ñ\Ï^Ê1+˜pÌu–t¦׎a_#Pƒ/‡ óšx&+Qq†…èHÔ̇-xbª<ÏÍfÇIläK ä´ê ôí¨^mTƒ¤ûḧ¥’Û™÷œŒgÁg Rþ¾âí_%ı°#Xš@*¸å~yËG9ýÈN ü v°•³Öõ +|óBÅ=鎛ëoby­ª!ñÌ0lƒ¥>3F³Q/W\º1u®À‹“TëާïSãœUŠL_¹kâYt9¶µ¬ØÊÙlî——¢ž»²eÂ…… '¾ì>˜ kæw¢7yÇ^G¯ÜÒ6\æ²b^ø.ƒ™Pg—.L¨»)¤‰]˜P0!fÎLH~0-AÅŽ „˜&ÜX„˜ ˜4” ÉfBÁŽ ˜«zfBCA™ðž/Îmç3È"t´VŽLg„%†³ &}à)µ ëÖºôvÐõæè×7aᮼ13!­&¤q0!ݘ´êÈÌ„ 'aBrAâ‘™pMð`Â#3!í/LHÃ̄ݘpaB3Ð`Bʶ0!9&œÃ7ÿ‘îgD¯1˜´ä¨C̘ A†Z¦c0Î"&ÌdhÃ[œÈ{Ü“¡áeî›Ø©\Êä§ ^ðP2Ôã4<òEÈPš€ J‹ fC1Xœè/º¬GP0Á{È–Á¤wø›Éh0ëqjË0%’_caG)q0%® „W–„1›¢©"±Þw-r9hv€¹¡ó0r£ÜýÑ»r¨òà&}õ§Á. 0# T„€à+@jU@æFÅp±09Î …Ù‘hHcf6Ó§ïZ†YÁ§y€: dlenk^ ”áHǧF@’@`Iœª.&^„ok¼‚(q± IZIû U‚ˆ˜ªBŒÂUøh^-%³% I4³|t¢šŒiL¨f·m#<sÏWR ôÊ”ªÂ°ÚfàW&¤Àoþ‘o‹Âí܆k ³LCFæd baùî¢áåši¯0 Nų;—DjÊÏÚÂ3Om[D!°µEDöm‹zÿžîÒD†»Y8F‹9Öç7’%•ãÄ@n4î\*Ç2ºL¹~ ×G':¾Àån­!‹ò¹D]oknwÈ7NsJë$®5l!tV çÊê•‘7;~ªÌ“JºP¼–yñªÉ貤^飨PÙæðé6ýMƒv]¶D˜Mƒ¼32¹I3jÚ‡6 øe‰³PòZš×‹  úÌVûØž‹~JÛ%à¦ÑàÑM¤¹Í"*W,™¸é´yž 58„®usBÙ¥Ú„¦ÕI””·»dÚ‰\›]€›`[y|§—d›Øòöm/.¼¡,º¤›È xæw݆7áP»rsXí6¥[@ví†üìâ nêËð¦ßåú¦ßpÊMÀÁ‘]Á=ƒá[xÆ÷&Í?DœTÄÜD©¤»Šƒa—qþÛtàMÈMÃJFÙ¥œ[–©ÝlÍ«ÁÔœª:x–‚¼ :Šjt³ :…n×?uÜbVtô½):œ¶K:8MçæxÛEÝŒ¨º-g"ëxÁÒuŽ7ôq¶‚œ·:EÝ™ÃcWv‚þ/´wERÒÎ óɰK;‚»´kå)íZ¾I;‚›´ké!ḭ́š®Å‡´SÃj]óbؤN]ÒŽÐ.íÞ¥‚ؤÁMÚÝ3Äi}&íSœ×ôWˆ0ÂçÂÐEìï¾zÝi”ßFhŽüv%¿¯”ýSk)ó',Ù>1üÕýàþô¹€ endstream endobj 4 0 obj 1831 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 239 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000002378 00000 n 0000002107 00000 n 0000000015 00000 n 0000002084 00000 n 0000002179 00000 n 0000002443 00000 n 0000002568 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2620 %%EOF dicelab-0.7/docs/syntax-range.pdf0000644000175000017500000000540511303206656013735 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 235 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•XI®%5Üûu‚Âóp$$ÐKÄjú,€×'#ÛUï é«]‘ž2Ó™Žxÿ/çüûû·ã›_üñÛ?.µÓçv”t¦Ž?…K¨ÇÇÄåŒ>©ž>…£Ô3Å~¤|BNáu¤tzZeÃq.‹¶áÅßáì×Ùþ¬½NwSHËZ4L¨Ô[)gl„í/ÃŽ #F¸MÓÃÀ„êPL<=÷ln+b¯k,†Á\ÒQâ™Ê8 I~®ãž¯ãwG›ã ²Œ:Á¹øcâ|¶€8Y43(ƒŽµÎaÝZ—ÞºÞýõåzs<{â÷iFöçÈ+%äã ñÖn,8›éjzÚ°?KLä`ÖxÓ8Sªkåclói¸ENO–{hg÷ÅÎÿ ìö³ŽÍ@„Ü‘íV«8Ó6|óé~Fô&æ~ŽÐ­â(fÅTO”,BÉ«Ñ\Ï^Ê1+˜pÌu–t¦׎a_#Pƒ/‡ óšx&+Qq†…èHÔ̇-xbª<ÏÍfÇIläK ä´ê ôí¨^mTƒ¤ûḧ¥’Û™÷œŒgÁg Rþ¾âí_%ı°#Xš@*¸å~yËG9ýÈN ü v°•³Öõ +|óBÅ=鎛ëoby­ª!ñÌ0lƒ¥>3F³Q/W\º1u®À‹“TëާïSãœUŠL_¹kâYt9¶µ¬ØÊÙlî——¢ž»²eÂ…… '¾ì>˜ kæw¢7yÇ^G¯ÜÒ6\æ²b^ø.ƒ™Pg—.L¨»)¤‰]˜P0!fÎLH~0-AÅŽ „˜&ÜX„˜ ˜4” ÉfBÁŽ ˜«zfBCA™ðž/Îmç3È"t´VŽLg„%†³ &}à)µ ëÖºôvÐõæè×7aᮼ13!­&¤q0!ݘ´êÈÌ„ 'aBrAâ‘™pMð`Â#3!í/LHÃ̄ݘpaB3Ð`Bʶ0!9&œÃ7ÿ‘îgD¯1˜´ä¨C̘ A†Z¦c0Î"&ÌdhÃ[œÈ{Ü“¡áeî›Ø©\Êä§ ^ðP2Ôã4<òEÈPš€ J‹ fC1Xœè/º¬GP0Á{È–Á¤wø›Éh0ëqjË0%’_caG)q0%® „W–„1›¢©"±Þw-r9hv€¹¡ó0r£ÜýÑ»r¨òà&}õ§Á. 0# T„€à+@jU@æFÅp±09Î …Ù‘hHcf6Ó§ïZ†YÁ§y€: dlenk^ ”áHǧF@’@`Iœª.&^„ok¼‚(q± IZIû U‚ˆ˜ªBŒÂUøh^-%³% Iü4’¬CôA“# µÑì¶m„‡`îùJj!6ájfµÍ€‹±Š´ ÝÞ•Ö]Œ)+nŽnËlËK]]›. TF_Û ¼( ;Î&4c6Y}s–³ÿôÿMUGò.õ=Äi_©5!”4š–Ë" «®»¨=[;¡ÅªóXVk$Vó7‰Ep“Xø }“XfXMWûCb©a5Œ®y1l §.‰Eh—Xï Al‹à&±îâ´>“ö)Σ4çõöù?%è¢?¤ï¶zÝiôÃæŒõwްêß<ÂüS–lŸþê~pÿ»  endstream endobj 4 0 obj 1790 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 235 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000002337 00000 n 0000002066 00000 n 0000000015 00000 n 0000002043 00000 n 0000002138 00000 n 0000002402 00000 n 0000002527 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2579 %%EOF dicelab-0.7/docs/syntax1.bnf0000644000175000017500000000007111303206024012677 00000000000000"Dicelab Full Syntax" { input = expr { ";" expr }. } dicelab-0.7/docs/syntax-foreach.bnf0000644000175000017500000000011611303206024014223 00000000000000"Dicelab Full Syntax" { expr = "foreach" variable "in" expr "do" expr. } dicelab-0.7/docs/dicelab_manual.aux0000644000175000017500000001341211303206701014245 00000000000000\relax \ifx\hyper@anchor\@undefined \global \let \oldcontentsline\contentsline \gdef \contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}} \global \let \oldnewlabel\newlabel \gdef \newlabel#1#2{\newlabelxx{#1}#2} \gdef \newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}} \AtEndDocument{\let \contentsline\oldcontentsline \let \newlabel\oldnewlabel} \else \global \let \hyper@last\relax \fi \@writefile{toc}{\contentsline {section}{\numberline {1}Introduction to Dicelab}{4}{section.1}} \newlabel{sec:dicelab}{{1}{4}{Introduction to Dicelab\relax }{section.1}{}} \@writefile{toc}{\contentsline {section}{\numberline {2}Installation and Usage}{5}{section.2}} \newlabel{sec:installation}{{2}{5}{Installation and Usage\relax }{section.2}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Building from Source}{5}{subsection.2.1}} \newlabel{sec:building}{{2.1}{5}{Building from Source\relax }{subsection.2.1}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Packages}{5}{subsection.2.2}} \newlabel{sec:packages}{{2.2}{5}{Packages\relax }{subsection.2.2}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Windows}{5}{subsection.2.3}} \newlabel{sec:windows}{{2.3}{5}{Windows\relax }{subsection.2.3}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {2.4}Running}{5}{subsection.2.4}} \newlabel{sec:running}{{2.4}{5}{Running\relax }{subsection.2.4}{}} \@writefile{toc}{\contentsline {section}{\numberline {3}The Dicelab Language}{7}{section.3}} \newlabel{sec:language}{{3}{7}{The Dicelab Language\relax }{section.3}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Introduction}{7}{subsection.3.1}} \newlabel{sec:introduction}{{3.1}{7}{Introduction\relax }{subsection.3.1}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Reference}{9}{subsection.3.2}} \newlabel{sec:reference}{{3.2}{9}{Reference\relax }{subsection.3.2}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.1}Scalars, Lists and Probabilities}{9}{subsubsection.3.2.1}} \newlabel{sec:scalar_lists}{{3.2.1}{9}{Scalars, Lists and Probabilities\relax }{subsubsection.3.2.1}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Grammar}{10}{subsubsection.3.2.2}} \newlabel{sec:grammar}{{3.2.2}{10}{Grammar\relax }{subsubsection.3.2.2}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.3}Dice Operator}{10}{subsubsection.3.2.3}} \newlabel{sec:dice}{{3.2.3}{10}{Dice Operator\relax }{subsubsection.3.2.3}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.4}Arithmetic Operators}{11}{subsubsection.3.2.4}} \newlabel{sec:arithmetics}{{3.2.4}{11}{Arithmetic Operators\relax }{subsubsection.3.2.4}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.5}Scalar Concatenation Operator}{11}{subsubsection.3.2.5}} \newlabel{sec:scalar_concatenation}{{3.2.5}{11}{Scalar Concatenation Operator\relax }{subsubsection.3.2.5}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.6}Summation and Product Operators}{12}{subsubsection.3.2.6}} \newlabel{sec:sum_prod}{{3.2.6}{12}{Summation and Product Operators\relax }{subsubsection.3.2.6}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.7}List Size Operator}{12}{subsubsection.3.2.7}} \newlabel{sec:count}{{3.2.7}{12}{List Size Operator\relax }{subsubsection.3.2.7}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.8}List Repetition Operator}{12}{subsubsection.3.2.8}} \newlabel{sec:repetition}{{3.2.8}{12}{List Repetition Operator\relax }{subsubsection.3.2.8}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.9}Range Operator}{13}{subsubsection.3.2.9}} \newlabel{sec:range}{{3.2.9}{13}{Range Operator\relax }{subsubsection.3.2.9}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.10}List Concatenation Operator}{13}{subsubsection.3.2.10}} \newlabel{sec:list_concatenation}{{3.2.10}{13}{List Concatenation Operator\relax }{subsubsection.3.2.10}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.11}List Ordering Operators}{13}{subsubsection.3.2.11}} \newlabel{sec:sort_perm_rev}{{3.2.11}{13}{List Ordering Operators\relax }{subsubsection.3.2.11}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.12}Low and High Operators}{14}{subsubsection.3.2.12}} \newlabel{sec:low_high}{{3.2.12}{14}{Low and High Operators\relax }{subsubsection.3.2.12}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.13}First and Last Operators}{14}{subsubsection.3.2.13}} \newlabel{sec:first_last}{{3.2.13}{14}{First and Last Operators\relax }{subsubsection.3.2.13}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.14}Filtering Operators}{15}{subsubsection.3.2.14}} \newlabel{sec:drop_keep}{{3.2.14}{15}{Filtering Operators\relax }{subsubsection.3.2.14}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.15}Let Operator}{15}{subsubsection.3.2.15}} \newlabel{sec:let}{{3.2.15}{15}{Let Operator\relax }{subsubsection.3.2.15}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.16}Foreach Operator}{16}{subsubsection.3.2.16}} \newlabel{sec:foreach}{{3.2.16}{16}{Foreach Operator\relax }{subsubsection.3.2.16}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.17}While Operator}{16}{subsubsection.3.2.17}} \newlabel{sec:while}{{3.2.17}{16}{While Operator\relax }{subsubsection.3.2.17}{}} \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.18}If Operator}{16}{subsubsection.3.2.18}} \newlabel{sec:if}{{3.2.18}{16}{If Operator\relax }{subsubsection.3.2.18}{}} \@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Examples}{17}{subsection.3.3}} \newlabel{sec:examples}{{3.3}{17}{Examples\relax }{subsection.3.3}{}} \@writefile{toc}{\contentsline {section}{\numberline {4}Feedback}{18}{section.4}} \newlabel{sec:feedback}{{4}{18}{Feedback\relax }{section.4}{}} dicelab-0.7/docs/syntax1.svg0000644000175000017500000002171111303206024012735 00000000000000 dicelab-0.7/docs/syntax-let.bnf0000644000175000017500000000011011303206024013372 00000000000000"Dicelab Full Syntax" { expr = "let" variable "=" expr "in" expr. } dicelab-0.7/docs/syntax-count.pdf0000644000175000017500000000556211303206652013771 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 216 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•XËŽ,9Ýû+ò ¿_€„Äb˜%bÍ Ô³üþœgVU éª'ìp<aûÔ¿C<ø÷Ÿ_?ü=¿þ7”qÆ:ŽVβÒñÛqã–úñµq;s,Gég,éhý,y¥ž (¼ŽRÎ-Î[-û‚—|§srÜfdzÏy[Í &¶3ìh¬A4G£¥V.Äå/Ç‚•3ÝÆô´8¡ÇE”‹L¯³ºÛ†Äëž›ãX[9Z>K[‡#ÍÏu¼æëëøgÀâ´Éê‹ÜÄ_×sÌD$q¨ÒΠB :÷¾‡miS}1t}cú—í­ùœEr-$uŠiÆC)¥­ªèŽÁpöÑ®ñö;9Áàåv}Ø|ÌîÓÃãïbøÜ©ã9¢¸ÞÖÄ ý1²«Þ¡ŒfG*«™Å²Ð‚º±4¢¬=Dçž'eñ §„ÐqЬ©s)¸ív1ôuþÆX-óÅuÚð½Æ;hµ»_ᘜ¿6ºäšcÝh 5 k~¾Ž·„ñÄúÈáwiîçj/iV¶®I<[€®ƒ„ÌuAŠ Oºçù•bõ}Ò HŒ6-¥)âŽmÒ5®[ ù 4˜õü÷Œºàªê|XoEÞ“”˜×¼¶é3 ÈK›^s ^"àR{¼Ë8Ë;>°%åÚ‚‡/yÔì¿¥ö›ì§äÅys=0sý%‚4öœßéÉ •°.E®…L ã}LÈZØtÁá®å-À«€çö×öÀ$ÁÞ ×ù4ivI>.'Љ-Ù‚*ûC5ÛŒ&Åé^^[n/ !U÷!ð6s]g„;h­´3á&¹Û7%£ŒZQ<^÷…ÖûNýÈȯ y˜¤<ôeÂ!ܯòÌàGó¡ö˜#•äÓ?Ÿ‰Ô¤'©õ‡@™úy¦Ò„«c+Èdˆ§PMÃHLÉþÑ éVM¾ì%€÷†LQ æšœÃ×4ȹU9»W%»SH;=Ö¾ì¹¥í¢‘äN$ â¾ä=¼í-cîtˆÔ=ì Y¸6Š…Ü}Ãdäý-‰’r˜ )ˆ”C?””¿oANÈ xŠ‹ž×bLFœÖƒÐc®þbïúÎ…oÎòò"U¬¬7h“ÈCG‰ï:Ÿ‚e ß­Z ^%ÅÒ1þ Àî(D%,ßÇ5f6$¯ ƒaw+SÙÏú’&ÅTŸß²—ÐyZ³î²OçÈöïJ÷—ÐýG0Ê÷9SÂ/ J€XaAŒy·‚Ú»;ÅÜÙÃêi–†2ôÿBû¦Hš=)ŠñÚ-Ø»ØôjïÚ¤„vë‘5 û7 ùëFï÷„$üŸ¯ä“?¾¬}n^·ànºº¶+#Ü c:$BbU^Ùü€¨*•r—–>yÜå,o®=žùS@–z¼eHÒúž´ºó ¡w^Ÿ?ÎäM ÚôEû±§+ÚœµfHü æþ”ŸäCi•Ç'‡ ?…ßÜ΃, endstream endobj 4 0 obj 1899 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 216 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000002446 00000 n 0000002175 00000 n 0000000015 00000 n 0000002152 00000 n 0000002247 00000 n 0000002511 00000 n 0000002636 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2688 %%EOF dicelab-0.7/docs/syntax-while.pdf0000644000175000017500000001145711303206673013754 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 376 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•ZIŽ,¹ ÝÇ)âiÍà ðÂî¥á…Fwè¿h{á뛓‘é µ¨|ÔDQù$ÅoG8ñ÷ï_Î?ü#œ¿üçÈýJ?k~åÏçÂ5¶óËq}¥ÏÜ^!dz¶WNãÌåU  ¯3çW VVœ¼Y²/þ_åZ;¼Ú硽)¤Šõ{2L¨Ï4z…¹t„î/à fJP›ªÇ‰ -L ”¹zÅÔVÄZ·T KÍgM¯\çiHìsw{}¿Ô9Æ ÉlôÀ_ŽË«ÄóFnA<éÔšk×Úô6ÐõaèŸß–·¤×ÈlãÕ(á5KE‹Nù:©¼‰KÊZš‘7^5eR°è|ó|åÜV²ÇÜêSqOlž"ëÐ_#Tÿ‹¬;^mn –k÷ÖD’·â›þ0÷sFæ<^3ó8š³bò'2¡¦ùhi¯QëéL8•æ.]ÈÀm 8´çäÅ!Ǽ»±29g\øP Ÿù²OLžx³Ùp27Ò%:tÔBÙÔK$µR$­ßŒçÝp•Ò_e·‰Àôªø™¢¸hEwJh2ŹðA°väpKý:Ëfú ³Ètjä ßAW!¹¯ë@æø¦…Šz²;nª˜Ë»PQ‹™W¼¢†a[4 …16íå&¥“]7åÁx±‘Zóâô ƒçÔÙff¦Qîrì@‹c]ËÀŠÍ­ÁE_)XÒºzù\~,Açõñú•³Û*Þ7ÞçuÐfð-j[ò& Î‘YÅÇEÄ;/'<êŽe2K™_ßæ÷¾³&2©vBLƒV±€bÚR}ž“7*usOš@Š<àuN VŒÌÇ-;yñ¤”Gq¸‰O_Ž»êzL ­PÕŠ×ì¤ÁÃ:Ë=++z4ÙîS"/!ìuR•’ž‚ °OÇ4)) ÿ¥xz3›øaÀwÇ$Nìýç†aSòÝ@,gGŠ@]«çʰDÄ/ÁI‚V—òÀV'X)Žl´½æ°ÚaóÙcNb›#–Ž¡^ˆÜ>õŽ ŠN:ø¡ðýø­逈“Ç&¸ É >µø°AèTÕ†õBz &ƒG1€âÌ;1Ò™l´ŽâLW«)‡¤H‡8äC+§”–BÕHG¾em™ln‚Hd‡2 $³EAŒ: ÈŒôJ§" ‡¡‹1k£ÅºsÊE1¬s¹–€’dÍl2ê`ÊlI!À<À:)D(3øÈ«Xô­£™æm˜^dþå0èí °[Å4]I€R_¼Cm<~¨«|ʉ{ðþ0õÑ[Û|– Ü“=`M9“·ý8·Nä:‚9´yÐV8+ r&róC±¬p“#hCŽoH/7¨ òÉï°æ„+»„ô¯PlÐbßËç”êÛËl®Oüäâ´ Â<åDãß\$¨…ý[°ÑÁy ¼åP Ãã,ZWJµ‰&(Ä'³ðSŽhŠm0Ò'{÷:¼¶uä&OLn'g¿#†ÊQ§?ÀÂÃôe2‘]]¹ºØÊK™Bpëù0õa±F¥ƒi” þ‘Q—›J‹‹!5ñîœrJ™< @Ü}Š/–ð©dUà;@éÅ 9ÎM׈ÁGèðß$3›]U m–*@y·ÄUÚ±¶#À—Va{Áaéa1›ü…›,˜@† («6„Q ¼X=Ìõð npˆ´æeDTUPšäOï_ðµÆkW}~›ö'ôÉä`ºˆ V1¦Üµä)7”ðƒ•Bªd¯ø¿å½·]9d Ð ~P%œ[Ñ D˸Óu4‹TéÙË GÏ"ŠW1gt@±Í²®úXY„pXX4æeÐ,‚+LP³ˆA *ð,‚ ÷å·5gV·Åø«´ðàžCTù•CLà±æ¾ œDÖŒ5‰¬^4‰€¯Ñ5‰ CΜ#ôÎwK"X“ÙW1…%…› T`ID›[’ÐþWÁøq%Ò.Ž¡IÄ×wK"Ï ~ðs¥ èƒ¯]9j2±U¯%ÝqŠß¼zòÜánM+0ërkZ ÄNÚÔËTÐ-˜Õ.=vw*Ù–NÚ¼ ¦^»F=-¢‡¶øtoA¤¼18y\Å2e4ÂÎPx¨MØ’Íf&ؾá!ú²ƒüÊÙÈÜ‚ü§¹Ÿâ,†pãÌšÍÃFy›^’Ãv>O™C„§ðr}¼Ü‚¸\6ø»óûä)®…PiXÍŒ$à—ÍŒ¯±{âãK€¾gF\àîhU(Ù£ •w§8©‚n¸'™ÀÓ¢ $-ØIjÃÍ}ÝÓ"ç‹UÞ˜â[V¼O^Lö°Ç“uŠñ“7¨<5nykt°ªØ£0uÛm”·$Ò†ÐB«Ð)Þ%onÐÖðl„Zkî“t&®6èòøeå¤?U ‰_=2±Ç *TÉ ˜$¼äìxèNH´,°gÀú̾¹Èà·3¬ ]aԗȇ=9†Ó|°Šú ¸5’ÇH$ÎNP" ©”½a&öÍC=2SÏ>@›ßÇ»>©ð­ÃzozXCëôƒ/ãñC®ðg3z Ñ~d)¾Ã?P&¼„j÷­#¶’õùáD?'G½Ï¥aMí¶k¦°«o«z¸ä×ÕŸ\–mý~èÑ.À:·þLò¡¿o½Û„¬7r'òÅ?øn#Qž`3áGµ¢ºÕÁè^ýÝp)~Óôͽ ds»@vgJÙn-°wSŠ:YÛÜ)£þ\!NoçÚÔº¡­…E1ëÓ7tJBï¼\ù‰lhh¤w£²ŸM"š[È€Ø €Jˆ°a}<ÛÑP_^!ðqHw´CÛÑ#²É“>ÉØvÚÉŽvlI@fMYU4»ÚŽf¥W~ô¬ùm¼ë“ ï¡=¥)òv> Ó>g@mä;ÔÀ‡~lKI¯]üÄŒ6·-éìS’ ºµ)zïd¸ñ×4Š|mÀn8ÂÆkSªvýb‚./èP¤lÇðçddóû`‚\ùÉÝ9ƒ „:fy[cwΙ?F8¼<Éד¿FØ&#Ÿ#l6æÈ ä΄™#w’ooíUÇ‹ESáŠ~ojœ¤yñ¶+ø*âƒJzI•Š|0 wP€üq‚_R¥<å)B+ÄK‚\R%¾{Œë–ÊkÓå`mmó&XU« ©»Ò¿Â£ùÉk° ÏÇ)~ˆ ËÁŸÉ &ÀM×dÈ×N¶–ƒƒÛ¶Ö¯~¯Ð,»ssƒË úÍÓä×pk¾Vú_+¯ã›g¨vÖü®=ïV!êÜ&¤ä–}Y}@[ÖΉy-k—çak.p› ’—ë= .«l-ëÜ×ÝÕM®Ý¦ýÇ }+üôjßJéë#~0‡ÎQ_ñ£ZQÝê° ÿûú˜f{Pî%PÊmåͳÞ(÷ÌOÊï™6ʽRÿtÊ=£Snmá”[û\a–åÆg8åžõI¹—D)7Zl”{–å¶ñœrã¦rÞ)·A§Üw#²Éiˆ;å^”r›@9óL7Êívu"1ËrÛÖ¼¼Qî§ ï#ãÙåÆw8;åFåÎ!<)7Ž“7Ê=ǃr“}n”›*<(7Õ¸SîÙ”{Î;åÎü-ÍF¹“ᯪŸóûd‚~§Ü.Ê ¸QîêrC°SîÊN¹o”ÛË éA¹Mâ ÛÚ¼ ŒrÛ¨F¹¡ÕF¹o”³Ú(·ÍY)·Á—æÐn¼Ô0(7~o”£í”Êí”x£ÜÛd„ro6ÊÍ 6ÊÍ.Ê­ãùN1u¼¸m”[ÑïM탓Ätg.ðUŒi§Ü€å¼SîãN¹åÎ1Ü)· |Ó‘KÞ)· Üû­Í›`QnÕ)7ÐF¹o”›'±(7à¢Ü ±YŸFûNÎËQ/ñ$-Ÿßû¶7Û×ÁY˜ûׇ̗kÐ:Õ?<Î%í?ù…ˆÈ·ÇÜdû‰âŸ¿ÿÐ-£ endstream endobj 4 0 obj 3880 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 376 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000004427 00000 n 0000004156 00000 n 0000000015 00000 n 0000004133 00000 n 0000004228 00000 n 0000004492 00000 n 0000004617 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 4669 %%EOF dicelab-0.7/docs/syntax-let.pdf0000644000175000017500000001103611303206670013416 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 358 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•ZIŽ,¹ ÝÇ)âiÍà ðÂî¥á…Fwè¿°½ðõÍÇIŠÈÄ µ¨xÔDQ¤ø$å¿pâï?¿øG8ûï‘û+”~ÖüÊ3ž?Î…klç—ãúJ!Ÿ¹½BŽgm¯œÆ™Ë«:^gί@­¬8y³d^ü_åZ;¼Ú硽)¤Šõ{2L¨Ï4z…¹t„î/à fJP›ªÇ‰ -L ”¹zÅÔVÄZ·T KÍgM¯\çiHìsw{}¿Ô9Æ ÉlôÀ_ŽË«ÄóFnA<éÔšk×Úô6Ðõaè_ß–·¤×ÈlãÕ(á5KE‹Nù:©¼‰KÊZš‘7^5eR°è|ó|åÜV²ÇÜêSqOlž"ëÐ_#Tÿ‹¬;^mn –k÷ÖD’·â›þ0÷sFæ<^3ó8š³bò'2¡¦ùhi¯QëéL8•æ.]ÈÀm 8´çäÅ!Ǽ»±29g\øP Ÿù²OLž8Øl8™é µPâƒz‰ä¯Vª“¤õ›ñ¼›®Rú«ì6˜^Ÿ)Šû‡†Q4RB“)Î…‚µ $‡[ê×Y6{ÔW˜E¦S#oðt’ûºdŽoZh¡¨'ÑqSýÃ\Þ=€ŠZ̼â5 Û i(ŒlËMJ'»nʃ=ðb#µæÅéÏ©³ÍÍLw¹Ë±;-Žu-+6w¶O\x+úâÑGß$ó*E†Mfφ.V:KZ” ÕŠêVžêÕß7ɘ"o6dN,:õ˜ï*@?¹&Ê‘qVh¼!ê¶=IŽŒq2[‚û¬àS‹w‡Ž‰2Ö°^ 'ã–øÔñå83Œ‰Ü¥ut((y•}KˆcLDØËó+f†P5&Êܱp4rÞÔ3 ’ÙØñ@–ÐAí@•˜"†‹ÃÐص±bÚî ¤üàÆ‚u.×ÐñˆŽ"_ÒÁ”Ù’B€yðÖ’(0Œ>}ëh&€y[–­iŒƒž¨L€sÐt{çwˆuø0”Êòø¡®ò"§ÁçšÃÔGounóÙ\`_LñŸr&oûqnÈ‚yÏBÄcÐV8TAudŲÂbÍ+ÐñupâDjp³ "³áÚ®ìÒ¿B±A‹}/ŸSªo ,³¹>Mðƒ‹gZŠ]x³<xp‘ öS„ ` RN0õ.ÁÈ3f:mÐBy:½%vZ6þ2€°aÃ6©<¼{^Û:r“'&·>|`ÄP'S,B†¹yHÕ7Ädð’ ”¶——29KRÔ=ÌÃF}Zì“Q+Ç,R]bÇZ7ŒZdÇš›ÐL÷‡â‹%8™n‚0ôb ”îZ±â°-« ¤Í@%Ù6PŽ6\I êW8fq¯P$¹Óªé³þnÍmâ1 Ñš®Zæë…«‡¹^¶J”ÞÜ¡Œè‚ª Js‚| äý ¾Öø"píªÏoÓþã„>øA‘«¨•@T°2ˆ 4…„Ù-EäÁ›ñ–BHƒZ…Îÿ-‡äÆGã•C–­Ø:»­å‚ÊVÄŠƒwŠ•E²$R/Ÿ¼óxQ¼²ˆ <‹ ƒY<‹Ð¼*–E‡…Ec^Í"äHL–4‹ôTžE0á¾ùmg=7·¥ñWé4®%9D•_9ľ×Ü”“Èš±&‘Õ‹&ðÕ¢&Ra”â9‚ îÁ¶$‚5™}Uèl K" 7¨À’ˆ6·$¡ý¯$’Ey/ŸÂm9‰øúnIä9ÁO~ÞùЀ>øºÅ™w-@ÐxóZ\úÌq.¯.…ï)¯€«Äên]ˆ7%vR¹TsA·Í¬$é±û~§’mé¤Í»`êUÚeã-‚ðÌÞR*+µ|©ÐNW±LË„ÈPx¨MØ’¸9 }7“ l˯}Ù 9ó¨[:|°rÚ€å4ζÙIgâfƒ*+båM®ï‡ì_¸d›Mã€*Y&îÒyÉÙñÐhY`΀õ™}s‘Ìï XA6ºÂ¨¯3{òNCðÁ*ê#ÉÖHh\8;A‰¨W'¬¢™Øƒ—Ô±¯ :€5¿w}Rá[‡uîzw½*Å_QâCî5‘¶¸¶”¡EôÁ7›Ê„—Pí¾uÄV²>?œè‡\ÃcsÚ ë%Gìý¤ê—W=\òûêOîH¶þ_~k {&ùÐß·¬;ì2[îD¾øƒï6íŸl&|T+ª[ŒîÕß —ÂäwîM Áí‰Î†ÝZ vSh:Y îªQ©PVÓ²‚@ÚZØ.f}z@Óž.ϬV®üDeá3ÏÇ&‘€ærõ‡hTB„€õñ,¢¡^[¯Pù8¤íÐ"úaD1yâká´5’ˆv„$ ³¦¬*š]-¢Yé•}k~ïú¤ÂûÖžb‘‡J;¤˜øí•ÚÈÛ+jàñÕm)굋Ÿ˜Ñ¦Ê¯Ì>EÉ « Ùgæ½È/°4мÀ²ްñÚƒ]¿˜ ÉŽôŠ”íþœ ¯Âs~L?C:gpPG@¼Åš;ÇÁ±ËÝIÀ¯±^¡ó#“RG@¼7:utÁ2FåØuT6 ²?ÁZ›wÁÔGYU'z@«¸x`[ðâYñì–뜕;ܹ鯷n&Å`Žøæ‡Qa†-—E¡h/ïòB;ùÁi›Œ<Ñn6æÈ ä΄™#w’‡‚Œ·"EÕñbÑTx£¢ŸMí““Ty´+ø*’ÉC/©_|e»ƒä[¿¤J©ð‹­W(ò¤Ä—T‰ï㺥rÁ º”|U@+`´Í›`]Tñ¨Éî©€ŠðmSiêU™ª\…]gŸS‰vOõ°›õi´o½ß&}?MEPñÁÙLRÑ7ÔT«}t-¢a(“ Y²}ø;ª÷ù!1Òù ÇM{»Ø°¼&A‹¿¥&üJ£û³ îÖƒ$Zß*9¥ã=Õ ¿)¹@Þˆ°-”jW/òjäã&ЗÀ’ý)çp ì-‡•”çRéö‹GÖ»xEÑAç;¬A®öãtASTyçj”Ù:Ct¯ðb¢ãX¶¦Öíe ÖèMâ°é] <®5¦Up¥ùMã“øîøÙÛ¡2YSìüÐpfWBpëspÂù±Ïí¹8áLÖVyxÉÞ%Fž²oÈ#®%°U&…‡m¶î"Pý¾¼Í›·dY’#ItG!U¡C‘³9:ÄãµÂ‹çóyyärÄzذärÁRàfAµ‡M¿µà•‰ƒP~UñÅB€åW_üQ­¨nuxp«þ!Îûxà%Ple±½ßp¯OÜ˯çþt,¯ðL€µ…`ís¥ëÞn˜àN€I£^%À½Ý0ÁÛxN€{¹à^nØ à»Ùä½=ðj¤ØÊ` îØíêi½·¶¬y{#ÀO>DúÈ<âƒü À#= 0µ¹à˜ìs#ÀTáA€©Æ÷ù À#>0)r'À÷Éð*<ç÷ÉóA€M xÌýA€ñÛ›v#À£=° –1Ê“«dñ]mó.p¬£:&­v<úƒy#À:g#À o,qŒ;V̘¾w<úã×K;íF€×d”/›)Fƒ£ÃËx+RT/;ô³©}püääF€Mà«H‚Ü 0ÁžùF€gÞ ðLl‚tøñЫ`Œ¶yl£.Lh'À3?0&±`‚¾[ˆÍú4Ú·rÞÔKŸÃ÷}¨¨5²üÞzûU}NZ?w—ðÉ©ìŸü^ÃòëHn²}¢ø×ã/Çÿbê]ô endstream endobj 4 0 obj 3607 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 358 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000004154 00000 n 0000003883 00000 n 0000000015 00000 n 0000003860 00000 n 0000003955 00000 n 0000004219 00000 n 0000004344 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 4396 %%EOF dicelab-0.7/docs/syntax-firstlast.pdf0000644000175000017500000001321711303206664014653 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 365 162 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ\ËÎä{Ÿ7'þ:ÿzPh Ðl~]…ür ‡W"wŠ|Å&º_Ef'¤Ö–‚6`Å¯í½ŸLøóÇè—ô¹‰'c"•^³T.ÓÉC¿NÒècòh¦³K|‘7à 25IG¤÷™ÜÛ¦Bþ™{RèIüUx|†#T7„Tƫ͠Vb<½51¤äMáÞŒÂGÿ\0^3LräçHî#1‡éá\¨¦ZÏî¤ÒÖ(äõ6X!´1Î)£F!ü^€;4SGŽ…¤ÂaõËË|gÎ/oU;zUQeÌÛ&¾Ñ«8ÊúÝœ@Ã@C¨â±f+¹Saw“ÊãUñœb• Z³ÙštypøïõU»*P`n©³ì.Н0‹ô®FYGa* ɧ‚¶ç3Å̱ŸÅR OÌ(‘þ°kŸARiAˆYb¢BÅEj(Px’˜›þN³šÄ”‡ ä÷YÓ«¶¶(Z†ôˆV´J†Ïèëæ{#5¬Ä<ú­Ì@ŽÀ¢F3­&& I¥h«bÒìÙÅ7w"ôõ;­_º@ÑZyóÜúá4óë¿ü£ù5žÿ{¤óŸÿ¯ãßþý ¯pþçÃù§3aÄJ2—¾)\Èx ù’)@s{䟯§MµfPÏÿõ KÚÔFÔÒúðsÎ{}+bÅ_ ÐñRˆHÌÕÑ6„t°P¹ú7>r;ðÀCüM¿ÔøŸ3¶ ñÓ¥¢Õ¡X“šë0}`ܧXóŽi¯V™o»Å‹5,ü5ðW,ê^Öa$¨{Rܽ¬þÚµÌ×0˽ŠkWž»÷0ÂØšmëÞϹªzʆ¯sûÞÖ\F˜6Ϲo*´dw±vÝ\‰X Æ{ClžP%ºQYSÇPi¯ÆùÅŠ= ÃsZ¯k]åÝC/[h ±n žyÑX^ÁÔÛy÷’xwªVðBR”¢†x3â‘Ñe/µ6:õ¢°Ÿ¡†ÃÜ”K«(¾{Ÿ7gþRA†tY%ö2U ÿ L "§ŒètJÜBŠ£\ë÷Ò{kï‡öŸ Î*V,@#@Â$lÑ8áTa€™.ùï–—q€ZÜXª_ãÓׯ’?møÉ4Ï~|øI¿¯ÖáO’lxµ©5üd Ü꿃ÏW~}ø¯žü¥cJ¸ëø¯B:þ Ø’ˆ%ƆלëÃOROüg©Þ _Z{?ðDp"±Ìj#òs@µ2½ÉBÆ|<'o{¶ñÌEWƒÐ•ÚtÞdhÌF_;);cO¡À±žÄH™O ÙŠœ„óëZwðû†W  6jÅ‘ž¸Ûïæ„®tFÄÃÃô¯LyÐñÍO %3“weT£úà}´Šâ'ðÃä ¢k.?‘hCý”Æé%Ofyå3øüÒƒAÜberö»šKõ1Qñ»øiÊþ˜´Q(Mt€0ScqD¹‚«e‡²§ŸÿûHNèSu¶ÅX°#¹ +ëHîkúdG„ÔN?ä OŸÃfú7ç Url8VÉfdž½ï˜z™¯l\öð Mûöœ ½(ÍûÃ>Lðé)ñ›4~ŠQå§Òì×"§;(ÂV!wÉ+pÑ”‰Kz¥”aÀ†(Uš_{áä¬Þ‘SΘrœ M1å­©"q 9¸¡*03–ùÕ’…CÁÖ5Lò«”''û_«‚„&a1JGVð.÷ñbÔ¼oýD޽m-ö€HvD^lÀ'kÑ·-î5‘ß«éMk,dP:‰Ã‡—˜{ÈH³È»•Š?R—qvƒ.JÑâä¬È¨ID݇°5y QIrnI2¢dÉÍN®ÙÝH¶cÒ}Zhª„ÉLzF#ÈiÆÍ(–‡¦¼ÞZY3Pƒ.¾8Ä…Øk4»Ñ$æ Iêݤb$jg™QáJ–Î]C¨ÎªÁdiã}A¸n©à€Ìg¬ÞF´£K·bi˜ÝRƒÈÇjä©sOñÄ'³@Ï6 Ù†gp[ò"ÈÔ—æ ¼Yƒì‰“˜¿nÒ—_$sjÉS#äphkµ~ءȚÃ^QñSm‡Æ¦Tƒ¶&ÆL¬)Ç—³ëwSO8¹G½¤‹Êœ*ã„óæ4qöÝ‘ŸÎN!“ùýFþœ éì©(Êódë@ Ñüš˜* ¯ÂÆt&3qÒêÒ8i¸-¹³q ‘#|®"ìãy¶èò›Ûm!m‘ê> Ы:•—°‘d±qöJñ ’…·«€˜:cq^5˰$/yx²pˆø&NxQEf ÚUܸÌ6fÕÜ ™Æ•.Y6ï Âïu© ¸žÂôsuD77›ÒRU„•·Kd´ IÅj«Ý0DÞƒy‰òâHXbqÛ›Ô·B+xLÅ‚«r¸ÝÃaû’OaÛå4Û’ÈHI¡É[!Í"ù•æˆ@QI#)TþÈ–ùõm剻dK#Ç‚,A/K>_6¼”#«¢uÏ$÷úˆÞ(¥Px ÀÑŒs¸Î¬ð>wĬ©úÚ'b‰îX¤:Èò‰•£uÛ†Þä×aа{ÞtŽúËÉHßFñ«Ï ¢½ãOÉÞ°óÓ…Þn!íC‚”ìÃù†ijl;¦t{•ùšn§Ë¿±‡©|FÿC3ª/‰é`ÃÆ¢ÿa|k¼ÑS{”i¶s =ïö0å'&ì±èo‘¿¡‚úae혼â'ên¯¬²Ñ¼Ï òÁ$!œ&ÀQ­f(|e€0w+ÂDh5¿ $™‰žËÅÓ¸Axg½¸úURu“²o2>‹´Š1{óÖ“ñ;Xȃ¼4ð]%dáwÒéCÝ iùæ™' T僤ìŒÚ‘jçŽte4º¬‡¡ûâšS_¦[*Ë/ !MeJ© >Ì!ÒÇìŒäÂËDZC?.D!º&"/b Ë>A‡Be®¤È‹W)òM–ˆ¾‰Ò·÷éYITš ¥×&êÚlê. £Â]a²H57¹ ä{t[ˆ¾£‡:¸ìQ>ÌYã+ä‹­³ˆIì÷~dýèáX¿î¾ 6Ϭ­ ~ôb{²ÒmݤÙ<˶Len* ýp•¤ægß®ˆì0@Þ[¾o ÕÇV©¾K̲ëv¢ÑQå¨~Ê”Çepóúæá£¿O9GÇb®QUCªRÕ ìΙþ»RUpš¦ö U•‰0U¨*ÐÕ냷 øæG÷ “ÈS9MVj˯,»3ÙRD.©9K:lJ½qÂüPžº ÍÔ¶JmæJ³Ç>¹ñÔ7•î– O5¹)O5/Ë”§Ù$a¬’´ÂLLãA:'î+¼b0m¯¼D%ª` ¨.Dv*´Ê÷¼E¥wÅ"v”]ƒö>Qçec‘‡$ OÝä ßc¹>¯oµIÔÛˆ%§.6IÉ„/ÚÂR¯‘'ÜåO[õ«£l,uÆRëK¾´ÊÊR‹|Üb9@ {"#+K-òÂ,Õä²XªA}ã|bÉ'2œ¥Z©±XªAÓ9)µÚÇ#2”¥fÍšÝXjrkŒ¥¦û2Ÿ~?!e±Tƒ²²Ô¬|ÁÒ¬]C]ô{–d,YSa©—!“‘¾âW,•‡®Ký#n†qÓÐŒ‡Ê8pê\ØXÜôk.h\™Z}Æ‹§ÂæŸÐòSò_Ӯǭ{™‡Þ”¢÷bºÞœÙ¹:³Ér§¢ARä’*‰rõD;l–øìHÄûJ-n¼Ê‹Tyotx1lZ)’¼b•Qq’ åI/œÈ\<`N†‹&üÕùŽÈ=.¥]ÌWÈüýc®ÌW‡Éá® ‹n/ñ}ã’»Þ¦ùp-µ$÷]ºÞfÙ Êš… Þ”A–.ʇ›uS¯ pZsd5cU\›}?šò°(–)7Oà]~‘“J—«5TJ®Ö@‡ïÖ™ò *C.×8r ˜œ’ õEÂu‡Ü.ÅŠ Ðä‚MîvÁ:œ[Õ (UÉrÒý‘ªWno]» ë¢Ê<Ãpb“ßÜEy¹$Èæ•ʯî^âp«Eî¯,Ç)€/J!È¿ò9µ É—o`¥Ü¾q$ßÁAnóÒ3¹³»Q.àpÞ$f¹âƵÚ9%ž6ëËí25zȽ¶[¯;úE-è{à©wJY£I_Å)²…Ì7cŠ|Í•È)Л-©N¡ÒŠ@–ë8×qˆéÍ™i7 Ú‚¨¯f®Èš`^ÑšO ½•Ãó«L>Ùƒ(×r¦Û&÷r¦Z/ }©l%êy÷»úÃ_¥×V,½v?PêMSe–@ù)ù¯i×ãuÃË<¤W|UvM¯¢éÕÍ£ÜÒëH÷ô:â5½Ž°{zeÉÒ«³©m¯©=ò5½Ž|K¯£ÜÓë†hzE¡=½Ž|K¯Þ®§W|±§WþFeK¯.¯ôzs-µtK¯[AM¯Žhn$ùš^Ý:_Ð=½z3VEþL¯¦<¬xM{M¯8»¦W¼2¿¦W¼¾¥W*vK¯£ßÓ먷ôJ*÷ôJ:·ô:Ú=½ŽqO¯8X»¦×[Çxl>:ûävO¯Žhz%ù’^gùH¯8×ÙÓëÌ×ôŠ“µkz5dó(Ÿ']VFCV2õŠ>‘•^g¾¦W²î’^g¹§W¼‚¼¤W÷¦×›—8Üf½¥W8½ò«Ï-½òÉÏž^qBuI¯8ÜÓëÖ3M¯›5½¢Ì%½¢Ö=½Z³>±Ü.S¨×ôzíÕcG?£(‡xK ŽøhÙÓ+äKzpM¯9„Kz…¼§W>n¹¦Wƒ¶ ÷ôjÈš`^Ñ6Ÿæ-½rã+½f>ƒZéò-½r‡¶ô y¥×»Ïøæý‡¿I¯œ69½æhŸG}ó!“•Âÿ9ðû ª9O×’™ˆÉ”õ¿vXÏò_:D¿ZËÚÛó!*>þùø;ZBÿã endstream endobj 4 0 obj 4742 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 365 162 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000005291 00000 n 0000005019 00000 n 0000000015 00000 n 0000004996 00000 n 0000005091 00000 n 0000005356 00000 n 0000005481 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 5533 %%EOF dicelab-0.7/docs/syntax-listrep.svg0000644000175000017500000001317011303206024014334 00000000000000 dicelab-0.7/docs/syntax-range.svg0000644000175000017500000001243611303206024013752 00000000000000 dicelab-0.7/docs/syntax-filter.pdf0000644000175000017500000001214011303206666014121 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 363 258 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ[ËŽ4»mÞ×Sô´u¿<^ØYYØÆÌÂίoÞÅR×ä ~Ìbį%Š¢H‘RIÿ8 ÿþù·×þ'¼þöGîïPú+¥úÎ3¾¾_¨±½¾Ðß)äWnï#ãÓxåò®@JŸ¯œßZ…´š&c{2‘ß«p à‘ÞmO%¡n}Çž ²ÏNäè%Ê¥7ìå|™)á Eœ´0‘L™/£¬þ˜¤!´TQ ©ÿj† åë\$ëì|mJüzýv@ØB³MÔëj„À×Ú»ˆ$ª³ˆ¦W¦I ©µUA;æ×þÎ;þú1û4˜k2&¨RÂ{–Jm:hèë5ú˜4›)¢Ø%¾ÇÈ8 MM<}žïœ›«ú™¾ Tè‰õUh~Ð G¨&Tï6=½Ä2hzk,HÉ®Â>œ…ñݨ`¼gf˜ ú;‚ú€Ìaš9—öµ¾–¹J[P@ëmP…Ð’qNž50ás¦Pp‚ 8Ȭ¾V›€=çkõÊ=@ª(4z Í‘'Ž*޲~×1CÏ0…BË[A•ý].jìË)Vv Ð°7õ®ÐxÈ€Ã~]*€aºÁÔY¼ŠÀ­fáÑÕÈëZØ C2WÐþÔSLùY$mäQLý¿Cû4’ BÌl« ³@ …0O s“ßÁ«Ly°‘ }¾jz×ÖV…ôƒG+Z`üÑÖÍsf#5¬XÔú­ÍÐhQÁ^¦¨R¤WiöläIƒ}ý³' ¬•›†P­JS½þåª×øúב^ÿøßÿúï˜÷ë^z'áýM$™o¸3Ú p½IÜÄñçÃø´ÉÒЪöŸ$ e°Êrk)|¿æÎoYÌûË8èi­ÁyÍ#*«þDG&Âx8.þû[¨ta´kcZŸ°D¥|ÁxT«ÍÓa¬Þ¤A}AeV/ÕA$4Q¯!PGÕKÕŸÈ!ÝÀ12ý †lâƒJ‹I2‡CD«ÿK’@!ööp¢I|ZØx (HGŽe‹9[É~ÍÜ‚M=° •!M±1¿1™+®(‚Ä$M*ÿC s‰‰S³O$LÈ "u P¢)¤:1FÊNŽD'GŸ á¼Ö€0p€ !¬QÖ1ˆê‘kÙ*ZQÆò–Î|1†+}¢$‘âøª’¸k {-NxˆaHa%Ðp®z!=º† ~SCÌ6I`ÀØ5.ÓØjBÌF:Ïh4Ihi^U‚ “öêh¾!R±Æ, õÂëåê…é“ÙµÕHÒ鄸2^‡Ÿ@ü|탻ðgØq@”LÌ©ÒZ¥ˆ˜Â!˜DR#Ñ —¤!¤Œ?  8" "1BÌÃR¢ÂTéÃ÷Y?¤ĦT™\i2ÂŒÊj ‰„ÂüÉÜ'Ѹ»Qú¤‘a>t¬*ƒ÷9£Þ®®“Ô¼«ðFÍÄ!c5 P³!óô„{+Q*ùSŠ´ëXLïOÌ)'ïo”…ÑËöm@펅:—öbþgrX •ÓX\‡B*À,·gnxŠTZb"äHu–å7®cu-m’°Z%P¶¸X(mÃ3dP ÇBÌÌz1×29´†Êi,®C¹ÞÍ çÀ»˜¥C€5l´`Š ;œn†ík.3 ùtî® äç¥U»ŒÀ‹“q.Äü˜ÈNe¹Ž"ÖN&ŒÑ'R,&`ïu­«HÓ®ÂLcˆtËxæ¥†Ó Hau×kw²œñ({,lÑnÄ,£ófÊ,8­^ªÜÐ@ÇazÍU3E€yí<`X¥š,±“’3íw™Ó”nqƒE×Êmp÷~’©pA¡¾höƒ¥kÖ⠳͟J³úA¨X¢Ç$…ZmæP('A?‰a,ö!ÙW"¨p6ç¡Ùפ#`¥ ÍÇg\ÅJMÅmÙè×Ñ4ã¢2Ô|Œ™ÿA$Œ=Y>(Å^ů°Æ –ËÇp¹% ˜ØŒã¹!#j3p¤’nWíãB–u$é7ì®Î&?§û˜îÒðƒÖˆ·Ø€C²Œ[‘&©Ó GÉw \S†'ÀI1?“m‰x…r¨ÅBiõêcAY2 e‘$ÔN’.Z˜´lÈÀ,¬Z´0ÿ!:cq^€ÊŠÄLb€ëf?K°%…Ú'Ó<°Ns¡5*evà’WÉôD¡çkWñ—¤˜Øt^]¿F¾ÒȦhÔ»¬X&\·ô“KŠX/ÊáÒéy'Ç}„‡ÎB"bˆL/¦¸ˆš…àaZó>9“Á€ò4ã ô2ƒ²åÉ„õ‘|FÔÝï™bñaægÖe8óp›4鸿óÃ˲íÒÌd"U[Ü"ÔeB{óØôû%yË÷û0Ff†ÈìMٖه gæ‘hXfÖ‰2¸vzÞ r—@EÈb«M&PŠ46ÙÌéÞšìI;«ef ˜ð®*Ž[QXN :meÖJ‘µöÊñ[ iÓÒ%iö‰€Y¸ 7ºr¢tyFgJC¤3[ÃüÈ!N+Y¨«–H»9ˆªK=)’@MÚ "[v‹A›w¥Es˜÷¯*¾‘ N¯¹l ”"m%PòmT/'P|vºlEûí.ânÔÜLôÆ Ô6¸û?K šæ)¿“6I¢RšÔb¬HÚä±aiÓ/$+’Æ}ÿþá §qÕÒ¾š4«ÙcšÆY›GòÈaå÷‹¾ò‘£”¾)óùéD5"˜cµlz€Ùû“5ÊÚ<’qÉCGEé鎢$O"â±fBùø žKS~¥RIúká•›PQÒŒùŠfå/¡øõ1Ð á ò×þ²ÚÇ‚~sL5òL}‘P6;%],¦ Ý1ý\³i³ØºÍBLþÙù[å ¢Cø`„,LðˆŒÃXÝ!ÜÝ£{æ>ýb‘’~| ÒÅžè³9®†RŸ02¨X.;ÆjóØ1‚öòÓ±õ uÆ‚:ªÃÊrÔP~]žŽ vøGåeãï,â¨q²+F+eùK¼â¯‰?\“£RQš£óÉ7"`“DUÃ(ò 9“ šIÂljŠ|0áN‹þÓ} ñ##<†Fºw"+D!1VcßÕýî›ãS( w7Ú†GÅ•ÓuËÈK9\?os“ØA{úÌ’-yŠd["½A’.;#^¥ ¶ô-D—eu‡È"±3ºgþl‘ÈbúkiÀÒÕ ¶E‚Q:´Oº SÒ"á°²‰_rJ”Bœêy(qìI ®E˜ å-¬'[$¸Í/ʃ¥üô;+bèxZÒE¢ŽVšú+–úÐ_GÐE‚‹ÊP f~Í:QãüŒ4JàeYˆ¼S¨n©N× µu¾ÕÀš6*s&µu«áú*Ê£ }±UžW*åûl4Ññ@[•úˆ‘m ­:LlcµylÙæöyÈîJP[ÍCí’‚)ÙêÂJX¶ZgÇK,…ÇŸŠq¥Ùx‚Új2k”ÒÔ_±TšþZ†Ùjj«¥-[-?|*VÁ‹`9I@ƒŒ7¸²VÈBаvmÞpwV–Yã§k=ÓtÌ3ÖÞº»Ø¨‰ðØFIóË2©îwpdo4¿d£\1² ²Ñ…‰M¬6m"Øœþ Ùïó†ZcEmÔacÙhx¼£\ò@©?½ŽCƒˆºÙ“MH{MÞYaðOXÀÚü[Œº•:´Xäg1ÏøÃɹÚFˆûRÒ¾”†º/¥a|,¥øgY6~D¼PÛR*Ý^ÌÔD¹ßùôHÆçv>Œt·Ï‰ãh~ßãÙèÖ„±âö=Ь]qºܮdz¹gý,¡bVËí°ÔïOÈ—ÈvÉÿ¸:aEýÏacùß/Ù{W{ýAô¤®G]O!ºL,dKôÇ›/è~èÞ«©#4õ ) þ #ÉOC÷5CÎ ÿöÛa<vÈÖ‚Þ»³z<’½,çx"m«y|ÆÈT›ÛZÞó¶”K?ÞE¬ëŸ=¤—ÍAz½ºÃ]vïèåÃ9zÚ|£§«'ÜЛcôôáý×[ßïøB×ý×­~×ÝÿBÖÞÿ±õéQt’õª • axC…Žª¨”ì×äëQçÖæf%ñMˆüü˜Á#üša!•îÖ&H1è=¾HxE7O9YjrÃ;åÁ/IÙ5Ï‹ù)T¤3ãc5 tÇz1r ;áv:+”@Ó q¯~ ptÁxòE`ðÓjDç6‘/¯M7ҀƯn@Qž7 dø¾A¤é"N–gFgyàð¡Zš ÌÇè¬)Ëß9,¤ð] yˆü8ÁIWåö6  5CV7Âbëö¼åÆåKçǨ]z ð9¾vÀ·l‘¥ós˜j¾VðÂÿÈ9°=xX`r¬·š%zòà€ÂoðÙ¿yÀ:ôèAÂJ™_=8¤ò³˜~ö€á»«ò10ž›}°7 ©™/Œˆý‚B ©ôöiº£–_#¿~0ß8¢ë"V%ðm|'„¾ 4]æÇÙ¤ qüâÁ©kØ«~ò`Í>0c~q¬ÞyØ(]š< ïÀ;ú¤!òWFœV"}þÚµDæ†W寊 á? èýº^¥¬ñ­Iï!PJ~a5ßLBï›»‘ñ“¯F~Amð©BtC¹â} õíÖËäÒ "´>5ºŽêv wV4äb}•kþ ±Ù„^G ‚® 4=V@Vb‚$@ayk§ÒôBŸr¡Ž9yÐu˜,Q¡Õm]Ýlˆ9˜µZþdP‘‡Ô9}Óá¸@Òv.²ÑIœÐ§ (tWe¼µE}í:cUïz|^›~rJÝÎë±D¡2  TJökòõhݰ67áuä=¼:D«!GÚÂë{xíó^ûXÍ»·G¦4¼Z3qmcl®=â5¼} ¯ Ü^"áùð:â^­_ ¯ Ù%¼öy ¯F¯ðº©–¦bÄ=¼º†^ ‘Øô5¼št¶ à|xµn„ÅÖíy+ÊÍ:€Ûßkxm¯Pg ¯£„Wh¶…×Q÷ð úº†W¨²‡×‘÷ð:Ê^¡¯-¼‚@[xÝÆs³öF!°«Ù«!^¾„×™>Â+@—ð:ã5¼½…WCœFç^YÁT›}".¼Îx ¯ Ý%¼Î´‡Wâ5¼š$¼nZ"s›y ¯ Pxâ^gÚÂ+Hy ¯\«™„W§F ¯Øæ^‘«¯Ú­9–É¥ò5¼^Gu;Ð;+š{x5ÄfS¾¯Yxs ¯lá?£ùð ´¯°-ÝëA«Û¶‡WCÌÁ¬Õò'ƒ,¼Îq ¯s\ë~èráäÃ+Ð.¼n:cUïz|^)lRxÍ4ÃO-µ>[{÷?w«Õí©cNóZ¦‡\âo.Ün•®ò×ãÏÇ¿w‰«’ endstream endobj 4 0 obj 4183 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 363 258 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000004732 00000 n 0000004460 00000 n 0000000015 00000 n 0000004437 00000 n 0000004532 00000 n 0000004797 00000 n 0000004922 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 4974 %%EOF dicelab-0.7/docs/syntax-dice.svg0000644000175000017500000001205411303206024013556 00000000000000 dicelab-0.7/docs/syntax-scalarconcat.bnf0000644000175000017500000000006411303206024015253 00000000000000"Dicelab Full Syntax" { expr = expr "." expr. } dicelab-0.7/docs/syntax-sumprod.svg0000644000175000017500000002644311303206024014352 00000000000000 dicelab-0.7/docs/dicelab_manual.out0000644000175000017500000000365711303206701014271 00000000000000\BOOKMARK [1][-]{section.1}{Introduction to Dicelab}{} \BOOKMARK [1][-]{section.2}{Installation and Usage}{} \BOOKMARK [2][-]{subsection.2.1}{Building from Source}{section.2} \BOOKMARK [2][-]{subsection.2.2}{Packages}{section.2} \BOOKMARK [2][-]{subsection.2.3}{Windows}{section.2} \BOOKMARK [2][-]{subsection.2.4}{Running}{section.2} \BOOKMARK [1][-]{section.3}{The Dicelab Language}{} \BOOKMARK [2][-]{subsection.3.1}{Introduction}{section.3} \BOOKMARK [2][-]{subsection.3.2}{Reference}{section.3} \BOOKMARK [3][-]{subsubsection.3.2.1}{Scalars, Lists and Probabilities}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.2}{Grammar}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.3}{Dice Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.4}{Arithmetic Operators}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.5}{Scalar Concatenation Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.6}{Summation and Product Operators}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.7}{List Size Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.8}{List Repetition Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.9}{Range Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.10}{List Concatenation Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.11}{List Ordering Operators}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.12}{Low and High Operators}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.13}{First and Last Operators}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.14}{Filtering Operators}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.15}{Let Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.16}{Foreach Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.17}{While Operator}{subsection.3.2} \BOOKMARK [3][-]{subsubsection.3.2.18}{If Operator}{subsection.3.2} \BOOKMARK [2][-]{subsection.3.3}{Examples}{section.3} \BOOKMARK [1][-]{section.4}{Feedback}{} dicelab-0.7/docs/syntax1.pdf0000644000175000017500000000621211303206644012716 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 260 118 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•XÉÎ49¼û)ê Šòn?˜#†͌PÿàÀë‘‹«z™‘Zßás¤—\œ™Žê‡cãß~Ùþðcûå¿!—½–¾¼ÇT·Û…[mÛƒ8—BL1P<&QeËy½nÁàIAÍñ6]ò š)-„óbÒµ‚Çžâ„¢“žíǺáÂÐÁ15Œ´·1xT:²£ gsäÓ0ºD¢Qçöìð¹ý²ú6ÁÂâ²4FŽ5G'1ÃÖôÚ–ü@.ÚÆTSt9ÿÙa†Î-¸#6­vøÖ'+?ÙýóÛå–CÕÁs„ðÇæ¸í]Bì¸ïuBõÄ È ú†l O Ž>ÖtßKÍÜ*AmûTd—køºÜº7y]®aµì±6¼bX:"qßâírÁ]c=DhH,eòúìÜ&%vÂ;CÁbp®i×ü³âüÅqîûÀÕ½ÆÆ0+ì’¯¥íL>Z)p«o+¦…ÕµbJÞ»Ì-mù»y+çÂÂ÷ÙóãØ¸ýX^qÞØS›ºKR_%Ô:éCÕ±¹‡âŸq{rYY0÷`FÙqœ!d@±@I)Ñ‘ãÈÕ1ƒÑº.nóf[°¢¢¸g_ÄÅöqE0@êmVz®¾RŽ<€ŽÑJDƒjT´ Z×j‹_0´\­’Ù¯8Œ)I h „°HO0t.l–yzŸQX÷èÓYRßÞG îumÏ}ÝkðØ%ÇSÌY ¯·à÷ô×?ú=Åí!m‚ü_áoßàíöÏíÏìŸÜ£~µ6¶tÜFRØü÷o&W_#™³ý¡kšIåÿô…èrš™ìÅÿxPc‘ÑCFÃæÆm st-ÿé-9g‘.;³ôŸÛ…«Üµc½ ˆùèÌ&w:£tž`ðô 1<¦oã([_â˜E5ÖêC/ÐN3ˆÃ’<|†x½@Lš‹†ƒ-<þtÌ3xûYEë ˆ—ÄÊqEÑêŠPW†I‰È°'£59ÒøœÛs¼\,(Dôû·Ä…‹P ñ£ê&`µOKÉÓªÛ-ÿlë“¢óƒê÷ÞƒDYb¬Ýiö}‰_—ŽùÎiVúìiäF¡&<Î0AýåÝæv[fp_*Lž¢÷€‚>ªë¨§ó&€‚Xôz¥€’oÓOöK¸_Bu[YLAâs´$©t@òÂ8%·•à,!ÌÒè‚pIH‘„Óøž72B›ìÒªŽZ³ÛOñ*2»}Þ|ŽÒ5†U‡¿âDЋ§0)N»´ Ø®EVOmV@ByhÜÌZp:Ÿäµ'lóž[Ì”öȸó*ÈGòÄw}^ËŸVK‹T¡ßsíC’ÄCˆs¢Š÷.X·AEפ©I˜›Î£€ ¹†aÚ8÷ÚÚZx ñ¨3žx-à¨5Äó¸:ØÜ—K#xò¯=o‚"­K™äµ¬J¹–)’ZÍ$Rmƒ§:qô5X´¡¾DHÂú´oQ>PòˆÅd/  ÉãùM¼ÝSÆ»*÷“}%â=›ø’4ékùW–-;0@M}÷6›ñ`Ç¡öpðtÌÍX®îLsY$âÎÌ7‰¹ãË¿uê5¬¿eª«â²­¡D:pÌù’`†Õ–eÔw±£u2¨zô¸2E¶üƒµüZC›lÝXÊM 4e ¦ÔWÄ—‰J?´ƒíÁ02¿è×äZ®­É=Ta+¾#´¢ ÖÎ4ȵUËš¯òÒ7¥´´ˆ¥y7‰rÙÊoÖäÉZYÜK_5ÚBƒÈ[ÂZ…h´&ÄeÁnÌå%ˆò¢ª RqÛ¤äe †PBqjš‰WÃv˵Àøö'}ç'>´êšäÉg$åÉø„#‹Áe1\AƒÛ´ÖÉï6ð˜%ÜC&KÔûX¦0™kâ3óOá2Т\FÒlÆ á’!læð+î@é ŸY ^‘[xõïS†<ß–˜ ¦R@ROg| ‘Ò\éÎO:Ršµ  {JÃO8<Ïm:¥1Á- YŒ Â%iÉŒò&¨NiL«9hUT,Ø.xŠW¤4kÞ|ÖA‡aU+CÙùîߤ¸‘Ò`LÑôë•Ú¬º”ÒÀ8¡4k¾ ¥!$¥¹œ1JsÅÌ( 7Dé#Jixà‘V)˜¾U)nŽO«¥C)¢ßsíC’4ý-‰9¡”Æ×-B@JC) !Ÿÿ–•Ò†¸KRšµ ¥v´…|Xß<—àVtíX Ì\ㇼ Æ¢4Ôš(JDJC­f)ÁS8ú5Ÿ…ÒÖí%BÖ× }õÂá=Ó—¶O{31èÍ%|<#úž>u£ù`øÔàbúˆ9}!±ºß’þàg~x‡2?X_ä]¼pÇM2ð,s\{´ß> ž"¨¨ÿp[´½ëöK´å†™¾»ñ÷F'ôxÃçRo‚›qºýn»ÜªRc½‹7ú©øqa°Û¨Ö I£ Üx÷üZ5Ï?Dü{)BÖ•±=ëýdÉWI1†&ÅïÒÀfôkÚJôÅà{â§_¾ü«­”ŽÂ~g}û‹“mÂîô›Ü\~S‘5¹¬ŸÃR»õç/ì1n¹ 9ýsøKø?8‚ endstream endobj 4 0 obj 2177 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 260 118 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000002726 00000 n 0000002454 00000 n 0000000015 00000 n 0000002431 00000 n 0000002526 00000 n 0000002791 00000 n 0000002916 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2968 %%EOF dicelab-0.7/docs/syntax-sumprod.bnf0000644000175000017500000000007711303206024014313 00000000000000"Dicelab Full Syntax" { expr = "sum" expr | "prod" expr. } dicelab-0.7/docs/syntax-if.pdf0000644000175000017500000001137011303206675013236 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 383 118 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•[Ë®-9 ×WÔ•wòHH  ‡ˆ*Ôй`ÀïãåWRµ«ÝÁÉr^Žc;¶kßmçŽÿþeÿÝßÎý—ÿl©gn{/Gaÿ±O\BÝ¿·#žiOõ8SØ{?Rì{ÊG!´)¼ö”Ž“fYwôiѼ¸ŽŽ~Úû¾éj i`9B‹† µÑ€z+à#包°üex#ˆlÓð00 ž(&ž{6¶1×5ÃÁ\ÒÞó‘ÊØ ‰|®ý.¯¯ý-Ž=ˆ2ê€}ð—ãz´€øM3 äCÇZ½[—Ö©·®—­þ¸ÞLòJ,ã"Èç1rÁŒFùÚ©¿õ‹Ìæpôž|%&b°êyÓ8RªsÉc,ã©»EO–{hG?‹íÿEÒíG 6¹CÚ­Va §¥ûÆ?Äý<ÑË™û1B7£3+nG aJç0Íõè¥ì®Á„c®®Ò™\;ºÏÂ|9¤˜—céu oF8Yg¾|‹!|ùvr6â%ÚÔj§Ø$¾Z¯’v¤{º‹ª’Û‘W™$õC3Qÿ³bµ”³ÊÇÄÁÒ’ÂMöËÈ‹<ÈDF–ã”ÀNºƒ¥Î躮™âÚ)ìU¶Žë/gùÔ€BßxÁÃv1„Ë™“ÒJUzÉ2 ÅÔY¯½Ä£ÔêÝñ8;Ÿ‰ÜP ¤ÌÁ¼Ü娠œ¾´l¬ØÔÙ&†P~)¢û]Æ2¦?ÌíFÚèj`X&LLœý1)õ8Ü’m¼)äÕaÁÖÝø‘'ÔDŸæ‰¡:˜Mîog'Uþ±îræÂªJ( #°°  ·y÷œf ^Ú.%ØpB±_LÐÅ2ུÛùâ©7.ßøþttbX±#FLŒ+ùf}íäc PhÊ`Iƒ¥µ)¼@ Yog»]nCQc/t9ž—K<’‡›—«˜n±óåê„'¦ÇZ.Ÿ +¾àÁ'èM`ßPÇ Þ&AXž¸ã8{9á¶T.‚.[{›Ý ªHë~9®éy ßñL¸8†@7Áž ˜7‘(fCG«[g_GÁöçŒOã¡òÃ=’Ë A¢e'~B(bJ•£ Ò ÷_D‰üôû€0§[ö8h¶Þ}[S!ÆfÑsëÏp„/Gˆ”i5y²¶…"¡3Ϡ׊xŠ<Ä›äûžÁÂçÍDŽwÉ!~v˜4€~‘eN[`+"I»L’Ú ™#a@>TQM®E£ fÊVü ¼M¿íw½±ðéB yB’y†08˜¦9Lc¢iºMyîC<9œv†9¨‰9}ê9‡ä3ÒŠ;‡Ô´‹„Ô¬†ª• iT/„ÁQ5ÝDÕ`„Âjð< ßÂó|o"hWªb’ŒP8¶Dpmê G×S݉ÀáµÈ5 yÝ@âÖ8ÀvÂhäˆZ Û¤ Dç˜Úæ|ð‚‰‘Ú®rÐ \Ál1±X·Z ‘¶÷뙇Ú7·VˆÜ*&ÁIr‘.Ì…/ì¦ÖÅ7˜CĽyæ°Žõ0s/2“ ›'б†d¨/xF7ÝÏ-ÅØ±náTòRE¿u´%IQžÉ¢±¥ü‰€gRO@DÅ€dÔ€+&S§ÃŽÁix´tÚc(Í Óèâð T”àcs>Y#ñw æB,Ž]•¥!ª±9÷þxdqP±ì ±XŸBûγ‡MÞ=¾:°O a9¹f­/§¾v$4m4íjGoÒ©Ï$×–.ÆNÂ~yKñ€–·žX¢ãPHxðâêCƒ>~È ðëèDï»4-6f`‘Œmº}P<¸áñ7€";ã"NÖ ›SÈåR ŠÔŸhñ‘q‚hÍË€mš$`¶P,Bw‚„è€)D —˜/‹ÏY4lÞÉÁb©˜ö»àYWñb¥õä3jˆH·e„¬!ž _`˜m(ãˆTâÝP:ÞÞ·È6Šˆª PÄHÙ>Œ0,æ%µçœÀ)N° Öç|2_/ÒŒg¸ð”‡ð€½ ƒB­Xú÷CwΫH®IpîRd y öMöÏHN‘2dï„$Šh2<9µŠÇSÙÖÌÎi~Mœùõ¨6]¡,MB€OWõÒõ§þÕÂ3½¿˜*ñî‹MõÏ0Vv¦/vª,–»[µmfVÏÜ`]$Uˆ,‡"¼kHS²pÌTUÀ>©ò'ÐæYö€ á¼ X°H€µÛè6ý¶ßõÆÂ‹´xŒÕ»*Vûkò,Ú· BwhtuöŸ‡¼úluÈ‹ëögÏ9)²GVí¯zÂfÊ®s>Óþˆ2¦ù,d5/‚PÇi~tªôîwóS<ÍÏÎÀM‚|ó™~ëmMŸÑ>ô¥†$ƒ1t} ÑêÖÙ×Q¼¿ÏxyG¤“ é£4í–>BN÷ôqä[ú8Òœš–ôq$Ou†§ºæ vG½¥×ô‘8z¤“¢é#f,é#‚®%}´ý<}„ ­éãÈ·ôÑ §w!²Ìi‹{ú8'iúhÍÿF¾¥.WŠ52õõ–>Þ÷»ÞXø´v’×=½Šg¸§qKãé#æÜÒÇxžô‘䳦ðHQ¿º¥ôäÞÒGìrKÁÈ-}|·ðq¾7Œ{úèI—ô‘<Õ=}aMãY×ôð–>:a #?ÒG£x¶hs>ž>ú®š>‚«%}¼¥8Õ’>ú™%}4¸æXñì·Ë0ÒG´—ô»­é#˜[ÓGà%}\S´N_ïé#OXÒG^p¦¶ŸYгcÝ}IýÖÑ^”•˜5r‚ßbÈkú¸¤‘ëUkúQšé#àL#ÊWkúè„it!ÜÓG'¸ÁØœ‚§¼«§@KúxKù3}œéãCB,֧оõ='ØtÊ»§ ¢äxÿ<³ÜÔ€ï'û,$eÜ( EB2þ-ΜjÔ¾ï3‘2ÿcOQ?2¡q[fù”¸ò`ýªÄþ†êB‘ãøðï§vë¯ð9µSÅÊc@/Lbu 1±òðoñAÛ·j|`¡H/xá¥iiЪÒE ™ÑÕºæÆ¦ 1#¶æË‘ y>R_ŠÓ%ÝY’î8¡s|óà‚âE„²1ËÇøM1™G®mø€:§V[ö »ÍØ(²G ck*¼˜0’À<â ÂûÓjœál SŒG„QQJ”ÅÈî1œ.Í7+šâÄÜ8×ß|@ã¬Jìí°iŠó È{° ¯Mó‹e’¤8N蜣â Ю.TÅ!}€n`Óoû]o,¼8s.jQ¹áæKI„(bÃcX?—¾RãSpüu~í©ñ%CwXµ0d„–,ɉ%òsç#蜅 / žCS Ù›jqÓÖŸ@„ Ò®ûñYf¼‰l°nG(·@fJhülÅ"?D ˆG-–f½=ˆ®T¼kâCpí*a‡­d΄Á@Ö4Q‚ ËãÑ›Z‚ K™j„ªò~Äêk™ë^ÓÌ‹ä"J fŠ1ƒ¢šÃ®ù¡œäéPèÆŸ±<¢ÌMërI_WÁB&‚XÎa᯽×JÀ¯X4]\{“”@á>‹j åÑ´zˆ"ßç7q —D1¾æp|«X×5ó½D 7×  :SX‰:%ŠøP³MÄìÜ¿= 균Ηv”kØ}Vù©Öâ·+ÿºËû)K?—Ù Ý}¡¨.Êl;¢®>M%òTÞO™nLîÁé/ÿ’ÍlÑîÁ+|O°ûÁb#º§±ÍÌ13}é§€º¹ÿVäîû.Hvß´;êèÓ}ûõÞŠÕûV|_hnu&Ùi–¨™2èò6ý¶ÛõÆÀ·ˆfL×@J A‚4Šu•e ߆¿D H´2KBª$ Aª$N²GŠºQ%!­â¤27Îæã÷F½¨>µW[öPؤmü<çlº¦BŒ왼pA¡f®’€#ÔDªåÛB‘* ÏüÌpÞDã¼Âfîû­’€¡ªîB4 7*WI6­’<„("¼Þ.Q,“¤Jâ„Îe@>ÔPU®ŠEHÀ|€n`Óoû]o,¼øþÐÂV­UdL°êfUÔ—:¿šQÒƒ*‰6ÌaÓîV%Aµ(ÕuN@•dÁ‰«$´‹VI0UeC¢XØ$d±êjU|ìIsÀó0| Ïó}Š ‘+ª˜dRFü~¢J¢êœÎ“«$®î p•ÄôåÄî§TIð“¤!¸TI”°£qMD Û¤ÛÑ¢ˆ-òA(V%Ñ]õ ¸ ‚ùçÜçiÝúko:UNúõÌ…«$7·VJÁNT W1 ¦ç›Û(KÀ\èÉÆnj]R%!æ¸J¢`TIQ%™‡Ñ*É”™VI0¯çÐ* <£™‚íg–âìX·p*¥è·Žö¦$=t¢Èé…à·âjeˆš 5 WIƒÇÊ¥ON´~o®g¨ß¼œ0.Ù7P„àÚï‹|ºUIxW~¶_[å* vU–P%QxÉ!Î6ûWIËþˆõ!´ï¼yxÏøÍû?EÎÆQD¨]KìPDpŠ&ï>ü[|H1ÿÏ |ÿ§³:‰f—ðk•Tšiö»Þ”ÇÚd«à†ü´7ɇ[o¢ûçíOÛÿ¢ò¥ endstream endobj 4 0 obj 3823 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 383 118 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000004372 00000 n 0000004100 00000 n 0000000015 00000 n 0000004077 00000 n 0000004172 00000 n 0000004437 00000 n 0000004562 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 4614 %%EOF dicelab-0.7/docs/syntax-if.svg0000644000175000017500000003074711303206024013261 00000000000000 dicelab-0.7/docs/syntax-ordering.svg0000644000175000017500000003276011303206024014471 00000000000000 dicelab-0.7/docs/syntax-dice.pdf0000644000175000017500000000464111303206645013544 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 195 86 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ•WË®$5 Ýç+òEÞ/@Bb³D,P¡„zÀ‚ßçÛIUw_!î¢ë8qüˆíœû— žñßýü—\îG(Ý×|äýWá›l\²Ïí9úÚŽœ†Ïå¨@Îàés>´ÖrÚjixÊw<×mw8ÚÞÙi±±±§…úìD£Wú‘KáA<þ\ØA0S¢ÛØ'7´0‰R–íe”å¶!ñº¥º°,5ûšŽ\§_Hósúç|=ü‡Ó$³Mfpk?6.G‘HâP¥A…tjm/ÛѦúdèüÀôç·ë-éYrÆ.üí¦ÃþŽ»08XQ'e(nØ#cSw †8Ü’8:B·6¼#·ðßG)hBc¬0‘‚%ÈBåÉåV9§"dî*w„Íí Y)Î`ô*!ù oMøÜìd¤(Îî’ …[:ï‚i¤nYµ@½ŠŠ¥cÛO‰JˆÝZטٸÂÝîV¦²’ÝÒ¤Ü]¾…XM ´fÝ%üŽÎ‘๽ž•áMax·`”âÝr¦OVÓˆœÒnµwuй³—ÕSm(CÿÚE’£²ˆlTf ö-B@ºGÊ“$ŒMM(„Ï0|ÌAßÞ„òÁ'ZšBÑlnž—àjº4¶+#\ c:o¾vBüœX•ç*©­šKä~O "ôk=’ýq@aT¾dHÒúš´oyòøžé›Ç¹ú­äÍ” Ý^¨ßíNÃã‡1ËØâýS˜¤|(¹•Û'—?»ŸÜ71S× endstream endobj 4 0 obj 1434 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 195 86 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000001981 00000 n 0000001710 00000 n 0000000015 00000 n 0000001687 00000 n 0000001782 00000 n 0000002046 00000 n 0000002171 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 2223 %%EOF dicelab-0.7/docs/syntax-ordering.pdf0000644000175000017500000001203611303206661014444 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 238 162 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ[Ë®-9 ×WÔlò~|`ˆ BÝ-tîðûØ^¶“]»º¥ƒîàn»œÄvœÄ^Éù×Nþ÷ïŸÏßý=œ?ÿçÈýJ?cš¯<ãùãÜ5¶óË9¾RÈgn¯#‘é•Ó8syU"£¯3çW †.VÓäÝ^ úk°Z1µWÞ§‘$[_±'gÙgrôÊåR¤7å:3Sb¨EœÂha2™2¾—QÖx Å„–*+¤ùUj&ñÊu.>»Î›¿Î_‚GbÖl“ýº1ãË9¼úˆLŠQä+QÑý ZœZ[:€5ïzRá§Ù/é5rƒ'c"‘^³TiÓÉC_'Iô1e6SdµK|‘7ÆAmj‚!°>“rÛDÈ?soB=Á_Eæ‡Ãp„êŠÈxµ¹3h”X†ÌAo Š”¼ ÜáYø°ïÁã5ãðÀ$(ƒüÉ}Dæ0=œ õTë¹Â©´µ y½ -1çĬQ_‹áÍÅÑÇâ¤"aõåm>]VΗª†¤UTšW ‘m#/¶*޲¾›hh •<Öj%WòRØÝ¤ôxUþbÅ G³ÕLžÄ8ü{}Õ®˜›1u–ÝEñfu5bá;¸Ã|)èx¾RLû M)ƒ¤Ò†3b¢²ˆ3l‰QCƒÂ“ÈÜô;­j"S¦¯³¦Wmm P´ XD;Z%Ågô}óZ ‘ÖP@ýÖæƒAŽàMV š„1iZˆ*EG…J³g'/1"ôõö/Ý h¯¼yˆÝúá4óëŸo~çtþøÿ<þú·3¼Âù#†ógâÔ(a-qø¦ðþ“™ÐzÉtœ°äöS>ÞO›ªÍ Ëÿò MÚÔFÔÖúãÇ9ïý­ˆ%°Œ·âˆäµ:ÚÆ!Þ¨\ü;>r=øGhß´‹•/ͬ`5d¿eÅbÊþ«êGùUš}- ý•õã/‡÷ûé”(%Ä:mªœm,Π§ -éo÷4]“ÖdNÒ„Î!§™ ÙR")ƒ4™|Ò !Kå 5‰‡ÀAO‘{¼QŸ#'!´ñ£ÐéÄ'–eBétžÊÈèåUºh[6ò"s›À2—öëÞœ>Ì#¼n¸‘½yÉ8´­K³€†º´}Ó¸2O à$$ú} ¢QÃÜœTuLg9µÃÎ$Žâ£œöDîOÆÃ"²ñ@ÁL  ‹Ìõ¥Ó¡²y7“žÍüÜwcÀ™À2l8»bq²ÌÉâ 1–V‚µ!Ô eN#nAC–ÌÑ81Ð^'¹˜ua´©{,VUµ ŸYd›û*‡©qV¬ÈnRtòB™§%I‹Å¨ILkPt"6Xb3rÝÍ]ÍM¢h6Þ$âÅ€G¯óîã/™›öª’ôwQõǹ·k"µ8”ª ÅÙœÁòû'¿%nqbÃXïÃ^ª<„ILrÄp¿©V×8¾Ò™#ê2‡b2Æè1ÀGïÁŒ¾D"èæ#‡sDáÚ&¢ž—G‰±Ö°aÞ1Žn"_[GÆYñ r!Ô Sm"§z;÷)Ê"¸@_0ˆ“»]Ä6G>$ï^oxòÉÛÓ75Ö½mœ!YÐׯ±±tkôE‡ÔXÛ¢Œ+Ì%Ñ9AÝNómqLICÄÀ&µH°aDç}YÇ*õå>F•ŒjS£¸$9"Úb£8g‹¤ŒÝÎ9‡³¶9-¾Ü9CŽ*p°Ò`Iµ±’ìÔµÓi€MÅ$šÏ¯÷c10×&²4é·x[›ÀcgÉÚdZ÷t™Ž.õl™Q§Ï΀4 ß+Žh:àúÍêiã0m3,{—ÒÇn‹‰,Í߃Qv¯ýNV…”GÂ:wÍÔäW+ŠÙã_É¿¦]N´ð6‰•,A75À.;¸ËâLÙꩯ‹ƒ“ݺ1È=eíq²tJÜšGïüR ËãðfYƒu¬4‹ 0.Q<Á2ˤœ¥(Yv@iq¼ 0A4²˜*É2H0Hv å0M° ³è®Ṗke*h$€%]¡½!à˜ÅØTù˜p?·Ý´›ZgŠ­9g c]¼{=ªò°ÁÖØ‚½+°E,¸ µ.Ã2ÌÐT£ŒT 2㜃›šê‹ÈpFn{3ò×ÌoŒt†ÆRt†ežQ…X¨ŸÙ8 M Vˆù0LææÃØ'‡tÅdº–è‹3¥aZ`‹üZÓøÚ8˜ÅHÍ)ExçŒhÀS¡çl¥ªX°™ÍíÉñ€3«£ONU¼æðÑÕlÖ.*-+¬Vÿ®kLÌF9›WôL¸yI­6€ËqÊ ¬J %zÎÔú²)È k èÆ% °¦y#Þ,x³»è´aPJ’Q´(~£ëƆõ…åz™€*=}·êÑЇ(jI!€©€„sÖlGpæðÒ&Z`¦¥""FÒ‚°HlÇ—r˜–3%ŸlAa—ið´³¶ šk˜wÎZ`ÞÑZOÎ éÈàz*ótYìPÝêLÕ…¾‰¤—µ¨çÝgâê?~ëxmÍŽWd¬u7c›µ‘ÊWåþ‘=¦Ç§hÊjó]8% ò+Úpb†Â:"#œ¢°Îâ ‡uÂw׃~ôò :±Àˆ©ÍlHñìÇ<-uY|‹²/ñ–Ž J;2DGú|Ft¢TÌ´êÓTDœŠe@e¾¤Dó2™Ó?Y» VÈÏÅmí¬›Ô‰äaýÙ¥8¢KnI-x‘3©pï4‡Ñs¯P†à¼iÀOdÇ œÄ6E0˜Äa ø^fj«ÏaÈ”¤ÇJ²~²Û. ù39Æ"›æ²Î >MiÞà&©Zø ?ÕMEÊÁ€$T v,§³ iPcqÆE;€A¤°ÑÄõ–ïŠMQsÆ€ºtT“è.¿ƒ‚diFf÷>Ó©I$†xH‰! ²DÐ=¢€Ü£ì* @Œ¡fÆéÚ3Ÿ*ѧŒ{ë}©©C†òØ»0Ú ³ÅÉ‚8n]˜}6Êò€éa¦§wñn \@«ƒë®Í<ãdA'e¥5½ûÀ ŠèØEhDÁ]¬ £—yÆi"±uaKËFéò˜&azzï¦<›÷„;DE‰º£<Æ^›G] ÃQ9F™6”GÎoe\€uøPRŽ@/iSʆ “¢(³|Ø0îŠ8'Y¥ê­’£<Îj›Ð,º3A¥€àÙ"Vp_8PRZ€—w§ä¹;òÉÙýa™ÿ8wÿÿ%œ85Q±h— ‹(HO”¡`J-Î:#Ù‹. R3öѯM“OΊƒ²¦Ù cME󵑉ÿ` ¹`»@—ItÌtaÆuîÓ%K?q`”áEºàä¢(÷-ÁuõM#hœM&›C£§|Þ& ó|›ÃoåiQvLA,ב_(#ZÐDMû8w)€ Öâ  ¨ÔyÍ+²8‚§;z$ M@Nø7Æ%¥ ʉ¹nÍ«w~)•ñfIAë8YFIµ\Ð[–áú¦ ºÙ8 ‚p£ˆ91¬@@Þhñq³ ¤N~p˜¤‚âIÎZ§ëAÞ]‹©‘·Z€ [CAœcÈjS»‚ ®]·Z hÍ9këâ}ØëQ•‡ ¨Tàì]A2@j¥ ÉBSmàEÑãi,$ëyÔIA¶fA@‘‚ÐX‚€ ª E€ 'áS )Tò&òaª»±Ï¨”÷¿?ÎÅé ‚D€ ùeñµ!ˆ€ .23M?ùaÈÄÞª ˆs66@›»Œ òðfŸœì ˆ³CR0ãôï‚D€ ÊÙ¼’y÷° ØÀæ8eAÀ^^rE1_¶ ‚ðsA\baZe ‚lnT„Û€KJ¯–gr¥ÃúÂr½TÀ”n‚¼YõhèS5Mkº Îñ٬͓(YÚD[„ñ=]©Õ“(AªUr h—\‚8k ›×07Ž/0oµÖ“³š µ"ƒkAˆ,šE™nSónAØ Ð7‘fyWªçÝg†7½ûñ{ H°ÃÕ¡þõVîß00 QqæÃ@6ÞXÈÿƒ=tE~E*¿åv*8Átüát3ð£×14îH¿)ÑôÎÍ~T|á¨Óé“L;ÉâÊŽF2äBº{.ÂÙ«ÕL4{›æš22®™#¨!4/p¥ô5 öybÐñD@_Uôª©¬Ñm½=ñßA‹¼ÓvÃ¥¯3ºDùÄ{ÈŽTï˜ü`#)¨ïJ³5TNçæ}±\òT`Wt•ý)†3ì%†2Š ¼q‘‘Q_LÈã5¥¹RŒ²ˆ]Œ7W2{-ªŒhï ´yÐ2ý+yyjçß‹ìÞD"‘.²;=Úë 0ˆÖÇEr7¢%-Ä{–Ö´Q‹ZÙÂÁ[› D¹ÍîIfØÉì¯.Þ¼‰GE60bÙ› odO.”Q¼¶ä°¯')ppõR¼È­ èe=ØXã]O*<†xÒ¤¡ûCŠÒ¬ ÆK_ÎÏz´ÇºG®h¤µ÷6"¼ï‹à6.îyoª|¯¾©Øê"¥y²sñQp"žz4ÝuèSÛddtØ\2î 9tQØ,†Ö5ƨV—HYC– dÁUã¡ô…»¤Ø–@\M£u{ˆxô -Ž÷±úTò’{.gü;®t‰Ä»¦jÑoöâX)ƒûÜ5ñÇu.‘¨Rt¼èe îrÀ…kOZÅ(™µˆ¹9%Œî(Ù+odŒ2ЏÄíöXÞüZ½zÁ® èÖüm¼ëI…§Ê7šìI.··ÔÆê\Þö¶Õ\¶8Ï&’¢EKÆÍíj“åâv£qoK£XÅ’qm«ŠÈó)X6.mi¬\‘;[¸ƒbåfß“ p©ùãtFE¥Rp]ká\p[»Â½à®öpÜ–òJ—*wŒ> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 238 162 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000004666 00000 n 0000004394 00000 n 0000000015 00000 n 0000004371 00000 n 0000004466 00000 n 0000004731 00000 n 0000004856 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 4908 %%EOF dicelab-0.7/docs/syntax-firstlast.bnf0000644000175000017500000000012511303206024014627 00000000000000"Dicelab Full Syntax" { expr = ["drop"|"keep"] ( "first" | "last" ) expr expr. } dicelab-0.7/docs/syntax-math.pdf0000644000175000017500000001760511303206647013577 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 262 258 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ¥IŽìºr†çZE® MQI­À€ž=4<0ÒxïÂ8g`{àí?Fß(«.²Œ Ü£± ±ùõ•Šõß[yÀÿó·Ç?üGyüí·c÷QÕ±Ìq 4ç8¡EGkXÔòzlÎsÕ }X9ö ½\`Öƒî·Ù¬>2± ½žÐ N°þ9• =ó2“böz¤ þzü±­* &p]ý‚¸Z&pü2G޹ƒIÔD+Ù„Ú»% 8{¬ïõ® ½=ý¶"xtŠä^W’VžW;1ÏXúõX)ƼðiÖšÝö眇sl+ÏY©#ÔûãzGwIV|.Ÿe%•âÕðùÀ0œåÔ†¬$óÙ/ïXµìmâ3½SCÚáäÎÀS¸õïMæóÚ§ÌqŒç¾Â·Ì£\:œ[Îó|Øp_ŽÚºM€¶¢Þ'&(½‚¹_=µ5„_æÐ€®I0vulÎSpXý²<7Íœ_V+ut[­ÚÙ†³ÌîÌôjŸÍîKŸWÍë²¹Ùl]¡ÏÂÄö§p]÷“&PéP›Ì®Ò©Ë×rlz•18Á˜®3çÕ|ˆÖ´ºõîÜi¶A¥êTúd¦hsø6·´ãŒ"ëÛ®Ýɹ„ý 1qBuÈS\޳4r¬á¹Ì£óý5«—YIƒì×ã¬Ï³wKPŸeRÖŠvîkðïºn¾Ì¡cä,V5@2ú5ÏÍÑqQ[3j­è¸ÖcYVk\+5釚/ìDv==^ ÖZ™"a½Mâú/ÿ(qÝÿ·ÕÇ?-ÿmÿöï5¼ÿ¹íåñÏ5“`‰þ«“8|K¸<`¬à¬7•²¸K¸½i9ý¢Öàªö¯´dP*a­²”›/~?®\ž˜¹Æß¾4xà9Ìî=*MþIŒ´pQê‡ý‚Æ7Ƚ¯%®~ÑU…+\®åïý±i†{o÷Ri\»Éï!ažGõ^vR°[¯Ç´]mÃl¿×$%ÁŽËò^Vð‹Œ•ĦY ®kZdáuo/…¤{ÀÆmwÙ % Q 6(‘枸ÀCj3œXX`ÀF=±l˜Y\ë&6ö…&˜´õõ„šë Õ&.?Ô‚ûùòÑ~îò‘¤PGCM°ÌÁAƒŒÖ¬“Jl8¬Bì±*¨€\åëm3îËå^í»UÜw÷r’°™ƒƒÒ ²XO—V°½t’êÙ j‹Õ ŠÃ^‰ —­¢ºpŽFòÉ Hƒú‚‰Îs’ÂXO…4$†&¹uŒžKî움ìm°õêmGߢÉ{ØÉ;ªyôi. ðôŽ6ê°×b€…€4vaØ(Fà­ bÜI7ðÚ‹#Q\VíiÕ$N0ÍeóI]5 V^Ñqáã$J rnª¶_Ü¡2\’ù”ç#ÇŒBãøÉ®‹›$n»;>sl5\µ*¾Š«¾xà]|7¤«‹ïnx٪ܦý²4_ .0Zø›¤1îp°|àÆëâ#–çS@R*ƒš/Zä¥45˜=…Ayš‚Lþ£vÀ2Ê@ í j8xÔ°+€šå‹ †jJ  ¦Ô°í@ {¬ŠA ×ðzÛŒ¯A F5‚š•+šõt¨QšÕ j\65ÎÁ fÕ•@4È@÷0¨§ëA%¹ũëì7 †­5«Ôð`WP£³Á@&aT²ìj kÔøˆ2–qá"Ï~õ„eÞy® j¤Ûjtf1¨qsAx4*8{=¨Ñ©müÂŽÅœXjÄt ÆR¨AÛ°¨YaÌ ¦ÔȼaPcK@&àF×j¾ëè7 ÆL5ö4Ԁǃ°¨a‡5ìQP³ªñ ¦7Pãª=­šàqŒsùù¤Õj`R{P•{Pö5š„@ ˜Ôp̨Ñ8~ jŠBÜÉñjÝ%ß~ u¡=to‡^|Øf¡Û¼ÿ¶ûÔ`áï@MÅ!SP<ˆu^SHÊÍ*…ˆQuÖ©œÏ(È)á8‡„®hÝŸÚ£©á8‡»uayÞô²÷,/œ‡å…zÁQ^ìýHúbï5 1š}wÓ,Õ’MW:.Ø­t½E•±l¯26hœh ¡ gVÉ«Œe{•±Y½—RtØ^h˜½+I¡% ÒÒï3 ©Ak€íņ ·.нEµ¡ÕHí®6nMyGAö¬6ú•ÕÆJ“Ô Š¤6V¶¤6úÌjcÅ+ª €UIm¬4Imô‘ÕÆª+©Õ ¤6RLj‚äξ ÈÈjC=¬6–Ô°•¤6–+¨Ñ¢ÚXvRê±ˆŽšÕ{œ¶àlï<¦6¸vU«uAmŒ3«ÕŨ68ª6R”p¸žÔ†8PmŒÕÆ8“ÚX­Œjc9‚Úp= Ò²Ú€¢LA\¸ÄS2yã9n\„»­\Df–p›{ÂEØã¢rD.RÎ.pcGó\¤‹”ãÆE4s‘rD.RŽÌEʸq‘2"‘y#ÕŽÌE47ºG.ò]G¿á"ed.bOS¸H™‘‹”™¸H™™‹°G¹H‹”qã"®ÚÓªIžš¹ˆ›Oêꉋ”¹H‘‹”qã"š„¸H‹”qç"å''âfY””.c—3„.aa½˜|«áào|“wÞî¨0e"ûGÔ´ƒ¾êX1‡Ï{~?Ìsé'@poÇér#yê<‰‹Ä‚”‹€4ZEí´£‹g‡Ÿ­‘ª=Mtý„öw¶_ôù~ï¢I¦eÇ1H…¿ØO¨˜ àäïÃNô©“TÍk,•ÚNŸÀ4úÔ¦4ùRM='~žQÀ¿`¯A0R9P?òÁ ÈþHI¤")BìÆ_¡™çÀ¸"ÖtÇo‹¤²_®’BÚ©EÄ®èg[{ K<óɘ7 X‘úÃÇ´wùf«˜¹ŠÊ®¦{bäYϳVzü¤Yö‚Ÿ*Ùx(òYŸøƒß‹°‰RÛ[|p¼p»'žƒ_„è÷;p]é1¤`ルkoß]>E‹Û?8ò€ˆè¾P2»«…ì—k‡¤vj±+ï»÷œ²õ"k\ñI2—,)ëê’›—OEÈKr¼£WVöÎ#ôñŠÊ¾Ï¨ì Ei€Òiû½7—½¹‘¬Cèãô½¬"£(ð—í>ï$r^èãÌ2yq9ï:t(}<ƒÄÛk|³O£1´ô(FR×>£ÐÇ3È|°½Îw­S=ðB_«‘"Æ]èßšò¶µ,ôá›É(ôGËB>]LB¾ B¾‰BÀfÀ5“Ð_i’Ð% }øæ4 }ø84 ýÔ1¢¹³ï¸QÉB_=,ô—„þ˜7¡¿\Aè…>н(ôÕã"zf¡¯•õšíî1¡¯µ³Ð‡ã£¼Ðçs²Üœ% } ý%‚rWúâ@¡Gƒy¡?fú4ƒÐ_Ž ô]Ï„>Ž,ô!OúPªúR­N,m—$¸¢Ð½zÛÑw£èÌB_=ú4áP+/ô癄þ<³ÐŸ- ýقПÇMè«k:虄¾zt‚i.›OêR¡?[úË BÙYèC‡¼Ð‡£³L觘}ÌqüŒ>^¼¹s„«ÀÙ|,Sà#íÅ$>:ß4øøè7ø¸ò/Ú²4ñàÃÊŸL>ø¨rµõ òñi`V½SŸrÎxçÓÅåß©‡ŒÏïÏùˆñ‘Oñ€ñÁLJ3Îéxñ¡§‹=\|¸³Å©)©ù¨>.mäƒÅGT|ùPñÏáHñ‘g{c7Âyâ#'>t–øHG‰p’øˆ‰|ŽøˆÇˆxŠø¸">¾92“1ÙÈGˆ|‚øÈˆžyàÈLJ»vlæéùdð›cÈÁ˜Z+utð'3…¹ŸÍ$Æ~zŸûÏ߯íèl&²ý á#>nçƒx<øˆ§ƒ|8øÈgƒÒä› ¾Nù`ðÎt &[ßuíkÈ7ò™àöñx"øèŠ¿ðo“Œ|¸& ¼7ÂiàC¿Å‡M:&y®ìÈ'ßrêåÆ\oÄcÀG<|œÚdbz# ”Czã~øøéàCØÝÓº§4Õ…Îuv§\ ¾µ.¦þN唨¦+HHÞüêÐï¹¼_ð™ß+4—žETÄÇ”¤Œó`3ÏJßW@ª|\>Œq)B}¿C„&|F!ð¼8€ë‚$Âj˽Éq[·ºKCŸ?]_ª^ˆL%˜Cèà *~¥ÄT¼G™€¿…b:aï‡e=L) ARArl²„q™¶Ä­n/ø`j «EA,lÎ#À¡±Ð» ZŸºÝèši‚æõ‚š*b 4ô¸c»L‚š— ò—¬tW;k»Ñ ØaÝY4ä&¼ã G ² à*ˆøÆ&ŠXíƒh€ßþ ¢¡Ï(à÷Õ¢hX)¢h€¿?DüòG ðû²A4ÄÎR8þT4¬yEƒ8X4ÀÇN4¬7Ö(–#ˆ†ÑƒhXÿFÑ Žpjy ì1Àyn R«ˆx÷v¢ƒÍ(8lÛ‰é3‹6ÃÎ:f l£h âD|æEÃèQ4,Û‹대ƒžDdð¢ t¢ëÓ™"Í9*8Ñ@Öw]{ Z â°Óª[ ³Ñ0[ ó¢a^4ÀW=A4ˆÃ&÷Dƒ8ì´ìšDƒ8L4@­&æDÃ2£h˜-ˆ &b„ˆ´ÿ‡h˜“ö¼?!CÎÅröS±Ícgbü..Gt¯Jvùë%Ÿ|$¹~éå)¿õ¤]Suû£mþo¹éŸh«þï¶a>»Þ(É_·¿lZàì¼ endstream endobj 4 0 obj 7036 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 262 258 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000007585 00000 n 0000007313 00000 n 0000000015 00000 n 0000007290 00000 n 0000007385 00000 n 0000007650 00000 n 0000007775 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 7827 %%EOF dicelab-0.7/docs/syntax-let.svg0000644000175000017500000003037011303206024013437 00000000000000 dicelab-0.7/docs/syntax-scalarconcat.svg0000644000175000017500000001234111303206024015306 00000000000000 dicelab-0.7/docs/syntax-lowhigh.pdf0000644000175000017500000001221111303206663014271 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 367 162 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœ[KŽ,;ç*r…ÿ¯ ‰0D P¢Çê¶Oüít彨P:ãdØŽNØéúçNúû×ßÏßü5œÿ÷‘û+”~Æ4^yÄóû\€Ûùå@ޝò™Û+äˆbzåg.¯Šâaòuæü XÐÒ,š¼ÚK„þR‘GLíÕÀë4uë+öäŠ}t¡W²(—µQ+×y,ÈH‰|Àq0Р1ey_ ÌöDdZªd*äW©à•똢Äì:· ~¿ØµDÐhƒâ: ðå@¯‘Dv cÅ&z\Eæ ¤Ö¦‚6`Åïí]O&üòÖû%½ 7‰dL¨RÂk”Êe:FèëDƒ{3E2»Ä@^€ËÔ$Žˆ÷ÃÛ¢‚ñkTèIâU¸hB¨nªÀ«ÀVbîƒÞšRò¢°;C½ðæßCà5"øÀÄ(€qŽ>s>œ ÖTë9‡;©´9 F½+„–HŒcH¯á¾&àÍ8Š£ÇDRáaõåeÞÎ3çË[UG´*ªL3Ŷˆy¡Ì÷ììB9[1”4Ö0© ¯JÏ)V™@¡Qk6»B—‡¿¯¯ÚUæâLe Q|…QÄ»e¡vP…!ùTÐö|¦˜9öZ,ÅáI3J¤Ÿºö>H*.1˘¨¤â€õ"5px¢˜›¾ÇYbÊ ƒ„äë¬éU[› 8Z@<­¢á#úºyMÀÇH ³1@ýVæ À@Т†3†ZM ì”JÑVŤѳ‹;ú|ë—.P¸Vn¢°¾ÍâúÇßZ\ãùŸ#¿CüÇŸÿr†W8ÿvÄpþþLÔc€…’Ì%¾)Üi ÓΗŒtBšË#¿>¼ž6Ô@Ïÿô%mh µ´>|Ÿc¯oŽÀñWéx)‘4W¡-êÐBåêŸÄÈí îâOüRã¿ÏØ‚ÄO·Š¦C±&51V0}ÂØ§XóŠ©W³Ì§nñbMþÀŠW,^Öa$hx'R<¼¬þ‰Ú<:LÌôCˆ²¹æÌZ†È’+"–¸þÿe >@ø°ŸÙúÌ@vDšÇL‹9û“¿ÍRBß Cs~´ ¹‡½ò‡q % G i†Dä-i*&ÉÌdÁ¹i„÷ ëÄ99!9Ò”F9-ò…-Ž»²×B£…ÈKäES´9 C&´·t©—(Üä‹êŸ*IšF¹×2Ǫ"æQׂHØ{\8ŽKÁ†¿¹ %›„$¿‘Wi*5ć]fë¯ÌS%ˆô?×Ev÷Áµ?5©‚(šmÔØr+*_Œ%×®! Fr8µÉðëÜ{vøucıuXSåIæHñáœC2R#ˉWŒʕýpñX#4$Ɔù ,µWe) `}’µÍúf…"Þ¥ZÉ&³Û€*a"F£(}$1w™´¹1ùbÏ(:¦ È6' éíáº8Ì{ÂLiå(>,¾Ï‰ä¦E(g*ϧyÓ1gVd{â“rÈöƪpyŽ=EýïK6¹¬Ÿn‡k¨³Š»+,Ä»³Å=E°-1¸¬qæéófiئÚ6ØXS œ,Î*Tžî9’XcVaÃ̃èSËìp ³Ü«¸»òìÞCÓÖlY÷¾Ï‰`ÕC6|rnïaàmÍ­‡qóœû¢‚Kvk¡èæ"Ȉ¥Î¸Äæ V¢•9u ÷jÌ/Vìçj½Îu•w½,CĺeðŒ›ÆŒ -A½{”$ºCã0!¸!¥RØoF|dtÙK­ƒ‡6:õ¦h?ƒ ‡±De<9ä¬ÚÅa\¥š.4®x3•–Á¢í.ÃiH3Š,Îà8£µrsîÙáOÎ$g*–üÐÓ-iYÆe –=•æêAÓ§Xâ “j–ù0ƒK~` r$MäX’Æ™ É’8HŸ††Z5¡'MºdYÅš¾Â}5‚*óáYöÅuþ ùBÚëÍs¯À|Ó‡N!Ò j€´d^´Stà IÌØ· €jep¾ÜmoªoÖV9<qK>5îFKž°ùñ”&à8GÞÀziB~Ÿ ÕU h^œ¡£Qùž’·Cå‹é<Ó°5…ÂÙ‘±ûl5 ë<Óâh³$‰R¿Š’€Ð^ÝßãÌ-^†(£¡5V’?(W ¥ƒdæ—þ’—’âi["^bL§¨›Bå4­ƒæÒ*Jì®s æ—æhH—Uò{-ÓXÅŒ ‰S z:%ážBJ \ë÷Òkk×CûÏ UÌ0 X&É­ƒ*¬ EN—ü}à ËK‹8€6´¸u°T?ûŸÒ˜>ß Z÷£i4xf÷+àÝúójíþ$t`Ý«MÍîGS(¬þžòùêÝo¢wÿ=’_š` îÚÿ³ö¿Öƒ(ÒcÝkÁõîÇ Ñ-Õ{á[kדO NÄ,³Z|Ÿ`­œÞdIƼ?o{–þÎEWƒPˆšÚtÞd h™¾v";ÓžBc"={#eÞf+r’œ_׺ƒ¿7Œ8 °Qs鉻½· tMgD<|˜þÊ)9¾ÄIÐdfð® k”¼VQâD øá ò‡FטqBÑ&†Æ)hC%½É,Ÿ|€Ï/}0HƒËXÜ€½Ws±>N`Tü©‹Ÿå/Mó„Ÿ'-’(”&:„p¦@‹#š+¸úGvhöôý¿ä$}ªžm1ìHnÁÊ<’û8}²#Bl‰N?ä OŸ£ÍôÎAyTɱ!Ì’ÍŽ {_1;6ô2Ù8íášöé9yQšûÃ1Nðñ)…ùú–ŸJ³·ENwÀ­BvÉ+ÑÐ}o®´âcû @ý/Fä«+}Áÿ0ø+Ét®€@á“êª+?!V„W~9å@™Ò¯)7=ç8*Ù–5x“TݤʳŒJfúî„ùª¬EÞz±ÅŠ,äÀN ú8K2Ÿ¾©Ó‡†çò™‡•TÙ€çnKš#CNF‘µŠ¾ Ò2ä Êdr|DùÖá*‘¹ÕkPÑ—5*óŸÞ[Ó{3Â5ÌH«¢êß!÷‹œ*.¾¢ÅQæøg­~iØ6Ÿƒéwj¤W⯵VƒÉÓ9CÀ5¤_ô Š·1l‘v+Lì·’3ÀŸ;÷Þ¹)VÔ/4¿q¢e94Q„¦^ÂIRÙ!jœ(7\+ ¢äP §1^,:A€›f®!¯Q1>¥ïó2 õ®5VÝy±bZ42šå–BwWiÑxwÿ£/hÁ?¡¥ª«,?ÝVÆ%ر몫½Oú„ñJ"¬˜®Ô³ÌÇ+uð•öö0 0æÍXBú†˜cÁ`2G€Oí‘Ã`µG·vñ;ÚC–WIv„ú.òçwR?ì±L²õŠŸVý$§·!ÙÝ‘Æß’¿¤Ë‰ï˜Ÿ"o4pä¡¥À%L¡g™¼”²vYfm¿æ®Ë>}ï˜ ý] ~níìÈA†kj‹­šáôá›d>ìF™?{£•|j¯²Ø= ðw&U‰®n²DçZ·DãuLèׇ@?±H“Ï!OÀ(¸É%$D˜‚GÕï1Y)xè}.V±"LÁ(Kßd¡`—‹S°Cà‹P‘ïH1*v$óZÊ‹+§è³ÑX’œ*ßqšM?v%'{HdÉ®|½[V®e„C‡¬ô2”‚ÒZ‘VT¾Ä4ù^4U8SXª`Y¹neý³ û4f­¨|M;\cZ®UÜ]yv¢\¢5½f$CÀ gNÊH·ók&‰:‹‘ò˜ói¥.òÅŒµjDX™Øt±:“’5Å¢#ââ}~P#¹õÛ°À¬¬O„ÍÌ2ˆ­§'Y?p’¬îF>e™¾:÷ 6xEgé3x-µ÷€Ó£±HÇ ì8Wx_7„ÈJ‰™.Œ‘ý‘›(™„žÄ ¤/•.¶/aCþZzð êÌɵ“/æâé¸|¯¤Z[“ÙLcŒdñ"i¦5ä ›Ê—Ò¢ÿ¢ „ɳ iúέt͵¬•®Ù{[À¶3ÈBÊh×Ñ(ÓewîëÑá§Ùr%È—Ö‰‡MD8,ÑúžëƸw’ó é ݧãCHæOÊa”q^99Ì!g-Êi? N³¢433ƒŒË¨us€¸Œä®á#¢"ûyq.c—@»@Tº«„›l\6‘Å’{p¥Sö€”òUˆfáÏòÀ–†f9Ÿ‘?mM føqÞey)¶”퀟 cÍ6Òü”ümZõ¸u/óàMiz}¹ëç‘ÎL©T!Ì»é›<È8NgrÕË+"×¹P”ÓJIHæk*´Û¤$k¶[õÊ3YƪÉr=¹ñ5”)w½ôüZî lI®%w½t¼”‹ÏÞË‘,.Êý›Åº¡7:ÙÖ™ÍX÷f¯GS°å‚0E—ÏÛR²öc)¹M:|º½j™j;ÐŽT¬ê¦Yb‘èâpnk±Òøô€ÜƒÎÝîA“_„VƒH©Ë¿ Cxì¹ MÑ]hWysŒûæÍÙ§€èWd¿G߇&™¿’ÛȯUnDûÜ8âoÈ®Rä‘£Y’å‚ïÐKÑŽ,­InA/aO~SZ®AÏŠÞ‘ª7£o]Ý&ë¢Ê<Ãjõ÷:ÑŨGUÓcPù~·Úäšñ œtñ‡¹“\9«¦FmBòi²R.I»F‘ë $·qóL®I¯a”{Ò\FŽáä—\+_ñÕycÍúÄr»LAùùÁæÕ£££¨%=®zõבٛˆðé"g|$óæ"—ظÞ;*€Æ¶([CEH–[ÓƒnM§ô‚ó°‚8´ ¢1›¹#s‚yEs>9zyšçgÞ’XŒÔ6¹>=Ôzq(ôE%½¬D=÷˜q¨ßâø½¶fôÚýð†¸ËÁ”Ÿ’¿M«¯^æ^¡ïôº J¯Ž(?BÛèÊN¯ïôª½,ÅÓJ¯,½Z1›ÚVñœÚPïô u£Wh;½.ˆÒ+Ô;½BÝèÕÛuz…|§WÈwzuyÒëZî ¨;½.•^Qn„¼Ñ«[ç«Ô;½z3VE}§×7SÖ‘vza§×‘vzñ^GØéÆN¯Ð7z…ñF¯ÐwzØéu„^GÜéusŒûæÍÙ§€ÀN¯Ž(½¸Óëhoô:Ú^G½Óë¨;½²F4ïô:òN¯£îôêȤ×Qïô:Ú^GÛéuÀF¯¥×-J<ÜFßèÕ¦×Ñïô:ÚF¯£nô:ê^Ï”^—0*½ŽºÑë¨wzµf}b¹]¦Ðïôz÷êÑÑ÷Q”CÞhÁïMBVz%ùF¯Üé5‡t£W’zÍ!îôêÐÒlØèÕŸ*³"ŸO2zåÆ'½’¸Ò+ɽ²C ½’<éuÿ@ò-ŽŸÐ+Ó&ÓkŽãüüwEVŠ~ZÏ}?ÏÅ~ä#Oòó§L¿Ë¸=Ë/o³ÿе—çCT~9þpüׯm endstream endobj 4 0 obj 4224 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 367 162 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000004773 00000 n 0000004501 00000 n 0000000015 00000 n 0000004478 00000 n 0000004573 00000 n 0000004838 00000 n 0000004963 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 5015 %%EOF dicelab-0.7/docs/syntax-while.bnf0000644000175000017500000000011211303206024013720 00000000000000"Dicelab Full Syntax" { expr = "while" variable "=" expr "do" expr. } dicelab-0.7/docs/syntax-ordering.bnf0000644000175000017500000000011511303206024014424 00000000000000"Dicelab Full Syntax" { expr = "perm" expr | "sort" expr | "rev" expr. } dicelab-0.7/docs/copyleft.pdf0000644000175000017500000000254311303206642013135 00000000000000%PDF-1.4 %µí®û 3 0 obj << /Length 4 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 157.600006 157.600006 ] /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> stream xœmR[NÄ0 üÏ)|'~$Çà¨Ò.ìp 7k·ì‚ú“™dÆc»Ÿ¥Âþ}]áå­Âõ»ØÀ>*Ü  R“€¨5d?ÙÄVl~ô7³q>­hsBúÜÑæBB5 L¢8*¥2áá™DÉz)¿çxȸÁûši…&j8˜×eFÔQ¹ø¬DaF=åºÂ¦¹F+ÜqŠ%&…”iZ–mY/߯0Iÿ‰~ù»ñϨõå}ŸÍ4;ˆ>Qªß×áÐyÝŽl΃• Ó3w˜†¬t ±Ï¶Þ²PÀ &aµ“(Ti½˜¾öÈÏ9¡¾Ui)ùí^nY=p$ÓŠ“÷Ìš¦Ñf Ñna4Êaô‡"]ŽD } IìÑ~/îélI|vÄÞ2;ô9ë§]¬ý=¯çR^Ëœp¥$ endstream endobj 4 0 obj 319 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 5 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 157.600006 157.600006 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /CS /DeviceRGB >> /Resources 2 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 6 0 obj << /Creator (cairo 1.6.4 (http://cairographics.org)) /Producer (cairo 1.6.4 (http://cairographics.org)) >> endobj 7 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 8 0000000000 65535 f 0000000895 00000 n 0000000609 00000 n 0000000015 00000 n 0000000587 00000 n 0000000681 00000 n 0000000960 00000 n 0000001085 00000 n trailer << /Size 8 /Root 7 0 R /Info 6 0 R >> startxref 1137 %%EOF dicelab-0.7/docs/syntax-lowhigh.bnf0000644000175000017500000000012311303206024014253 00000000000000"Dicelab Full Syntax" { expr = ["drop"|"keep"] ( "low" | "high" ) expr expr. } dicelab-0.7/docs/syntax-math.bnf0000644000175000017500000000022011303206024013541 00000000000000"Dicelab Full Syntax" { expr = expr "+" expr | expr "-" expr | expr "*" expr | expr "/" expr | expr "%" expr | expr "^" expr. } dicelab-0.7/docs/syntax-while.svg0000644000175000017500000003261411303206024013766 00000000000000 dicelab-0.7/docs/syntax-range.bnf0000644000175000017500000000006511303206024013713 00000000000000"Dicelab Full Syntax" { expr = expr ".." expr. } dicelab-0.7/docs/syntax-listrep.bnf0000644000175000017500000000006411303206024014300 00000000000000"Dicelab Full Syntax" { expr = expr "#" expr. } dicelab-0.7/docs/syntax-foreach.svg0000644000175000017500000003665411303206024014275 00000000000000 dicelab-0.7/depcomp0000755000175000017500000004271310753463634011263 00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2007-03-29.01 # Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007 Free Software # Foundation, Inc. # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2, or (at your option) # any later version. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA # 02110-1301, USA. # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try \`$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by `PROGRAMS ARGS'. object Object file output by `PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputing dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz ## The second -e expression handles DOS-style file names with drive letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the `deleted header file' problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. tr ' ' ' ' < "$tmpdepfile" | ## Some versions of gcc put a space before the `:'. On the theory ## that the space means something, we add a space to the output as ## well. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like `#:fec' to the end of the # dependency line. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \ tr ' ' ' ' >> $depfile echo >> $depfile # The second pass generates a dummy entry for each header file. tr ' ' ' ' < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> $depfile else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts `$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then # Each line is of the form `foo.o: dependent.h'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else # The sourcefile does not contain any dependencies, so just # store a dummy comment line, to avoid errors with the Makefile # "include basename.Plo" scheme. echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; icc) # Intel's C compiler understands `-MD -MF file'. However on # icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c # ICC 7.0 will fill foo.d with something like # foo.o: sub/foo.c # foo.o: sub/foo.h # which is wrong. We want: # sub/foo.o: sub/foo.c # sub/foo.o: sub/foo.h # sub/foo.c: # sub/foo.h: # ICC 7.1 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using \ : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile" # Add `dependent.h:' lines. sed -ne '2,${; s/^ *//; s/ \\*$//; s/$/:/; p;}' "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in `foo.d' instead, so we check for that too. # Subdirectories are respected. dir=`echo "$object" | sed -e 's|/[^/]*$|/|'` test "x$dir" = "x$object" && dir= base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'` if test "$libtool" = yes; then # With Tru64 cc, shared objects can also be used to make a # static library. This mechanism is used in libtool 1.4 series to # handle both shared and static libraries in a single compilation. # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d. # # With libtool 1.5 this exception was removed, and libtool now # generates 2 separate objects for the 2 libraries. These two # compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4 tmpdepfile2=$dir$base.o.d # libtool 1.5 tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5 tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.o.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d tmpdepfile4=$dir$base.d "$@" -MD fi stat=$? if test $stat -eq 0; then : else rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile" # That's a tab and a space in the []. sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile" else echo "#dummy" > "$depfile" fi rm -f "$tmpdepfile" ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for `:' # in the target name. This is to cope with DOS-style filenames: # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise. "$@" $dashmflag | sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" tr ' ' ' ' < "$tmpdepfile" | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # X makedepend shift cleared=no for arg in "$@"; do case $cleared in no) set ""; shift cleared=yes ;; esac case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix="`echo $object | sed 's/^.*\././'`" touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" sed '1,2d' "$tmpdepfile" | tr ' ' ' ' | \ ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test $1 != '--mode=compile'; do shift done shift fi # Remove `-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o, # because we must use -o when running libtool. "$@" || exit $? IFS=" " for arg do case "$arg" in "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile" echo " " >> "$depfile" . "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-end: "$" # End: dicelab-0.7/dicelab.10000644000175000017500000002512011303206024011320 00000000000000.TH dicelab 1 "February 2007" "dicelab v0.2" "Dicelab - examine and roll dice" .SH NAME dicelab \- roll and examine dice rolling schemes .SH SYNOPSIS .B dicelab .I [options] .I [-f ] .SH OPTIONS .TP .BR \-h ", "\-\-help ", "\-? print a help message .TP .BR \-\-version ", "\-v display version number .TP .BR \-\-print\-tree ", "\-p print the parse tree (for debugging purposes) .TP .BR \-\-roll ", "\-r roll the dice as specified. This will also be used if no other action is requested .TP .BR \-\-eval ", "\-e reroll many times and sum up the results to get a statistical distribution of values .TP .BR \-\-count ", "\-c specify the number of rerolls for --eval, default it 10000 .TP .BR \-f read the scheme description from file instead from stdin .SH DESCRIPTION Dicelab reads a description of a dice rolling scheme from a file or from stdin if no file is specified and then rolls or examines this scheme. .SH QUICK START Single die rolls may be made using the 'd' operator, followed by the number of faces on the die to be rolled. E.g., d6 will roll a single six-sided die, and d2 will flip a coin. Expressions may be modified by the standard arithmetic operators. d10-1 will yield a value between 0 and 9, inclusive. In order to roll multiple dice of the same type, use the repetition operator '#'. 2#d6 will roll two six-sided dice; this is not the same as 2*d6, which rolls only a single die but multipies the result by two, or 2d6 which will cause a syntax error. In order to get the sum of two six-sided dice, do sum(2#d6). .SH FULL SYNTAX .NF ::= -?[0-9]+ ::= [A-Za-z]+ ::= | | ( ) | - | + | - | * | / | % | ^ | . | d | sum | prod | count ::= # | ( ) | .. | , | perm | sort | rev | (drop|keep)? low | (drop|keep)? high | (drop|keep)? first | (drop|keep)? last | (drop|keep)? == | (drop|keep)? != | (drop|keep)? < | (drop|keep)? > | (drop|keep)? <= | (drop|keep)? >= | if then else | let = in | while = do | foreach in do ::= ::= | ; .FI Comments may be inserted by using double slashed (//) as in C. .SH SEMANTICS .BR + " "- " "* " "/ " "^ .IP These are the familiar binary arithmetic operators for addition, subtraction, multiplication, division, and exponentiation. Division rounds toward zero. Examples: 5+7, d6-1, 2^10 .PP .BR - .IP This is the unary minus operator. Examples: -1 .PP .BR % .IP This is the modulus operator. x % y gives the remainder of x divided by y. Examples: 11%2, d6%3 .PP .BR . .IP This is the scalar concatenation operator. x . y gives xy, the concatenation of x and y. Examples: -10.9, d6.d6 .PP .BR d .IP This is the die roll operator. dn gives the value of a single roll of an n-sided die. Examples: d6, 2#d6 .PP .BR sum " "prod .IP These are the extended sum and product operators. If e is an expression, sum e and prod e give the sum of the members of e and the product of the members of e, respectively. Examples: sum(1..100), prod(3#d6) .PP .BR count .IP This is the list size operator. If e is an expression, then count e gives the number of members of e. Examples: count(1,2,3), count(== 6 10#d6) .PP .BR # .IP This is the list repetition operator. If n is a nonnegative scalar and e is an expression, then n#e is a list containing the results of n evaluations of e. Examples: 10#8, 3#d10 .PP .BR .. .IP This is the range operator. If x and y are scalars, then x..y is a list consisting of the interval [x,y]. If x>y, then the resulting list is empty. Examples: 1..10, 4..d10 .PP .BR , .IP This is the list concatenation operator. v,u gives the list consisting of all of the members of v, followed by all of the members of u. Examples: 1,2 4,(3#d6) .PP .BR sort .IP This is the list sorting operator. sort e sorts the list e in ascending order. Examples: sort(10#d6) .PP .BR perm .IP This is the list permutation operator. sort e results in a random permutation of the list e. Use perm to shuffle a list. Examples: perm(1..52) .PP .BR rev .IP This is the list reversal operator. rev e results in a list with the same members as the list e, but in reverse order. Examples: rev(1..10), rev sort(10#d8) .PP .BR low " "high .IP These operators act as filters by finding the least and greatest values in lists. If n is a nonnegative scalar and e is an expression, then low n e gives the n least members of e, and high n e gives the n greatest members of e. Examples: high 3 5#d6 .PP .BR first " "last .IP These operators act as filters by finding initial and final segments of lists. If n is a nonnegtive scalar and e is an expression, then first n e gives the first n members of e, and last n e gives the last n members of e. Examples: first 3 (1..10) .PP .BR == " "!= " "< " "> " "<= " ">= .IP These operators act as filters by finding values in lists which meet given conditions. If x is a scalar and e is an expression, then == x e gives the list of members of e equal to x; != x e gives the list of members of e not equal to x; < x e gives the list of members of e less than x; > x e gives the list of members of e greater than x; <= x e gives the list of members of e less than or equal to x; >= x e gives the list of members of e greater than or equal to x. Examples: >= 3 5#d6 .PP .BR drop " "keep .IP These operators modify filters on lists. If fop is a filter operation on an expression e, then keep fop e has the same result as fop e and drop fop e evaluates to e less keep fop e. In other words, drop negates filter conditions, and keep affirms them. keep is never necessary and exists only for symmetry. Examples: sum(drop low 1 4#d6) .PP .BR let .IP This is the variable assignment and substitution operator. If x is a variable and e and f are an expressions, then let x = e in f gives the list which results from evaluating f with the value of e substituted for every occurance of x in f. Evaluation of e is done prior to substitution. Examples: let x = d6 in x*x .PP .BR foreach .IP This is the bounded iteration operator. If x is a variable and e and f are expressions, then foreach x in e do f gives the list which results from assigning to x each of the members of e and evaluating f. Examples: foreach x in c do x+1 .PP .BR while .IP This is the unbounded iteration operator. If x is a variable and e and f are expressions, then while x = e do f is the list v0,v1,...,vn, where v0 is the result of evaluating e and vi+1 is the result of assigning vi to x and evaluating f, stopping at the first vi which is empty. Examples: while x=d6 do ((count <6 x)#d6) .PP .BR if .IP This is the branching operator. If e, f, and g are expressions, then if e then f else g gives f if e is nonempty, and g otherwise. Examples: if count(>4 2#d6) then 1 else 0 .SH EXAMPLES Count the number of dice greater than 7: .IP .NF count >7 5#d10 .FI .PP Count the number of dice greater than 7 minus the number of dice equal to 1: .IP .NF let c=5#d10 in (count >7 c)-(count ==1 c) .FI .PP Count the number of rolls until a 6 is rolled: .IP .NF count (while x=d6 do ((count <6 x)#d6)) .FI .PP Count the number of rolls until a 6 is rolled, more efficiently: .IP .NF count (while x=(d6/6) do ((count <1 x)#(d6/6))) .FI .PP Roll attributes for a new D&D character: .IP .NF 6#sum(drop low 1 4#d6) .FI .PP Roll on the 11..66 morale check table in The Gamers' Civil War Brigade Series: .IP .NF d6.d6 .FI .PP Find the median of 3 d20s: .IP .NF high 1 low 2 3#d20 .FI .PP 3d6 with rerolls on 6s: .IP .NF sum(while x=3#d6 do ((count ==6 x)#d6)) .FI .PP Roll 7 d10 and find the largest sum of identical dice: .IP .NF let x = 7#d10 in high 1 (foreach y in 1..10 do sum (==y x)) .FI .PP The Fibonacci sequence is defined by Fn = Fn-1 + Fn-2, with F1 = F2 = 1. Calculate the first twenty Fibonacci numbers: .IP .NF let n = 20 in let f = (1,1) in foreach i in 1..n do let f = (f,sum(high 2 f)) in if ==n i then f else () .FI .PP Risk has battles where the attacker rolls 3d6 and the defender rolls 2d6. The highest attacker die is matched with the highest defender die and the second highest attacker die to the second highest defender die. For both matches, the highest wins, with ties going to the defender. The number of attacker wins: .IP .NF let a = 3#d6 in let b = 2#d6 in count( (<(high 1 a) high 1 b), (<(high 1 low 2 a) low 1 b)) .FI .PP Storyteller die roll with target number 8 and botches indicated at -1: .IP .NF let c=5#d10 in let succs = count >7 c in let ones = count ==1 c in if >0 succs then high 1 (0,succs-ones) else if >0 ones then -1 else 0 .FI .PP Combat in Silent Death is rather complex. Three dice are rolled. If their sum is above a target, the roll is a hit. To calculate damage, the same dice are sorted. If all three are equal, all are summed to yield the damage. If the least two are equal, but the third is higher, the high die is the damage. If the two highest are equal, but the third is lower, the two high dice are summed to yield the damage. If all three dice are different, the middle die is the damage. This example assumes that the dice are two d8s and a d10, with a target number of 15: .IP .NF let x = 2#d8,d10 in (count >15 sum x)# let a = low 1 x in // low die let b = high 1 low 2 x in // middle die let c = high 1 x in // high die if ==a ==b c then a+b+c // all equal else if ==a a ==c b then b+c // two high equal else b // all different .FI .SH CREDITS Dicelab is based on the excellent work "roll" by Torben Mogensen (http://www.diku.dk/~torbenm/Dice.zip). Without his work and comments, this would hardly ever have happened. The current language specification and the extensions to the original language are derived from the work of Joel Uckelman (http://dice.nomic.net/bones.html), most of the documentation is stolen from him as well. This code was written by Robert Lemmen who would be glad to hear your questions and remarks. dicelab-0.7/Makefile.am0000644000175000017500000000104311303221377011715 00000000000000AUTOMAKE_OPTIONS = gnu bin_PROGRAMS = dicelab BUILT_SOURCES = par.h tree.h AM_YFLAGS = -d dicelab_SOURCES = main.c roll.c util.c par.y lex.l tree.tc roll.tc \ printtree.tc symtab.tc optimize.tc tree.c eval.tc ordering.tc dicelab_LDADD = -lm -ll noinst_HEADERS = roll.h util.h tree.h man_MANS=dicelab.1 EXTRA_DIST=$(man_MANS) test docs dist-hook: rm -rf `find $(distdir) -name .svn` tree.h tree.c: tree.tc roll.tc printtree.tc symtab.tc eval.tc ordering.tc \ optimize.tc $(TREECC) -o tree.c $< CLEANFILES = tree.c tree.h par.h par.c lex.c dicelab-0.7/config.h.in0000644000175000017500000000353511303206060011704 00000000000000/* config.h.in. Generated from configure.in by autoheader. */ /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the `m' library (-lm). */ #undef HAVE_LIBM /* Define to 1 if your system has a GNU libc compatible `malloc' function, and to 0 otherwise. */ #undef HAVE_MALLOC /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if your system has a GNU libc compatible `realloc' function, and to 0 otherwise. */ #undef HAVE_REALLOC /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a `char[]'. */ #undef YYTEXT_POINTER /* Define to rpl_malloc if the replacement function should be used. */ #undef malloc /* Define to rpl_realloc if the replacement function should be used. */ #undef realloc dicelab-0.7/lex.c0000644000175000017500000014367011303206450010625 00000000000000#line 2 "lex.c" #line 4 "lex.c" #define YY_INT_ALIGNED short int /* A lexical scanner generated by flex */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #define YY_FLEX_SUBMINOR_VERSION 35 #if YY_FLEX_SUBMINOR_VERSION > 0 #define FLEX_BETA #endif /* First, we deal with platform-specific or compiler-specific issues. */ /* begin standard C headers. */ #include #include #include #include /* end standard C headers. */ /* flex integer type definitions */ #ifndef FLEXINT_H #define FLEXINT_H /* C99 systems have . Non-C99 systems may or may not. */ #if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, * if you want the limit (max/min) macros for int types. */ #ifndef __STDC_LIMIT_MACROS #define __STDC_LIMIT_MACROS 1 #endif #include typedef int8_t flex_int8_t; typedef uint8_t flex_uint8_t; typedef int16_t flex_int16_t; typedef uint16_t flex_uint16_t; typedef int32_t flex_int32_t; typedef uint32_t flex_uint32_t; #else typedef signed char flex_int8_t; typedef short int flex_int16_t; typedef int flex_int32_t; typedef unsigned char flex_uint8_t; typedef unsigned short int flex_uint16_t; typedef unsigned int flex_uint32_t; /* Limits of integral types. */ #ifndef INT8_MIN #define INT8_MIN (-128) #endif #ifndef INT16_MIN #define INT16_MIN (-32767-1) #endif #ifndef INT32_MIN #define INT32_MIN (-2147483647-1) #endif #ifndef INT8_MAX #define INT8_MAX (127) #endif #ifndef INT16_MAX #define INT16_MAX (32767) #endif #ifndef INT32_MAX #define INT32_MAX (2147483647) #endif #ifndef UINT8_MAX #define UINT8_MAX (255U) #endif #ifndef UINT16_MAX #define UINT16_MAX (65535U) #endif #ifndef UINT32_MAX #define UINT32_MAX (4294967295U) #endif #endif /* ! C99 */ #endif /* ! FLEXINT_H */ #ifdef __cplusplus /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ /* C99 requires __STDC__ to be defined as 1. */ #if defined (__STDC__) #define YY_USE_CONST #endif /* defined (__STDC__) */ #endif /* ! __cplusplus */ #ifdef YY_USE_CONST #define yyconst const #else #define yyconst #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN (yy_start) = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. The YYSTATE alias is for lex * compatibility. */ #define YY_START (((yy_start) - 1) / 2) #define YYSTATE YY_START /* Action number for EOF rule of a given start state. */ #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". */ #define YY_NEW_FILE yyrestart(yyin ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #ifndef YY_BUF_SIZE #ifdef __ia64__ /* On IA-64, the buffer size is 16k, not 8k. * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. * Ditto for the __ia64__ case accordingly. */ #define YY_BUF_SIZE 32768 #else #define YY_BUF_SIZE 16384 #endif /* __ia64__ */ #endif /* The state buf must be large enough to hold one state per character in the main buffer. */ #define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) #ifndef YY_TYPEDEF_YY_BUFFER_STATE #define YY_TYPEDEF_YY_BUFFER_STATE typedef struct yy_buffer_state *YY_BUFFER_STATE; #endif extern int yyleng; extern FILE *yyin, *yyout; #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 /* Note: We specifically omit the test for yy_rule_can_match_eol because it requires * access to the local variable yy_act. Since yyless() is a macro, it would break * existing scanners that call yyless() from OUTSIDE yylex. * One obvious solution it to make yy_act a global. I tried that, and saw * a 5% performance hit in a non-yylineno scanner, because yy_act is * normally declared as a register variable-- so it is not worth it. */ #define YY_LESS_LINENO(n) \ do { \ int yyl;\ for ( yyl = n; yyl < yyleng; ++yyl )\ if ( yytext[yyl] == '\n' )\ --yylineno;\ }while(0) /* Return all but the first "n" matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ int yyless_macro_arg = (n); \ YY_LESS_LINENO(yyless_macro_arg);\ *yy_cp = (yy_hold_char); \ YY_RESTORE_YY_MORE_OFFSET \ (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up yytext again */ \ } \ while ( 0 ) #define unput(c) yyunput( c, (yytext_ptr) ) #ifndef YY_TYPEDEF_YY_SIZE_T #define YY_TYPEDEF_YY_SIZE_T typedef size_t yy_size_t; #endif #ifndef YY_STRUCT_YY_BUFFER_STATE #define YY_STRUCT_YY_BUFFER_STATE struct yy_buffer_state { FILE *yy_input_file; char *yy_ch_buf; /* input buffer */ char *yy_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ yy_size_t yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ int yy_n_chars; /* Whether we "own" the buffer - i.e., we know we created it, * and can realloc() it to grow it, and should free() it to * delete it. */ int yy_is_our_buffer; /* Whether this is an "interactive" input source; if so, and * if we're using stdio for input, then we want to use getc() * instead of fread(), to make sure we stop fetching input after * each newline. */ int yy_is_interactive; /* Whether we're considered to be at the beginning of a line. * If so, '^' rules will be active on the next match, otherwise * not. */ int yy_at_bol; int yy_bs_lineno; /**< The line count. */ int yy_bs_column; /**< The column count. */ /* Whether to try to fill the input buffer when we reach the * end of it. */ int yy_fill_buffer; int yy_buffer_status; #define YY_BUFFER_NEW 0 #define YY_BUFFER_NORMAL 1 /* When an EOF's been seen but there's still some text to process * then we mark the buffer as YY_EOF_PENDING, to indicate that we * shouldn't try reading from the input source any more. We might * still have a bunch of tokens to match, though, because of * possible backing-up. * * When we actually see the EOF, we change the status to "new" * (via yyrestart()), so that the user can continue scanning by * just pointing yyin at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; #endif /* !YY_STRUCT_YY_BUFFER_STATE */ /* Stack of input buffers. */ static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". * * Returns the top of the stack, or NULL. */ #define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ : NULL) /* Same as previous macro, but useful when we know that the buffer stack is not * NULL or when we need an lvalue. For internal use only. */ #define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ int yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 0; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; void yyrestart (FILE *input_file ); void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); void yy_delete_buffer (YY_BUFFER_STATE b ); void yy_flush_buffer (YY_BUFFER_STATE b ); void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); void yypop_buffer_state (void ); static void yyensure_buffer_stack (void ); static void yy_load_buffer_state (void ); static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); #define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len ); void *yyalloc (yy_size_t ); void *yyrealloc (void *,yy_size_t ); void yyfree (void * ); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! YY_CURRENT_BUFFER ){ \ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! YY_CURRENT_BUFFER ){\ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) #define yywrap(n) 1 #define YY_SKIP_YYWRAP typedef unsigned char YY_CHAR; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; typedef int yy_state_type; extern int yylineno; int yylineno = 1; extern char *yytext; #define yytext_ptr yytext static yy_state_type yy_get_previous_state (void ); static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); static int yy_get_next_buffer (void ); static void yy_fatal_error (yyconst char msg[] ); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ (yytext_ptr) = yy_bp; \ yyleng = (size_t) (yy_cp - yy_bp); \ (yy_hold_char) = *yy_cp; \ *yy_cp = '\0'; \ (yy_c_buf_p) = yy_cp; #define YY_NUM_RULES 36 #define YY_END_OF_BUFFER 37 /* This struct is not used in this scanner, but its presence is necessary. */ struct yy_trans_info { flex_int32_t yy_verify; flex_int32_t yy_nxt; }; static yyconst flex_int16_t yy_accept[102] = { 0, 0, 0, 37, 35, 34, 34, 34, 35, 35, 35, 3, 29, 35, 30, 32, 32, 4, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 34, 2, 34, 33, 26, 31, 1, 3, 27, 25, 28, 32, 32, 21, 32, 32, 32, 32, 32, 22, 20, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 34, 2, 2, 1, 32, 32, 32, 32, 32, 32, 32, 32, 17, 13, 32, 32, 10, 32, 5, 32, 32, 32, 11, 24, 32, 32, 14, 12, 16, 8, 6, 9, 23, 32, 7, 15, 32, 18, 32, 19, 0 } ; static yyconst flex_int32_t yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 4, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 6, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 11, 12, 13, 1, 1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 15, 14, 16, 17, 18, 19, 20, 21, 22, 14, 23, 24, 25, 26, 27, 28, 14, 29, 30, 31, 32, 33, 34, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 } ; static yyconst flex_int32_t yy_meta[35] = { 0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 } ; static yyconst flex_int16_t yy_base[105] = { 0, 0, 33, 136, 137, 34, 39, 43, 123, 126, 124, 122, 119, 118, 117, 0, 101, 22, 103, 28, 104, 33, 107, 38, 39, 106, 31, 102, 101, 67, 0, 73, 77, 137, 137, 0, 111, 137, 137, 137, 0, 88, 0, 92, 88, 88, 87, 95, 0, 0, 96, 83, 81, 77, 81, 82, 75, 78, 81, 87, 82, 81, 0, 0, 0, 77, 74, 83, 70, 81, 77, 69, 65, 0, 0, 70, 76, 0, 59, 0, 61, 49, 36, 0, 0, 35, 49, 0, 0, 0, 0, 0, 0, 0, 44, 0, 0, 45, 0, 39, 0, 137, 51, 88, 91 } ; static yyconst flex_int16_t yy_def[105] = { 0, 101, 1, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 101, 103, 101, 101, 101, 101, 104, 101, 101, 101, 101, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 101, 103, 103, 104, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 102, 0, 101, 101, 101 } ; static yyconst flex_int16_t yy_nxt[172] = { 0, 4, 5, 6, 5, 7, 8, 4, 9, 10, 11, 12, 13, 14, 15, 15, 16, 17, 18, 19, 15, 20, 21, 22, 23, 15, 15, 15, 24, 25, 26, 27, 15, 15, 28, 29, 31, 31, 31, 31, 30, 31, 31, 31, 31, 31, 32, 31, 31, 42, 45, 43, 48, 51, 40, 46, 52, 54, 57, 49, 100, 99, 98, 58, 97, 53, 96, 95, 55, 61, 31, 31, 31, 94, 62, 31, 31, 31, 31, 31, 31, 31, 31, 61, 31, 31, 31, 93, 62, 63, 92, 63, 64, 91, 64, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67, 66, 65, 36, 60, 59, 56, 50, 47, 44, 41, 39, 38, 37, 36, 35, 34, 33, 101, 3, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101 } ; static yyconst flex_int16_t yy_chk[172] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 5, 5, 5, 5, 2, 6, 6, 6, 6, 7, 7, 7, 7, 17, 19, 17, 21, 23, 102, 19, 23, 24, 26, 21, 99, 97, 94, 26, 86, 23, 85, 82, 24, 29, 29, 29, 29, 81, 29, 31, 31, 31, 31, 32, 32, 32, 32, 61, 61, 61, 61, 80, 61, 103, 78, 103, 104, 76, 104, 75, 72, 71, 70, 69, 68, 67, 66, 65, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 47, 46, 45, 44, 43, 41, 36, 28, 27, 25, 22, 20, 18, 16, 14, 13, 12, 11, 10, 9, 8, 3, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101 } ; /* Table of booleans, true if rule could match eol. */ static yyconst flex_int32_t yy_rule_can_match_eol[37] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, }; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; extern int yy_flex_debug; int yy_flex_debug = 0; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *yytext; #line 1 "lex.l" #line 2 "lex.l" #include "tree.h" #include "par.h" #line 555 "lex.c" #define INITIAL 0 #ifndef YY_NO_UNISTD_H /* Special case for "unistd.h", since it is non-ANSI. We include it way * down here because we want the user's section 1 to have been scanned first. * The user has a chance to override it with an option. */ #include #endif #ifndef YY_EXTRA_TYPE #define YY_EXTRA_TYPE void * #endif static int yy_init_globals (void ); /* Accessor methods to globals. These are made visible to non-reentrant scanners for convenience. */ int yylex_destroy (void ); int yyget_debug (void ); void yyset_debug (int debug_flag ); YY_EXTRA_TYPE yyget_extra (void ); void yyset_extra (YY_EXTRA_TYPE user_defined ); FILE *yyget_in (void ); void yyset_in (FILE * in_str ); FILE *yyget_out (void ); void yyset_out (FILE * out_str ); int yyget_leng (void ); char *yyget_text (void ); int yyget_lineno (void ); void yyset_lineno (int line_number ); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap (void ); #else extern int yywrap (void ); #endif #endif #ifndef yytext_ptr static void yy_flex_strncpy (char *,yyconst char *,int ); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (yyconst char * ); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (void ); #else static int input (void ); #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef YY_READ_BUF_SIZE #ifdef __ia64__ /* On IA-64, the buffer size is 16k, not 8k */ #define YY_READ_BUF_SIZE 16384 #else #define YY_READ_BUF_SIZE 8192 #endif /* __ia64__ */ #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0) #endif /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, * is returned in "result". */ #ifndef YY_INPUT #define YY_INPUT(buf,result,max_size) \ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ { \ int c = '*'; \ size_t n; \ for ( n = 0; n < max_size && \ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else \ { \ errno=0; \ while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ { \ if( errno != EINTR) \ { \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ break; \ } \ errno=0; \ clearerr(yyin); \ } \ }\ \ #endif /* No semi-colon after return; correct usage is to write "yyterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef yyterminate #define yyterminate() return YY_NULL #endif /* Number of entries by which start-condition stack grows. */ #ifndef YY_START_STACK_INCR #define YY_START_STACK_INCR 25 #endif /* Report a fatal error. */ #ifndef YY_FATAL_ERROR #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) #endif /* end tables serialization structures and prototypes */ /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL_IS_OURS 1 extern int yylex (void); #define YY_DECL int yylex (void) #endif /* !YY_DECL */ /* Code executed at the beginning of each rule, after yytext and yyleng * have been set up. */ #ifndef YY_USER_ACTION #define YY_USER_ACTION #endif /* Code executed at the end of each rule. */ #ifndef YY_BREAK #define YY_BREAK break; #endif #define YY_RULE_SETUP \ if ( yyleng > 0 ) \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \ (yytext[yyleng - 1] == '\n'); \ YY_USER_ACTION /** The main scanner function which does all the work. */ YY_DECL { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; #line 10 "lex.l" /* remove comments */ #line 746 "lex.c" if ( !(yy_init) ) { (yy_init) = 1; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! (yy_start) ) (yy_start) = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( ! YY_CURRENT_BUFFER ) { yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ); } yy_load_buffer_state( ); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = (yy_c_buf_p); /* Support of yytext. */ *yy_cp = (yy_hold_char); /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = (yy_start); yy_current_state += YY_AT_BOL(); yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (yy_last_accepting_cpos) = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 102 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != 137 ); yy_find_action: yy_act = yy_accept[yy_current_state]; if ( yy_act == 0 ) { /* have to back up */ yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); yy_act = yy_accept[yy_current_state]; } YY_DO_BEFORE_ACTION; if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] ) { int yyl; for ( yyl = 0; yyl < yyleng; ++yyl ) if ( yytext[yyl] == '\n' ) yylineno++; ; } do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = (yy_hold_char); yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; case 1: YY_RULE_SETUP #line 12 "lex.l" YY_BREAK case 2: YY_RULE_SETUP #line 13 "lex.l" YY_BREAK case 3: YY_RULE_SETUP #line 15 "lex.l" { yylval.ival = atoi(yytext); return NUMBER; } YY_BREAK /* reserved words */ case 4: YY_RULE_SETUP #line 20 "lex.l" return DICE; YY_BREAK case 5: YY_RULE_SETUP #line 21 "lex.l" return SUM; YY_BREAK case 6: YY_RULE_SETUP #line 22 "lex.l" return PROD; YY_BREAK case 7: YY_RULE_SETUP #line 23 "lex.l" return COUNT; YY_BREAK case 8: YY_RULE_SETUP #line 24 "lex.l" return PERM; YY_BREAK case 9: YY_RULE_SETUP #line 25 "lex.l" return SORT; YY_BREAK case 10: YY_RULE_SETUP #line 26 "lex.l" return REV; YY_BREAK case 11: YY_RULE_SETUP #line 27 "lex.l" return DROP; YY_BREAK case 12: YY_RULE_SETUP #line 28 "lex.l" return KEEP; YY_BREAK case 13: YY_RULE_SETUP #line 29 "lex.l" return LOW; YY_BREAK case 14: YY_RULE_SETUP #line 30 "lex.l" return HIGH; YY_BREAK case 15: YY_RULE_SETUP #line 31 "lex.l" return FIRST; YY_BREAK case 16: YY_RULE_SETUP #line 32 "lex.l" return LAST; YY_BREAK case 17: YY_RULE_SETUP #line 33 "lex.l" return LET; YY_BREAK case 18: YY_RULE_SETUP #line 34 "lex.l" return WHILE; YY_BREAK case 19: YY_RULE_SETUP #line 35 "lex.l" return FOREACH; YY_BREAK case 20: YY_RULE_SETUP #line 36 "lex.l" return IN; YY_BREAK case 21: YY_RULE_SETUP #line 37 "lex.l" return DO; YY_BREAK case 22: YY_RULE_SETUP #line 38 "lex.l" return IF; YY_BREAK case 23: YY_RULE_SETUP #line 39 "lex.l" return THEN; YY_BREAK case 24: YY_RULE_SETUP #line 40 "lex.l" return ELSE; YY_BREAK case 25: YY_RULE_SETUP #line 41 "lex.l" return EQ; YY_BREAK case 26: YY_RULE_SETUP #line 42 "lex.l" return NE; YY_BREAK case 27: YY_RULE_SETUP #line 43 "lex.l" return LE; YY_BREAK case 28: YY_RULE_SETUP #line 44 "lex.l" return GE; YY_BREAK case 29: YY_RULE_SETUP #line 45 "lex.l" return LT; YY_BREAK case 30: YY_RULE_SETUP #line 46 "lex.l" return GT; YY_BREAK case 31: YY_RULE_SETUP #line 47 "lex.l" return RANGE; YY_BREAK case 32: YY_RULE_SETUP #line 49 "lex.l" { yylval.tval = (char*)malloc((strlen(yytext)+1) * sizeof(char)); strcpy(yylval.tval, yytext); return VARIABLE; } YY_BREAK /* eat all whitespaces */ case 33: /* rule 33 can match eol */ YY_RULE_SETUP #line 55 "lex.l" YY_BREAK case 34: /* rule 34 can match eol */ YY_RULE_SETUP #line 56 "lex.l" YY_BREAK /* return other single-characters directly */ case 35: YY_RULE_SETUP #line 58 "lex.l" return(yytext[0]); YY_BREAK case 36: YY_RULE_SETUP #line 59 "lex.l" ECHO; YY_BREAK #line 1032 "lex.c" case YY_STATE_EOF(INITIAL): yyterminate(); case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = (yy_hold_char); YY_RESTORE_YY_MORE_OFFSET if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) { /* We're scanning a new file or input source. It's * possible that this happened because the user * just pointed yyin at a new source and called * yylex(). If so, then we have to assure * consistency between YY_CURRENT_BUFFER and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input source. */ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; } /* Note that here we test for yy_c_buf_p "<=" to the position * of the first EOB in the buffer, since yy_c_buf_p will * already have been incremented past the NUL character * (since all states make transitions on EOB to the * end-of-buffer state). Contrast this with the test * in input(). */ if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) { /* This was really a NUL. */ yy_state_type yy_next_state; (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( ); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * yy_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ yy_next_state = yy_try_NUL_trans( yy_current_state ); yy_bp = (yytext_ptr) + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++(yy_c_buf_p); yy_current_state = yy_next_state; goto yy_match; } else { yy_cp = (yy_c_buf_p); goto yy_find_action; } } else switch ( yy_get_next_buffer( ) ) { case EOB_ACT_END_OF_FILE: { (yy_did_buffer_switch_on_eof) = 0; if ( yywrap( ) ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * yytext, we can now set up * yy_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * YY_NULL, it'll still work - another * YY_NULL will get returned. */ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( ); yy_cp = (yy_c_buf_p); yy_bp = (yytext_ptr) + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: (yy_c_buf_p) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; yy_current_state = yy_get_previous_state( ); yy_cp = (yy_c_buf_p); yy_bp = (yytext_ptr) + YY_MORE_ADJ; goto yy_find_action; } break; } default: YY_FATAL_ERROR( "fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of yylex */ /* yy_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int yy_get_next_buffer (void) { register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; register char *source = (yytext_ptr); register int number_to_move, i; int ret_val; if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) { /* We matched a single character, the EOB, so * treat this as a final EOF. */ return EOB_ACT_END_OF_FILE; } else { /* We matched some text prior to the EOB, first * process it. */ return EOB_ACT_LAST_MATCH; } } /* Try to read more data. */ /* First move last chars to start of buffer. */ number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; else { int num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; while ( num_to_read <= 0 ) { /* Not enough room in the buffer - grow it. */ /* just a shorter name for the current buffer */ YY_BUFFER_STATE b = YY_CURRENT_BUFFER; int yy_c_buf_p_offset = (int) ((yy_c_buf_p) - b->yy_ch_buf); if ( b->yy_is_our_buffer ) { int new_size = b->yy_buf_size * 2; if ( new_size <= 0 ) b->yy_buf_size += b->yy_buf_size / 8; else b->yy_buf_size *= 2; b->yy_ch_buf = (char *) /* Include room in for 2 EOB chars. */ yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); } else /* Can't grow it, we don't own it. */ b->yy_ch_buf = 0; if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; } if ( num_to_read > YY_READ_BUF_SIZE ) num_to_read = YY_READ_BUF_SIZE; /* Read in more data. */ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), (yy_n_chars), (size_t) num_to_read ); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } if ( (yy_n_chars) == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart(yyin ); } else { ret_val = EOB_ACT_LAST_MATCH; YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { /* Extend the array by 50%, plus the number we really need. */ yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); } (yy_n_chars) += number_to_move; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; return ret_val; } /* yy_get_previous_state - get the state just before the EOB char was reached */ static yy_state_type yy_get_previous_state (void) { register yy_state_type yy_current_state; register char *yy_cp; yy_current_state = (yy_start); yy_current_state += YY_AT_BOL(); for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) { register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (yy_last_accepting_cpos) = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 102 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; } return yy_current_state; } /* yy_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = yy_try_NUL_trans( current_state ); */ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) { register int yy_is_jam; register char *yy_cp = (yy_c_buf_p); register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (yy_last_accepting_cpos) = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 102 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; yy_is_jam = (yy_current_state == 101); return yy_is_jam ? 0 : yy_current_state; } #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (void) #else static int input (void) #endif { int c; *(yy_c_buf_p) = (yy_hold_char); if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) { /* yy_c_buf_p now points to the character we want to return. * If this occurs *before* the EOB characters, then it's a * valid NUL; if not, then we've hit the end of the buffer. */ if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) /* This was really a NUL. */ *(yy_c_buf_p) = '\0'; else { /* need more input */ int offset = (yy_c_buf_p) - (yytext_ptr); ++(yy_c_buf_p); switch ( yy_get_next_buffer( ) ) { case EOB_ACT_LAST_MATCH: /* This happens because yy_g_n_b() * sees that we've accumulated a * token and flags that we need to * try matching the token before * proceeding. But for input(), * there's no matching to consider. * So convert the EOB_ACT_LAST_MATCH * to EOB_ACT_END_OF_FILE. */ /* Reset buffer status. */ yyrestart(yyin ); /*FALLTHROUGH*/ case EOB_ACT_END_OF_FILE: { if ( yywrap( ) ) return EOF; if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + offset; break; } } } c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ *(yy_c_buf_p) = '\0'; /* preserve yytext */ (yy_hold_char) = *++(yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n'); if ( YY_CURRENT_BUFFER_LVALUE->yy_at_bol ) yylineno++; ; return c; } #endif /* ifndef YY_NO_INPUT */ /** Immediately switch to a different input stream. * @param input_file A readable stream. * * @note This function does not reset the start condition to @c INITIAL . */ void yyrestart (FILE * input_file ) { if ( ! YY_CURRENT_BUFFER ){ yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ); } yy_init_buffer(YY_CURRENT_BUFFER,input_file ); yy_load_buffer_state( ); } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * */ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) { /* TODO. We should be able to replace this entire function body * with * yypop_buffer_state(); * yypush_buffer_state(new_buffer); */ yyensure_buffer_stack (); if ( YY_CURRENT_BUFFER == new_buffer ) return; if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(yy_c_buf_p) = (yy_hold_char); YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } YY_CURRENT_BUFFER_LVALUE = new_buffer; yy_load_buffer_state( ); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ (yy_did_buffer_switch_on_eof) = 1; } static void yy_load_buffer_state (void) { (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; (yy_hold_char) = *(yy_c_buf_p); } /** Allocate and initialize an input buffer state. * @param file A readable stream. * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. * * @return the allocated buffer state. */ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_buf_size = size; /* yy_ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_is_our_buffer = 1; yy_init_buffer(b,file ); return b; } /** Destroy the buffer. * @param b a buffer created with yy_create_buffer() * */ void yy_delete_buffer (YY_BUFFER_STATE b ) { if ( ! b ) return; if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; if ( b->yy_is_our_buffer ) yyfree((void *) b->yy_ch_buf ); yyfree((void *) b ); } #ifndef __cplusplus extern int isatty (int ); #endif /* __cplusplus */ /* Initializes or reinitializes a buffer. * This function is sometimes called more than once on the same buffer, * such as during a yyrestart() or at EOF. */ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) { int oerrno = errno; yy_flush_buffer(b ); b->yy_input_file = file; b->yy_fill_buffer = 1; /* If b is the current buffer, then yy_init_buffer was _probably_ * called from yyrestart() or through yy_get_next_buffer. * In that case, we don't want to reset the lineno or column. */ if (b != YY_CURRENT_BUFFER){ b->yy_bs_lineno = 1; b->yy_bs_column = 0; } b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; errno = oerrno; } /** Discard all buffered characters. On the next scan, YY_INPUT will be called. * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. * */ void yy_flush_buffer (YY_BUFFER_STATE b ) { if ( ! b ) return; b->yy_n_chars = 0; /* We always need two end-of-buffer characters. The first causes * a transition to the end-of-buffer state. The second causes * a jam in that state. */ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; b->yy_buf_pos = &b->yy_ch_buf[0]; b->yy_at_bol = 1; b->yy_buffer_status = YY_BUFFER_NEW; if ( b == YY_CURRENT_BUFFER ) yy_load_buffer_state( ); } /** Pushes the new state onto the stack. The new state becomes * the current state. This function will allocate the stack * if necessary. * @param new_buffer The new state. * */ void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) { if (new_buffer == NULL) return; yyensure_buffer_stack(); /* This block is copied from yy_switch_to_buffer. */ if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(yy_c_buf_p) = (yy_hold_char); YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } /* Only push if top exists. Otherwise, replace top. */ if (YY_CURRENT_BUFFER) (yy_buffer_stack_top)++; YY_CURRENT_BUFFER_LVALUE = new_buffer; /* copied from yy_switch_to_buffer. */ yy_load_buffer_state( ); (yy_did_buffer_switch_on_eof) = 1; } /** Removes and deletes the top of the stack, if present. * The next element becomes the new top. * */ void yypop_buffer_state (void) { if (!YY_CURRENT_BUFFER) return; yy_delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; if ((yy_buffer_stack_top) > 0) --(yy_buffer_stack_top); if (YY_CURRENT_BUFFER) { yy_load_buffer_state( ); (yy_did_buffer_switch_on_eof) = 1; } } /* Allocates the stack if it does not exist. * Guarantees space for at least one push. */ static void yyensure_buffer_stack (void) { int num_to_alloc; if (!(yy_buffer_stack)) { /* First allocation is just for 2 elements, since we don't know if this * scanner will even need a stack. We use 2 instead of 1 to avoid an * immediate realloc on the next call. */ num_to_alloc = 1; (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc (num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); (yy_buffer_stack_max) = num_to_alloc; (yy_buffer_stack_top) = 0; return; } if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ /* Increase the buffer to prepare for a possible push. */ int grow_size = 8 /* arbitrary grow size */; num_to_alloc = (yy_buffer_stack_max) + grow_size; (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc ((yy_buffer_stack), num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); /* zero only the new slots.*/ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); (yy_buffer_stack_max) = num_to_alloc; } } /** Setup the input buffer state to scan directly from a user-specified character buffer. * @param base the character buffer * @param size the size in bytes of the character buffer * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) { YY_BUFFER_STATE b; if ( size < 2 || base[size-2] != YY_END_OF_BUFFER_CHAR || base[size-1] != YY_END_OF_BUFFER_CHAR ) /* They forgot to leave room for the EOB's. */ return 0; b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->yy_buf_pos = b->yy_ch_buf = base; b->yy_is_our_buffer = 0; b->yy_input_file = 0; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yy_at_bol = 1; b->yy_fill_buffer = 0; b->yy_buffer_status = YY_BUFFER_NEW; yy_switch_to_buffer(b ); return b; } /** Setup the input buffer state to scan a string. The next call to yylex() will * scan from a @e copy of @a str. * @param yystr a NUL-terminated string to scan * * @return the newly allocated buffer state object. * @note If you want to scan bytes that may contain NUL values, then use * yy_scan_bytes() instead. */ YY_BUFFER_STATE yy_scan_string (yyconst char * yystr ) { return yy_scan_bytes(yystr,strlen(yystr) ); } /** Setup the input buffer state to scan the given bytes. The next call to yylex() will * scan from a @e copy of @a bytes. * @param yybytes the byte buffer to scan * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, int _yybytes_len ) { YY_BUFFER_STATE b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = _yybytes_len + 2; buf = (char *) yyalloc(n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); for ( i = 0; i < _yybytes_len; ++i ) buf[i] = yybytes[i]; buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; b = yy_scan_buffer(buf,n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->yy_is_our_buffer = 1; return b; } #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif static void yy_fatal_error (yyconst char* msg ) { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Redefine yyless() so it works in section 3 code. */ #undef yyless #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ int yyless_macro_arg = (n); \ YY_LESS_LINENO(yyless_macro_arg);\ yytext[yyleng] = (yy_hold_char); \ (yy_c_buf_p) = yytext + yyless_macro_arg; \ (yy_hold_char) = *(yy_c_buf_p); \ *(yy_c_buf_p) = '\0'; \ yyleng = yyless_macro_arg; \ } \ while ( 0 ) /* Accessor methods (get/set functions) to struct members. */ /** Get the current line number. * */ int yyget_lineno (void) { return yylineno; } /** Get the input stream. * */ FILE *yyget_in (void) { return yyin; } /** Get the output stream. * */ FILE *yyget_out (void) { return yyout; } /** Get the length of the current token. * */ int yyget_leng (void) { return yyleng; } /** Get the current token. * */ char *yyget_text (void) { return yytext; } /** Set the current line number. * @param line_number * */ void yyset_lineno (int line_number ) { yylineno = line_number; } /** Set the input stream. This does not discard the current * input buffer. * @param in_str A readable stream. * * @see yy_switch_to_buffer */ void yyset_in (FILE * in_str ) { yyin = in_str ; } void yyset_out (FILE * out_str ) { yyout = out_str ; } int yyget_debug (void) { return yy_flex_debug; } void yyset_debug (int bdebug ) { yy_flex_debug = bdebug ; } static int yy_init_globals (void) { /* Initialization is the same as for the non-reentrant scanner. * This function is called from yylex_destroy(), so don't allocate here. */ /* We do not touch yylineno unless the option is enabled. */ yylineno = 1; (yy_buffer_stack) = 0; (yy_buffer_stack_top) = 0; (yy_buffer_stack_max) = 0; (yy_c_buf_p) = (char *) 0; (yy_init) = 0; (yy_start) = 0; /* Defined in main.c */ #ifdef YY_STDINIT yyin = stdin; yyout = stdout; #else yyin = (FILE *) 0; yyout = (FILE *) 0; #endif /* For future reference: Set errno on error, since we are called by * yylex_init() */ return 0; } /* yylex_destroy is for both reentrant and non-reentrant scanners. */ int yylex_destroy (void) { /* Pop the buffer stack, destroying each element. */ while(YY_CURRENT_BUFFER){ yy_delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; yypop_buffer_state(); } /* Destroy the stack itself. */ yyfree((yy_buffer_stack) ); (yy_buffer_stack) = NULL; /* Reset the globals. This is important in a non-reentrant scanner so the next time * yylex() is called, initialization will occur. */ yy_init_globals( ); return 0; } /* * Internal utility routines. */ #ifndef yytext_ptr static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) { register int i; for ( i = 0; i < n; ++i ) s1[i] = s2[i]; } #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (yyconst char * s ) { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *yyalloc (yy_size_t size ) { return (void *) malloc( size ); } void *yyrealloc (void * ptr, yy_size_t size ) { /* The cast to (char *) in the following accommodates both * implementations that use char* generic pointers, and those * that use void* generic pointers. It works with the latter * because both ANSI C and C++ allow castless assignment from * any pointer type to void*, and deal with argument conversions * as though doing an assignment. */ return (void *) realloc( (char *) ptr, size ); } void yyfree (void * ptr ) { free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ } #define YYTABLES_NAME "yytables" #line 59 "lex.l" dicelab-0.7/symtab.tc0000644000175000017500000000137011303206024011503 00000000000000%decls %{ %} %{ struct symtab { char *name; union { struct roll_value *rvalue; // used by summing up struct val_list *lvalue; // used by calculations ordering_type ordering; // used to defer the ordering for a variable }; struct symtab *next; }; %} %operation %virtual void set_symtab(expression *this, struct symtab *st) set_symtab(elist) { } set_symtab(number) { } set_symtab(variable) { this->symtab = st; } set_symtab(unary) { this->symtab = st; set_symtab(this->expr, st); } set_symtab(binary) { this->symtab = st; set_symtab(this->expr1, st); set_symtab(this->expr2, st); } set_symtab(ifthenelse) { this->symtab = st; set_symtab(this->if_expr, st); set_symtab(this->then_expr, st); set_symtab(this->else_expr, st); } dicelab-0.7/roll.h0000644000175000017500000000034711303206024011000 00000000000000#ifndef ROLL_H #define ROLL_H struct roll_value { int count; int *values; }; struct roll_value *new_roll_single(int num); struct roll_value *new_roll_multi(int count); void free_roll(struct roll_value *v); #endif /* ROLL_H */ dicelab-0.7/printtree.tc0000644000175000017500000000771711303206024012233 00000000000000%operation %virtual void printtree(expression *this, int depth) %{ void indent(int depth) { int i; for (i = 0; i < depth; i++) { printf(" "); } } %} printtree(elist) { indent(depth); printf("empty list\n"); } printtree(number) { indent(depth); printf("%i\n", this->num); } printtree(variable) { indent(depth); printf("%s\n", this->varname); } printtree(negate) { indent(depth); printf("-\n"); printtree(this->expr, depth+1); } printtree(mathop) { indent(depth); switch (yykind(this)) { case plus_kind: printf("+\n"); break; case minus_kind: printf("-\n"); break; case multi_kind: printf("*\n"); break; case divi_kind: printf("/\n"); break; case mod_kind: printf("%%\n"); break; case expo_kind: printf("^\n"); break; default: yyerror("Unknown math op"); } printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(scat) { indent(depth); printf(".\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(rep) { indent(depth); printf("#\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(range) { indent(depth); printf("..\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(lcat) { indent(depth); printf(",\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(dice) { indent(depth); printf("d\n"); printtree(this->expr, depth+1); } printtree(sum) { indent(depth); printf("sum\n"); printtree(this->expr, depth+1); } printtree(prod) { indent(depth); printf("prod\n"); printtree(this->expr, depth+1); } printtree(count) { indent(depth); printf("count\n"); printtree(this->expr, depth+1); } printtree(perm) { indent(depth); printf("perm\n"); printtree(this->expr, depth+1); } printtree(sort) { indent(depth); printf("sort\n"); printtree(this->expr, depth+1); } printtree(rev) { indent(depth); printf("rev\n"); printtree(this->expr, depth+1); } printtree(first) { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("first\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(last) { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("last\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(high) { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("high\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(low) { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("low\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(comparison) { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("comparison "); switch (this->comp) { case eq: printf("eq\n"); break; case ne: printf("ne\n"); break; case gt: printf("gt\n"); break; case lt: printf("lt\n"); break; case ge: printf("ge\n"); break; case le: printf("le\n"); break; default: yyerror("Unexpected comparison (really bad)"); } printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(ifthenelse) { indent(depth); printf("if\n"); printtree(this->if_expr, depth+1); indent(depth); printf("then\n"); printtree(this->then_expr, depth+1); indent(depth); printf("else\n"); printtree(this->else_expr, depth+1); } printtree(let) { indent(depth); printf("let %s = \n", this->varname); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(foreach) { indent(depth); printf("foreach %s \n", this->varname); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } printtree(whiledo) { indent(depth); printf("while %s \n", this->varname); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } dicelab-0.7/tree.c0000644000175000017500000027615211303206447011004 00000000000000/* tree.c. Generated automatically by treecc */ #line 8 "tree.tc" #include #include #include #include "tree.h" #include "util.h" int yyerror(char *s); #line 3 "printtree.tc" void indent(int depth) { int i; for (i = 0; i < depth; i++) { printf(" "); } } #line 5 "symtab.tc" struct symtab { char *name; union { struct roll_value *rvalue; // used by summing up struct val_list *lvalue; // used by calculations ordering_type ordering; // used to defer the ordering for a variable }; struct symtab *next; }; #line 23 "eval.tc" struct val_list *list_new(size_t count, double prob) { struct val_list *ret = (struct val_list*)malloc(sizeof(struct val_list)); ret->next = NULL; ret->prob = prob; ret->count = count; ret->values = count ? (int*)malloc(count * sizeof(int)): NULL; memset(ret->values, 0, count * sizeof(int)); return ret; } // add cret to ret void list_add(struct val_list **ret, struct val_list *cret, ordering_type ordering) { // and add to the list struct val_list *search = *ret; struct val_list *lsearch = NULL; if (ordering == agnostic) { quicksort(cret->values, 0, cret->count-1); } while (search) { if ((search->count == cret->count) && (memcmp(search->values, cret->values, cret->count * sizeof(int)) == 0)) { break; } lsearch = search; search = search->next; } if (search) { // already present, add search->prob += cret->prob; free(cret->values); free(cret); } else if (lsearch) { lsearch->next = cret; } else { *ret = cret; } } struct val_list *error_val() { struct val_list *ret = list_new(1, 1.0); ret->values[0] = 0; return ret; } void list_free(struct val_list *list) { while (list != NULL) { struct val_list *cur = list; list = list->next; free(cur->values); free(cur); } } #line 770 "eval.tc" void rec_whiledo(struct val_list *v, char *varname, struct symtab *symtab, expression *expr, int *data, int count, struct val_list **ret, ordering_type ordering) { struct val_list *cv = v; while (cv) { // create a current list int ccount = count + cv->count; int *cdata = (int*)malloc(ccount * sizeof(int)); memcpy(cdata, data, count * sizeof(int)); memcpy(&cdata[count], cv->values, cv->count * sizeof(int)); // do this recursion if ((cv->count != 0) && (cv->prob >= cmd_threshold)) { // set the variable struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = cv->count; nst->rvalue->values = (int*)malloc(sizeof(int) * cv->count); memcpy(nst->rvalue->values, cv->values, sizeof(int) * cv->count); nst->next = symtab; set_symtab(expr, nst); // call the function struct val_list *x = eval(expr); // adjust the probability struct val_list *cx = x; while (cx) { cx->prob *= cv->prob; cx = cx->next; } // recursive call rec_whiledo(x, varname, symtab, expr, cdata, ccount, ret, ordering); // free the data, symtab and list free(cdata); free_roll(nst->rvalue); free(nst); list_free(x); } else { // add to final list struct val_list *cur = list_new(ccount, cv->prob); free(cur->values); cur->values = cdata; list_add(ret, cur, ordering); } // next element cv = cv->next; } } #line 937 "eval.tc" void cb_perm(int *data, int count, void *arg, float farg) { struct val_list **pret = (struct val_list**)arg; struct val_list *current = list_new(count, farg); memcpy(current->values, data, current->count * sizeof(int)); // XXX pass this from the tree instead of using caring all the time // or even better, don't do the permutations if we don't care about the // ordering list_add(pret, current, caring); } #line 3 "optimize.tc" #include #ifndef MINFLOAT #define MINFLOAT 0.0000001 #endif // this is taken from http://en.wikipedia.org/wiki/Dice // calculates the probability for value "pos" in the sum of "num" // dice with "sides" faces double Fsumdice(double *cache, int mnum, int num, int sides, int pos) { if (pos > ((num*sides-num)/2)+num) { pos = num*sides - pos + num; } if (num == 1) { if ((pos < 1) || (pos > sides)) { return 0.0; } return 1.0/sides; } else { if (pos < num) { return 0.0; } int i; if (cache[mnum*(pos-num)+num] < -0.5) { double ret = 0; for (i = 1; i < min(pos, sides+1); i++) { ret += Fsumdice(cache, mnum, 1, sides, i) * Fsumdice(cache, mnum, num-1, sides, pos-i); } cache[mnum*(pos-num)+num] = ret; return ret; } return cache[mnum*(pos-num)+num]; } } // calculates the probability that the sum of "num" rolls of // distribution "dist" have the value "pos" double Fsumany(double *cache, int mnum, int minval, int maxval, int num, struct val_list *dist, int pos) { struct val_list *cdist = dist; if (num == 1) { while (cdist) { if (cdist->values[0] == pos) { return cdist->prob; } cdist = cdist->next; } return 0.0; } else { int cpos = pos*mnum+num; if ((pos < minval * num) || (pos > maxval * pos)) { return 0.0; } if (cache[cpos] < -0.5) { double ret = 0.0; while (cdist) { ret += cdist->prob * Fsumany(cache, mnum, minval, maxval, num - 1, dist, pos - cdist->values[0]); cdist = cdist->next; } cache[cpos] = ret; return ret; } return cache[cpos]; } } #line 225 "tree.c" #define YYNODESTATE_TRACK_LINES 1 #line 1 "c_skel.c" /* * treecc node allocation routines for C. * * Copyright (C) 2001 Southern Storm Software, Pty Ltd. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * As a special exception, when this file is copied by treecc into * a treecc output file, you may use that output file without restriction. */ #include #ifndef YYNODESTATE_BLKSIZ #define YYNODESTATE_BLKSIZ 2048 #endif /* * Types used by the allocation routines. */ struct YYNODESTATE_block { char data__[YYNODESTATE_BLKSIZ]; struct YYNODESTATE_block *next__; }; struct YYNODESTATE_push { struct YYNODESTATE_push *next__; struct YYNODESTATE_block *saved_block__; int saved_used__; }; /* * The fixed global state to use for non-reentrant allocation. */ #ifndef YYNODESTATE_REENTRANT static YYNODESTATE fixed_state__; #endif /* * Some macro magic to determine the default alignment * on this machine. This will compile down to a constant. */ #define YYNODESTATE_ALIGN_CHECK_TYPE(type,name) \ struct _YYNODESTATE_align_##name { \ char pad; \ type field; \ } #define YYNODESTATE_ALIGN_FOR_TYPE(type) \ ((unsigned)(&(((struct _YYNODESTATE_align_##type *)0)->field))) #define YYNODESTATE_ALIGN_MAX(a,b) \ ((a) > (b) ? (a) : (b)) #define YYNODESTATE_ALIGN_MAX3(a,b,c) \ (YYNODESTATE_ALIGN_MAX((a), YYNODESTATE_ALIGN_MAX((b), (c)))) YYNODESTATE_ALIGN_CHECK_TYPE(int, int); YYNODESTATE_ALIGN_CHECK_TYPE(long, long); #if defined(WIN32) && !defined(__CYGWIN__) YYNODESTATE_ALIGN_CHECK_TYPE(__int64, long_long); #else YYNODESTATE_ALIGN_CHECK_TYPE(long long, long_long); #endif YYNODESTATE_ALIGN_CHECK_TYPE(void *, void_p); YYNODESTATE_ALIGN_CHECK_TYPE(float, float); YYNODESTATE_ALIGN_CHECK_TYPE(double, double); #define YYNODESTATE_ALIGNMENT \ YYNODESTATE_ALIGN_MAX( \ YYNODESTATE_ALIGN_MAX3 \ (YYNODESTATE_ALIGN_FOR_TYPE(int), \ YYNODESTATE_ALIGN_FOR_TYPE(long), \ YYNODESTATE_ALIGN_FOR_TYPE(long_long)), \ YYNODESTATE_ALIGN_MAX3 \ (YYNODESTATE_ALIGN_FOR_TYPE(void_p), \ YYNODESTATE_ALIGN_FOR_TYPE(float), \ YYNODESTATE_ALIGN_FOR_TYPE(double))) /* * Initialize the node allocation pool. */ #ifdef YYNODESTATE_REENTRANT void yynodeinit(state__) YYNODESTATE *state__; { #else void yynodeinit() { YYNODESTATE *state__ = &fixed_state__; #endif state__->blocks__ = 0; state__->push_stack__ = 0; state__->used__ = 0; } /* * Allocate a block of memory. */ #ifdef YYNODESTATE_REENTRANT void *yynodealloc(state__, size__) YYNODESTATE *state__; unsigned int size__; { #else void *yynodealloc(size__) unsigned int size__; { YYNODESTATE *state__ = &fixed_state__; #endif struct YYNODESTATE_block *block__; void *result__; /* Round the size to the next alignment boundary */ size__ = (size__ + YYNODESTATE_ALIGNMENT - 1) & ~(YYNODESTATE_ALIGNMENT - 1); /* Do we need to allocate a new block? */ block__ = state__->blocks__; if(!block__ || (state__->used__ + size__) > YYNODESTATE_BLKSIZ) { if(size__ > YYNODESTATE_BLKSIZ) { /* The allocation is too big for the node pool */ return (void *)0; } block__ = (struct YYNODESTATE_block *) malloc(sizeof(struct YYNODESTATE_block)); if(!block__) { /* The system is out of memory. The programmer can supply the "yynodefailed" function to report the out of memory state and/or abort the program */ #ifdef YYNODESTATE_REENTRANT yynodefailed(state__); #else yynodefailed(); #endif return (void *)0; } block__->next__ = state__->blocks__; state__->blocks__ = block__; state__->used__ = 0; } /* Allocate the memory and return it */ result__ = (void *)(block__->data__ + state__->used__); state__->used__ += size__; return result__; } /* * Push the node allocation state. */ #ifdef YYNODESTATE_REENTRANT int yynodepush(state__) YYNODESTATE *state__; { #else int yynodepush() { YYNODESTATE *state__ = &fixed_state__; #endif struct YYNODESTATE_block *saved_block__; int saved_used__; struct YYNODESTATE_push *push_item__; /* Save the current state of the node allocation pool */ saved_block__ = state__->blocks__; saved_used__ = state__->used__; /* Allocate space for a push item */ #ifdef YYNODESTATE_REENTRANT push_item__ = (struct YYNODESTATE_push *) yynodealloc(state__, sizeof(struct YYNODESTATE_push)); #else push_item__ = (struct YYNODESTATE_push *) yynodealloc(sizeof(struct YYNODESTATE_push)); #endif if(!push_item__) { return 0; } /* Copy the saved information to the push item */ push_item__->saved_block__ = saved_block__; push_item__->saved_used__ = saved_used__; /* Add the push item to the push stack */ push_item__->next__ = state__->push_stack__; state__->push_stack__ = push_item__; return 1; } /* * Pop the node allocation state. */ #ifdef YYNODESTATE_REENTRANT void yynodepop(state__) YYNODESTATE *state__; { #else void yynodepop() { YYNODESTATE *state__ = &fixed_state__; #endif struct YYNODESTATE_push *push_item__; struct YYNODESTATE_block *saved_block__; struct YYNODESTATE_block *temp_block__; /* Pop the top of the push stack */ push_item__ = state__->push_stack__; if(push_item__ == 0) { saved_block__ = 0; state__->used__ = 0; } else { saved_block__ = push_item__->saved_block__; state__->used__ = push_item__->saved_used__; state__->push_stack__ = push_item__->next__; } /* Free unnecessary blocks */ while(state__->blocks__ != saved_block__) { temp_block__ = state__->blocks__; state__->blocks__ = temp_block__->next__; free(temp_block__); } } /* * Clear the node allocation pool completely. */ #ifdef YYNODESTATE_REENTRANT void yynodeclear(state__) YYNODESTATE *state__; { #else void yynodeclear() { YYNODESTATE *state__ = &fixed_state__; #endif struct YYNODESTATE_block *temp_block__; while(state__->blocks__ != 0) { temp_block__ = state__->blocks__; state__->blocks__ = temp_block__->next__; free(temp_block__); } state__->push_stack__ = 0; state__->used__ = 0; } #line 493 "tree.c" void expression_set_ordering__(expression *this, ordering_type ordering) #line 7 "ordering.tc" { this->ordering = ordering; } #line 499 "tree.c" expression * expression_optimize__(expression *this) #line 225 "optimize.tc" { return this; } #line 506 "tree.c" struct expression_vtable__ const expression_vt__ = { 0, expression_kind, "expression", (void (*)(expression *this__, int depth))0, (struct roll_value * (*)(expression *this__))0, (void (*)(expression *this__, struct symtab * st))0, (void (*)(expression *this__, ordering_type ordering))expression_set_ordering__, (struct val_list * (*)(expression *this__))0, (expression * (*)(expression *this__))expression_optimize__, }; void elist_printtree__(elist *this, int depth) #line 13 "printtree.tc" { indent(depth); printf("empty list\n"); } #line 526 "tree.c" struct roll_value * elist_roll__(elist *this) #line 4 "roll.tc" { struct roll_value *rv = new_roll_single(0); rv->count = 0; return rv; } #line 535 "tree.c" void elist_set_symtab__(elist *this, struct symtab * st) #line 20 "symtab.tc" { } #line 541 "tree.c" struct val_list * elist_eval__(elist *this) #line 83 "eval.tc" { return list_new(0, 1.0); } #line 548 "tree.c" struct elist_vtable__ const elist_vt__ = { &expression_vt__, elist_kind, "elist", (void (*)(expression *this__, int depth))elist_printtree__, (struct roll_value * (*)(expression *this__))elist_roll__, (void (*)(expression *this__, struct symtab * st))elist_set_symtab__, (void (*)(expression *this__, ordering_type ordering))expression_set_ordering__, (struct val_list * (*)(expression *this__))elist_eval__, (expression * (*)(expression *this__))expression_optimize__, }; void binary_set_symtab__(binary *this, struct symtab * st) #line 39 "symtab.tc" { this->symtab = st; set_symtab(this->expr1, st); set_symtab(this->expr2, st); } #line 569 "tree.c" void binary_set_ordering__(binary *this, ordering_type ordering) #line 18 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr1, ordering); set_ordering(this->expr2, ordering); } #line 578 "tree.c" expression * binary_optimize__(binary *this) #line 230 "optimize.tc" { this->expr1 = optimize(this->expr1); this->expr2 = optimize(this->expr2); return (expression*)this; } #line 587 "tree.c" struct binary_vtable__ const binary_vt__ = { &expression_vt__, binary_kind, "binary", (void (*)(expression *this__, int depth))0, (struct roll_value * (*)(expression *this__))0, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))0, (expression * (*)(expression *this__))binary_optimize__, }; void unary_set_symtab__(unary *this, struct symtab * st) #line 33 "symtab.tc" { this->symtab = st; set_symtab(this->expr, st); } #line 607 "tree.c" void unary_set_ordering__(unary *this, ordering_type ordering) #line 12 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr, ordering); } #line 615 "tree.c" expression * unary_optimize__(unary *this) #line 237 "optimize.tc" { this->expr = optimize(this->expr); return (expression*)this; } #line 623 "tree.c" struct unary_vtable__ const unary_vt__ = { &expression_vt__, unary_kind, "unary", (void (*)(expression *this__, int depth))0, (struct roll_value * (*)(expression *this__))0, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))unary_set_ordering__, (struct val_list * (*)(expression *this__))0, (expression * (*)(expression *this__))unary_optimize__, }; void number_printtree__(number *this, int depth) #line 19 "printtree.tc" { indent(depth); printf("%i\n", this->num); } #line 643 "tree.c" struct roll_value * number_roll__(number *this) #line 11 "roll.tc" { struct roll_value *rv = new_roll_single(this->num); return rv; } #line 651 "tree.c" void number_set_symtab__(number *this, struct symtab * st) #line 24 "symtab.tc" { } #line 657 "tree.c" struct val_list * number_eval__(number *this) #line 1005 "eval.tc" { struct val_list *ret = list_new(1, 1.0); ret->values[0] = this->num; return ret; } #line 666 "tree.c" struct number_vtable__ const number_vt__ = { &expression_vt__, number_kind, "number", (void (*)(expression *this__, int depth))number_printtree__, (struct roll_value * (*)(expression *this__))number_roll__, (void (*)(expression *this__, struct symtab * st))number_set_symtab__, (void (*)(expression *this__, ordering_type ordering))expression_set_ordering__, (struct val_list * (*)(expression *this__))number_eval__, (expression * (*)(expression *this__))expression_optimize__, }; void ifthenelse_printtree__(ifthenelse *this, int depth) #line 241 "printtree.tc" { indent(depth); printf("if\n"); printtree(this->if_expr, depth+1); indent(depth); printf("then\n"); printtree(this->then_expr, depth+1); indent(depth); printf("else\n"); printtree(this->else_expr, depth+1); } #line 693 "tree.c" struct roll_value * ifthenelse_roll__(ifthenelse *this) #line 486 "roll.tc" { struct roll_value *if_expr = roll(this->if_expr); if (if_expr->count > 0) { free_roll(if_expr); return roll(this->then_expr); } else { free_roll(if_expr); return roll(this->else_expr); } } #line 708 "tree.c" void ifthenelse_set_symtab__(ifthenelse *this, struct symtab * st) #line 46 "symtab.tc" { this->symtab = st; set_symtab(this->if_expr, st); set_symtab(this->then_expr, st); set_symtab(this->else_expr, st); } #line 718 "tree.c" void ifthenelse_set_ordering__(ifthenelse *this, ordering_type ordering) #line 69 "ordering.tc" { this->ordering = ordering; set_ordering(this->if_expr, agnostic); set_ordering(this->then_expr, ordering); set_ordering(this->else_expr, ordering); } #line 728 "tree.c" struct val_list * ifthenelse_eval__(ifthenelse *this) #line 1012 "eval.tc" { struct val_list *cnt = eval(this->if_expr); struct val_list *ccnt = cnt; struct val_list *ret = NULL; while (ccnt) { struct val_list *cur; if (ccnt->count > 0) { cur = eval(this->then_expr); } else { cur = eval(this->else_expr); } struct val_list *temp; while (cur) { temp = cur; cur = cur->next; temp->next = NULL; temp->prob *= ccnt->prob; list_add(&ret, temp, this->ordering); } ccnt = ccnt->next; } list_free(cnt); return ret; } #line 758 "tree.c" expression * ifthenelse_optimize__(ifthenelse *this) #line 243 "optimize.tc" { this->if_expr = optimize(this->if_expr); this->then_expr = optimize(this->then_expr); this->else_expr = optimize(this->else_expr); return (expression*)this; } #line 768 "tree.c" struct ifthenelse_vtable__ const ifthenelse_vt__ = { &expression_vt__, ifthenelse_kind, "ifthenelse", (void (*)(expression *this__, int depth))ifthenelse_printtree__, (struct roll_value * (*)(expression *this__))ifthenelse_roll__, (void (*)(expression *this__, struct symtab * st))ifthenelse_set_symtab__, (void (*)(expression *this__, ordering_type ordering))ifthenelse_set_ordering__, (struct val_list * (*)(expression *this__))ifthenelse_eval__, (expression * (*)(expression *this__))ifthenelse_optimize__, }; void variable_printtree__(variable *this, int depth) #line 25 "printtree.tc" { indent(depth); printf("%s\n", this->varname); } #line 788 "tree.c" struct roll_value * variable_roll__(variable *this) #line 514 "roll.tc" { struct symtab *nst = this->symtab; struct roll_value *ret = NULL; while (nst != NULL) { if (strcmp(this->varname, nst->name) == 0) { /* copy the roll value */ ret = (struct roll_value*)malloc(sizeof(struct roll_value)); ret->values = (int*)malloc(sizeof(int) * nst->rvalue->count); memcpy(ret->values, nst->rvalue->values, sizeof(int) * nst->rvalue->count); ret->count = nst->rvalue->count; break; } nst = nst->next; } if (ret == NULL) { char *emsg = (char*)malloc(sizeof(char)*22+strlen(this->varname)); sprintf(emsg, "Variable \"%s\" not found", this->varname); yyerror(emsg); free(emsg); ret = (struct roll_value*)malloc(sizeof(struct roll_value)); ret->values = (int*)malloc(sizeof(int) * 1); ret->values[0] = 0; ret->count = 1; } return ret; } #line 819 "tree.c" void variable_set_symtab__(variable *this, struct symtab * st) #line 28 "symtab.tc" { this->symtab = st; } #line 826 "tree.c" void variable_set_ordering__(variable *this, ordering_type ordering) #line 77 "ordering.tc" { this->ordering = ordering; // get the symtab struct symtab *nst = this->symtab; while (nst != NULL) { if (strcmp(this->varname, nst->name) == 0) { break; } nst = nst->next; } if (nst && nst->ordering == agnostic) { nst->ordering = ordering; } } #line 845 "tree.c" struct val_list * variable_eval__(variable *this) #line 1040 "eval.tc" { struct symtab *nst = this->symtab; struct val_list *ret = NULL; while (nst != NULL) { if (strcmp(this->varname, nst->name) == 0) { ret = list_new(nst->rvalue->count, 1.0); memcpy(ret->values, nst->rvalue->values, sizeof(int) * nst->rvalue->count); break; } nst = nst->next; } if (ret == NULL) { char *emsg = (char*)malloc(sizeof(char)*22+strlen(this->varname)); sprintf(emsg, "Variable \"%s\" not found", this->varname); yyerror(emsg); free(emsg); ret = error_val(); } return ret; } #line 869 "tree.c" struct variable_vtable__ const variable_vt__ = { &expression_vt__, variable_kind, "variable", (void (*)(expression *this__, int depth))variable_printtree__, (struct roll_value * (*)(expression *this__))variable_roll__, (void (*)(expression *this__, struct symtab * st))variable_set_symtab__, (void (*)(expression *this__, ordering_type ordering))variable_set_ordering__, (struct val_list * (*)(expression *this__))variable_eval__, (expression * (*)(expression *this__))expression_optimize__, }; void sumrepdice_printtree__(sumrepdice *this, int depth) #line 89 "optimize.tc" { // unsupported, only used in eval } #line 888 "tree.c" struct roll_value * sumrepdice_roll__(sumrepdice *this) #line 85 "optimize.tc" { // unsupported, only used in eval } #line 895 "tree.c" void sumrepdice_set_symtab__(sumrepdice *this, struct symtab * st) #line 93 "optimize.tc" { // not needed, don't use symtab } #line 902 "tree.c" struct val_list * sumrepdice_eval__(sumrepdice *this) #line 97 "optimize.tc" { int n; struct val_list *ret = NULL; struct val_list *cnum = this->num_dice; while (cnum) { if (cnum->count != 1) { yyerror("Argument 1 to sumrep operator is not scalar"); list_free(this->num_dice); list_free(ret); return error_val(); } int num_dice_val = cnum->values[0]; if (num_dice_val > 0) { int expected = num_dice_val* ((num_dice_val*this->num_sides-num_dice_val)/2) +num_dice_val+1; double *cache = malloc(sizeof(double) * expected); for (n = 0; n < expected; n++) { cache[n] = -1.0; } for (n = num_dice_val * this->num_sides; n >= num_dice_val; n--) { struct val_list *cret = (struct val_list*)malloc(sizeof(struct val_list)); cret->next = NULL; cret->count = 1; cret->prob = Fsumdice(cache, num_dice_val, num_dice_val, this->num_sides, n) * cnum->prob; cret->values = (int*)malloc(sizeof(int)); cret->values[0] = n; list_add(&ret, cret, this->ordering); } free(cache); } cnum = cnum->next; } if (ret == NULL) { return list_new(1, 1.0); } return ret; } #line 947 "tree.c" struct sumrepdice_vtable__ const sumrepdice_vt__ = { &expression_vt__, sumrepdice_kind, "sumrepdice", (void (*)(expression *this__, int depth))sumrepdice_printtree__, (struct roll_value * (*)(expression *this__))sumrepdice_roll__, (void (*)(expression *this__, struct symtab * st))sumrepdice_set_symtab__, (void (*)(expression *this__, ordering_type ordering))expression_set_ordering__, (struct val_list * (*)(expression *this__))sumrepdice_eval__, (expression * (*)(expression *this__))expression_optimize__, }; void sumrepany_printtree__(sumrepany *this, int depth) #line 149 "optimize.tc" { // unsupported, only used in eval } #line 966 "tree.c" struct roll_value * sumrepany_roll__(sumrepany *this) #line 145 "optimize.tc" { // unsupported, only used in eval } #line 973 "tree.c" void sumrepany_set_symtab__(sumrepany *this, struct symtab * st) #line 153 "optimize.tc" { // not needed, don't use symtab } #line 980 "tree.c" struct val_list * sumrepany_eval__(sumrepany *this) #line 157 "optimize.tc" { int n; struct val_list *ret = NULL; struct val_list *cnum = this->number; int minval = -1; int maxval = 0; struct val_list *cval = this->data; while (cval) { if ((minval == -1) || (cval->values[0] < minval)) { minval = cval->values[0]; } if (cval->values[0] > maxval) { maxval = cval->values[0]; } cval = cval->next; } while (cnum) { if (cnum->count != 1) { yyerror("Argument 1 to sumrep operator is not scalar"); list_free(this->number); list_free(this->data); list_free(ret); return error_val(); } if (cnum->values[0] == 0) { struct val_list *cret = (struct val_list*)malloc(sizeof(struct val_list)); cret->next = NULL; cret->count = 1; cret->prob = cnum->prob; cret->values = (int*)malloc(sizeof(int)); cret->values[0] = 0; list_add(&ret, cret, this->ordering); } else { int expected = (cnum->values[0] * maxval + 1) * cnum->values[0] + 1; double *cache = malloc(sizeof(double) * expected); for (n = 0; n < expected; n++) { cache[n] = -1.0; } for (n = cnum->values[0] * minval; n <= cnum->values[0] * maxval; n++) { struct val_list *cret = (struct val_list*)malloc(sizeof(struct val_list)); cret->next = NULL; cret->count = 1; cret->prob = Fsumany(cache, cnum->values[0], minval, maxval, cnum->values[0], this->data, n) * cnum->prob; cret->values = (int*)malloc(sizeof(int)); cret->values[0] = n; if (cret->prob > MINFLOAT) { list_add(&ret, cret, this->ordering); } else { list_free(cret); } } free(cache); } cnum = cnum->next; } if (ret == NULL) { return list_new(1, 1.0); } return ret; } #line 1049 "tree.c" struct sumrepany_vtable__ const sumrepany_vt__ = { &expression_vt__, sumrepany_kind, "sumrepany", (void (*)(expression *this__, int depth))sumrepany_printtree__, (struct roll_value * (*)(expression *this__))sumrepany_roll__, (void (*)(expression *this__, struct symtab * st))sumrepany_set_symtab__, (void (*)(expression *this__, ordering_type ordering))expression_set_ordering__, (struct val_list * (*)(expression *this__))sumrepany_eval__, (expression * (*)(expression *this__))expression_optimize__, }; void mathop_printtree__(mathop *this, int depth) #line 38 "printtree.tc" { indent(depth); switch (yykind(this)) { case plus_kind: printf("+\n"); break; case minus_kind: printf("-\n"); break; case multi_kind: printf("*\n"); break; case divi_kind: printf("/\n"); break; case mod_kind: printf("%%\n"); break; case expo_kind: printf("^\n"); break; default: yyerror("Unknown math op"); } printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1093 "tree.c" struct roll_value * mathop_roll__(mathop *this) #line 17 "roll.tc" { struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); if (rv1->count != 1) { yyerror("Argument 1 to math op isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } if (rv2->count != 1) { yyerror("Argument 2 to math op isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } switch (yykind(this)) { case plus_kind: rv1->values[0] += rv2->values[0]; break; case minus_kind: rv1->values[0] -= rv2->values[0]; break; case multi_kind: rv1->values[0] *= rv2->values[0]; break; case divi_kind: rv1->values[0] /= rv2->values[0]; break; case mod_kind: rv1->values[0] %= rv2->values[0]; break; case expo_kind: rv1->values[0] = (int) pow(rv1->values[0], rv2->values[0]); break; default: yyerror("Unknown math op"); } free_roll(rv2); return rv1; } #line 1141 "tree.c" struct val_list * mathop_eval__(mathop *this) #line 88 "eval.tc" { struct val_list *e1 = eval(this->expr1); struct val_list *e2 = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ce1 = e1; struct val_list *ce2; while (ce1) { ce2 = e2; while (ce2) { if (ce1->count != 1) { yyerror("Argument 1 to math operator is not scalar"); list_free(e1); list_free(e2); return error_val(); } if (ce2->count != 1) { yyerror("Argument 2 to math operator is not scalar"); list_free(e1); list_free(e2); return error_val(); } struct val_list *cret = list_new(1, ce1->prob * ce2->prob); switch (yykind(this)) { case plus_kind: cret->values[0] = ce1->values[0] + ce2->values[0]; break; case minus_kind: cret->values[0] = ce1->values[0] - ce2->values[0]; break; case multi_kind: cret->values[0] = ce1->values[0] * ce2->values[0]; break; case divi_kind: cret->values[0] = ce1->values[0] / ce2->values[0]; break; case mod_kind: cret->values[0] = ce1->values[0] % ce2->values[0]; break; case expo_kind: cret->values[0] = (int) pow(ce1->values[0], ce2->values[0]); break; default: yyerror("Unknown math op"); list_free(e1); list_free(e2); return error_val(); } list_add(&ret, cret, this->ordering); ce2 = ce2->next; } ce1 = ce1->next; } list_free(e1); list_free(e2); return ret; } #line 1202 "tree.c" struct mathop_vtable__ const mathop_vt__ = { &binary_vt__, mathop_kind, "mathop", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void scat_printtree__(scat *this, int depth) #line 68 "printtree.tc" { indent(depth); printf(".\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1224 "tree.c" struct roll_value * scat_roll__(scat *this) #line 64 "roll.tc" { struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); if (rv1->count != 1) { yyerror("Argument 1 to scat (.) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } if (rv2->count != 1) { yyerror("Argument 2 to scat (.) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } int i = 10; while (i < rv2->values[0]) { i *= 10; } rv1->values[0] *= i; rv1->values[0] += rv2->values[0]; free_roll(rv2); return rv1; } #line 1254 "tree.c" struct val_list * scat_eval__(scat *this) #line 148 "eval.tc" { struct val_list *e1 = eval(this->expr1); struct val_list *e2 = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ce1 = e1; struct val_list *ce2; while (ce1) { ce2 = e2; while (ce2) { if (ce1->count != 1) { yyerror("Argument 1 to scalar concatenation is not scalar"); list_free(e1); list_free(e2); return error_val(); } if (ce2->count != 1) { yyerror("Argument 2 to scalar concatenation is not scalar"); list_free(e1); list_free(e2); return error_val(); } struct val_list *cret = list_new(1, ce1->prob * ce2->prob); int i = 10; while (i < ce2->values[0]) { i *= 10; } cret->values[0] = ce1->values[0]; cret->values[0] *= i; cret->values[0] += ce2->values[0]; list_add(&ret, cret, this->ordering); ce2 = ce2->next; } ce1 = ce1->next; } list_free(e1); list_free(e2); return ret; } #line 1297 "tree.c" struct scat_vtable__ const scat_vt__ = { &binary_vt__, scat_kind, "scat", (void (*)(expression *this__, int depth))scat_printtree__, (struct roll_value * (*)(expression *this__))scat_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))scat_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void rep_printtree__(rep *this, int depth) #line 76 "printtree.tc" { indent(depth); printf("#\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1319 "tree.c" struct roll_value * rep_roll__(rep *this) #line 132 "roll.tc" { struct roll_value *rep = roll(this->expr1); if (rep->count != 1) { yyerror("Argument 1 to rep (#) isn't scalar"); rep->count = 1; rep->values[0] = 0; return rep; } struct roll_value *rv = new_roll_single(rep->values[0]); rv->count = 0; int i; for (i = 0; i < rep->values[0]; i++) { struct roll_value *roll = roll(this->expr2); rv->values = (int*)realloc(rv->values, sizeof(int) * (rv->count + roll->count)); memcpy(&rv->values[rv->count], roll->values, roll->count * sizeof(int)); rv->count += roll->count; free_roll(roll); } free_roll(rep); return rv; } #line 1347 "tree.c" struct val_list * rep_eval__(rep *this) #line 190 "eval.tc" { struct val_list *cnt = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ccnt = cnt; int i; while (ccnt) { if (ccnt->count != 1) { yyerror("Argument to repetition operator is not scalar"); list_free(cnt); list_free(exp); return error_val(); } // init everything int icnt = ccnt->values[0]; if (icnt > 0) { int expcnt = 0; struct val_list *cexp = exp; while (cexp) { expcnt++; cexp = cexp->next; } int pos[icnt]; memset(pos, 0, icnt * sizeof(int)); struct val_list *index[expcnt]; i = 0; cexp = exp; while (cexp) { index[i] = cexp; i++; cexp = cexp->next; } // the main iteration do { // do this set int len = 0; double prob = ccnt->prob; for (i = 0; i < icnt; i++) { len += index[pos[i]]->count; prob *= index[pos[i]]->prob; } struct val_list *cret = list_new(len, prob); int cp = 0; for (i = 0; i < icnt; i++) { memcpy(&cret->values[cp], index[pos[i]]->values, index[pos[i]]->count * sizeof(int)); cp += index[pos[i]]->count; } list_add(&ret, cret, this->ordering); // next iteration pos[0]++; i = 0; while ((pos[i] == expcnt) && (i < icnt-1)){ pos[i] = 0; i++; pos[i]++; } } while (pos[icnt-1] < expcnt); } else { list_add(&ret, list_new(0, ccnt->prob), this->ordering); } // next iteration ccnt=ccnt->next; } // if we have nothing, return an empty list if (ret == NULL) { struct val_list *cret = list_new(0, 1.0); list_add(&ret, cret, this->ordering); } list_free(cnt); list_free(exp); return ret; } #line 1426 "tree.c" struct rep_vtable__ const rep_vt__ = { &binary_vt__, rep_kind, "rep", (void (*)(expression *this__, int depth))rep_printtree__, (struct roll_value * (*)(expression *this__))rep_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))rep_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void range_printtree__(range *this, int depth) #line 84 "printtree.tc" { indent(depth); printf("..\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1448 "tree.c" struct roll_value * range_roll__(range *this) #line 92 "roll.tc" { int i; int c = 0; struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); if (rv1->count != 1) { yyerror("Argument 1 to range (..) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } if (rv2->count != 1) { yyerror("Argument 2 to range (..) isn't scalar"); free_roll(rv2); rv1->count = 1; rv1->values[0] = 0; return rv1; } struct roll_value *rv; if (rv1->values[0] <= rv2->values[0]) { rv = new_roll_multi( abs(rv1->values[0] - rv2->values[0]) + 1); for (i = rv1->values[0]; i != rv2->values[0]; rv1->values[0] < rv2->values[0] ? i++ : i--) { rv->values[c] = i; c++; } rv->values[c] = rv2->values[0]; } else { rv = new_roll_single(0); rv->count = 0; } free_roll(rv1); free_roll(rv2); return rv; } #line 1490 "tree.c" struct val_list * range_eval__(range *this) #line 267 "eval.tc" { struct val_list *from = eval(this->expr1); struct val_list *to = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cfrom = from; struct val_list *cto; while (cfrom) { cto = to; while (cto) { // check both are scalar if (cfrom->count != 1) { yyerror("Argument \"from\" to range operator is not scalar"); list_free(from); list_free(to); return error_val(); } if (cto->count != 1) { yyerror("Argument \"to\" to range operator is not scalar"); list_free(from); list_free(to); return error_val(); } int ifrom = cfrom->values[0]; int ito = cto->values[0]; int count = ito - ifrom + 1; if (count < 0) { count = 0; } struct val_list *cret = list_new(count, cfrom->prob * cto->prob); int i, c; for (i = ifrom, c = 0; i <= ito; ++i, ++c) { cret->values[c] = i; } list_add(&ret, cret, this->ordering); cto = cto->next; } cfrom = cfrom->next; } list_free(from); list_free(to); return ret; } #line 1538 "tree.c" struct range_vtable__ const range_vt__ = { &binary_vt__, range_kind, "range", (void (*)(expression *this__, int depth))range_printtree__, (struct roll_value * (*)(expression *this__))range_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))range_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void lcat_printtree__(lcat *this, int depth) #line 92 "printtree.tc" { indent(depth); printf(",\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1560 "tree.c" struct roll_value * lcat_roll__(lcat *this) #line 158 "roll.tc" { struct roll_value *rv1 = roll(this->expr1); struct roll_value *rv2 = roll(this->expr2); rv1->values = (int*)realloc(rv1->values, sizeof(int) * (rv1->count + rv2->count)); memcpy(&rv1->values[rv1->count], rv2->values, rv2->count * sizeof(int)); rv1->count += rv2->count; free_roll(rv2); return rv1; } #line 1575 "tree.c" struct val_list * lcat_eval__(lcat *this) #line 313 "eval.tc" { struct val_list *e1 = eval(this->expr1); struct val_list *e2 = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ce1 = e1; struct val_list *ce2; while (ce1) { ce2 = e2; while (ce2) { struct val_list *cret = list_new (ce1->count + ce2->count, ce1->prob * ce2->prob); memcpy(cret->values, ce1->values, ce1->count * sizeof(int)); memcpy(&cret->values[ce1->count], ce2->values, ce2->count * sizeof(int)); list_add(&ret, cret, this->ordering); ce2 = ce2->next; } ce1 = ce1->next; } list_free(e1); list_free(e2); return ret; } #line 1603 "tree.c" struct lcat_vtable__ const lcat_vt__ = { &binary_vt__, lcat_kind, "lcat", (void (*)(expression *this__, int depth))lcat_printtree__, (struct roll_value * (*)(expression *this__))lcat_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))lcat_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct filter_vtable__ const filter_vt__ = { &binary_vt__, filter_kind, "filter", (void (*)(expression *this__, int depth))0, (struct roll_value * (*)(expression *this__))0, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))0, (expression * (*)(expression *this__))binary_optimize__, }; void let_printtree__(let *this, int depth) #line 253 "printtree.tc" { indent(depth); printf("let %s = \n", this->varname); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1637 "tree.c" struct roll_value * let_roll__(let *this) #line 499 "roll.tc" { // variable setzen und in symtab struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = roll(this->expr1); nst->next = this->symtab; set_symtab(this->expr2, nst); struct roll_value *ret = roll(this->expr2); // variable wieder vom stack free_roll(nst->rvalue); free(nst); return ret; } #line 1654 "tree.c" void let_set_ordering__(let *this, ordering_type ordering) #line 94 "ordering.tc" { this->ordering = ordering; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->ordering = agnostic; nst->next = this->symtab; set_symtab(this->expr2, nst); set_ordering(this->expr2, ordering); set_ordering(this->expr1, nst->ordering); free(nst); } #line 1669 "tree.c" struct val_list * let_eval__(let *this) #line 672 "eval.tc" { struct val_list *cnt = eval(this->expr1); struct val_list *ret = NULL; struct val_list *ccnt = cnt; while (ccnt) { struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = ccnt->count; nst->rvalue->values = (int*)malloc(sizeof(int) * ccnt->count); memcpy(nst->rvalue->values, ccnt->values, sizeof(int) * ccnt->count); nst->next = this->symtab; set_symtab(this->expr2, nst); struct val_list *cur = eval(this->expr2); struct val_list *ccur = cur; while (ccur) { struct val_list *temp = ccur; ccur = ccur->next; temp->next = NULL; temp->prob *= ccnt->prob; list_add(&ret, temp, this->ordering); } free_roll(nst->rvalue); free(nst); ccnt = ccnt->next; } list_free(cnt); return ret; } #line 1705 "tree.c" struct let_vtable__ const let_vt__ = { &binary_vt__, let_kind, "let", (void (*)(expression *this__, int depth))let_printtree__, (struct roll_value * (*)(expression *this__))let_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))let_set_ordering__, (struct val_list * (*)(expression *this__))let_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void foreach_printtree__(foreach *this, int depth) #line 261 "printtree.tc" { indent(depth); printf("foreach %s \n", this->varname); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1727 "tree.c" struct roll_value * foreach_roll__(foreach *this) #line 543 "roll.tc" { struct roll_value *list = roll(this->expr1); struct roll_value *ret = (struct roll_value*) malloc(sizeof(struct roll_value)); ret->count = 0; ret->values = NULL; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = 1; nst->rvalue->values = (int*)malloc(sizeof(int)); nst->next = this->symtab; set_symtab(this->expr2, nst); int i; for (i = 0; i < list->count; i++) { nst->rvalue->values[0] = list->values[i]; struct roll_value *cur = roll(this->expr2); /* concat to the current solution */ ret->values = (int*)realloc(ret->values, (ret->count + cur->count) * sizeof(int)); memcpy(&ret->values[ret->count], cur->values, cur->count * sizeof(int)); ret->count += cur->count; free_roll(cur); } free_roll(list); free_roll(nst->rvalue); free(nst); return ret; } #line 1761 "tree.c" struct val_list * foreach_eval__(foreach *this) #line 706 "eval.tc" { struct val_list *cnt = eval(this->expr1); struct val_list *ccnt = cnt; int i; struct val_list *tret = NULL; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = 1; nst->rvalue->values = (int*)malloc(sizeof(int)); nst->next = this->symtab; set_symtab(this->expr2, nst); // each possibility while (ccnt) { struct val_list *ret = list_new(0, 1.0); for (i = 0; i < ccnt->count; i++) { nst->rvalue->values[0] = ccnt->values[i]; struct val_list *cur = eval(this->expr2); // append each possibility in cur to each in ret, multiply // the probability with the one from ccnt. struct val_list *cret = ret; struct val_list *nret = NULL; while (cret) { struct val_list *ccur = cur; while (ccur) { struct val_list *item = list_new( ccur->count + cret->count, ccur->prob * cret->prob); memcpy(item->values, cret->values, sizeof(int) * cret->count); memcpy(&item->values[cret->count], ccur->values, sizeof(int) * ccur->count); list_add(&nret, item, this->ordering); ccur = ccur->next; } cret = cret->next; } list_free(cur); list_free(ret); ret = nret; nret = NULL; } struct val_list *cret = ret; while (cret) { cret->prob *= ccnt->prob; struct val_list *temp = cret; cret = cret->next; temp->next = NULL; list_add(&tret, temp, this->ordering); } ccnt = ccnt->next; } free_roll(nst->rvalue); free(nst); list_free(cnt); return tret; } #line 1828 "tree.c" struct foreach_vtable__ const foreach_vt__ = { &binary_vt__, foreach_kind, "foreach", (void (*)(expression *this__, int depth))foreach_printtree__, (struct roll_value * (*)(expression *this__))foreach_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))foreach_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void whiledo_printtree__(whiledo *this, int depth) #line 269 "printtree.tc" { indent(depth); printf("while %s \n", this->varname); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 1850 "tree.c" struct roll_value * whiledo_roll__(whiledo *this) #line 575 "roll.tc" { struct roll_value *cur; struct roll_value *ret = (struct roll_value*)malloc( sizeof(struct roll_value)); ret->count = 0; ret->values = NULL; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->next = this->symtab; set_symtab(this->expr2, nst); cur = roll(this->expr1); nst->rvalue = cur; /* concat cur to ret */ ret->values = (int*)realloc(ret->values, sizeof(int) * (cur->count + ret->count)); memcpy(&ret->values[ret->count], cur->values, sizeof(int) * cur->count); ret->count += cur->count; while (cur->count > 0) { cur = roll(this->expr2); free_roll(nst->rvalue); nst->rvalue = cur; /* concat cur to ret */ ret->values = (int*)realloc(ret->values, sizeof(int) * (cur->count + ret->count)); memcpy(&ret->values[ret->count], cur->values, sizeof(int) * cur->count); ret->count += cur->count; } free_roll(cur); free(nst); return ret; } #line 1888 "tree.c" struct val_list * whiledo_eval__(whiledo *this) #line 822 "eval.tc" { struct val_list *expe = eval(this->expr1); struct val_list *ret = NULL; rec_whiledo(expe, this->varname, this->symtab, this->expr2, NULL, 0, &ret, this->ordering); list_free(expe); return ret; } #line 1900 "tree.c" struct whiledo_vtable__ const whiledo_vt__ = { &binary_vt__, whiledo_kind, "whiledo", (void (*)(expression *this__, int depth))whiledo_printtree__, (struct roll_value * (*)(expression *this__))whiledo_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))whiledo_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct plus_vtable__ const plus_vt__ = { &mathop_vt__, plus_kind, "plus", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct minus_vtable__ const minus_vt__ = { &mathop_vt__, minus_kind, "minus", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct multi_vtable__ const multi_vt__ = { &mathop_vt__, multi_kind, "multi", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct divi_vtable__ const divi_vt__ = { &mathop_vt__, divi_kind, "divi", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct mod_vtable__ const mod_vt__ = { &mathop_vt__, mod_kind, "mod", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; struct expo_vtable__ const expo_vt__ = { &mathop_vt__, expo_kind, "expo", (void (*)(expression *this__, int depth))mathop_printtree__, (struct roll_value * (*)(expression *this__))mathop_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))mathop_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void first_printtree__(first *this, int depth) #line 149 "printtree.tc" { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("first\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 2000 "tree.c" struct roll_value * first_roll__(first *this) #line 266 "roll.tc" { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to first isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } if (this->type == drop) { int i = exp->count - num->values[0]; if (i <= 0) { i = 0; exp->count = 0; } else { memcpy(&exp->values[0], &exp->values[exp->count - i], i * sizeof(int)); exp->count = i; } } else { exp->count = min(exp->count, num->values[0]); } free_roll(num); return exp; } #line 2032 "tree.c" void first_set_ordering__(first *this, ordering_type ordering) #line 55 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr1, agnostic); set_ordering(this->expr2, caring); } #line 2041 "tree.c" struct val_list * first_eval__(first *this) #line 339 "eval.tc" { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"first\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; if (this->type == drop) { cret->count = cexp->count - cnum->values[0]; if (cret->count <= 0) { cret->count = 0; } cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, &cexp->values[cexp->count - cret->count], cret->count * sizeof(int)); } else { cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, cexp->values, cret->count * sizeof(int)); } cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } #line 2089 "tree.c" struct first_vtable__ const first_vt__ = { &filter_vt__, first_kind, "first", (void (*)(expression *this__, int depth))first_printtree__, (struct roll_value * (*)(expression *this__))first_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))first_set_ordering__, (struct val_list * (*)(expression *this__))first_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void last_printtree__(last *this, int depth) #line 163 "printtree.tc" { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("last\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 2117 "tree.c" struct roll_value * last_roll__(last *this) #line 295 "roll.tc" { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to last isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } if (this->type == drop) { exp->count -= num->values[0]; if (exp->count < 0) { exp->count = 0; } } else { if (num->values[0] < exp->count) { memcpy(&exp->values[0], &exp->values[exp->count - num->values[0]], num->values[0] * sizeof(int)); exp->count = num->values[0]; } } free_roll(num); return exp; } #line 2147 "tree.c" void last_set_ordering__(last *this, ordering_type ordering) #line 62 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr1, agnostic); set_ordering(this->expr2, caring); } #line 2156 "tree.c" struct val_list * last_eval__(last *this) #line 385 "eval.tc" { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"last\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; if (this->type == drop) { cret->count = max(cexp->count - cnum->values[0], 0); cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, cexp->values, cret->count * sizeof(int)); } else { cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, &cexp->values[cexp->count - cret->count], cret->count * sizeof(int)); // XXX this block is complete bollocks /* if (cnum->values[0] < cexp->count) { cret->count = cnum->values[0]; cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, &cexp->values[cexp->count - cnum->values[0]], cret->count * sizeof(int)); }*/ } cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } #line 2208 "tree.c" struct last_vtable__ const last_vt__ = { &filter_vt__, last_kind, "last", (void (*)(expression *this__, int depth))last_printtree__, (struct roll_value * (*)(expression *this__))last_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))last_set_ordering__, (struct val_list * (*)(expression *this__))last_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void high_printtree__(high *this, int depth) #line 177 "printtree.tc" { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("high\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 2236 "tree.c" struct roll_value * high_roll__(high *this) #line 381 "roll.tc" { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to last isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } int *slist = (int*)malloc(sizeof(int) * exp->count); int *mask = (int*)malloc(sizeof(int) * exp->count); memcpy(slist, exp->values, sizeof(int) * exp->count); memset(mask, 0, sizeof(int) * exp->count); quicksort(slist, 0, exp->count -1); int p = 0, i, c = 0; if (this->type == keep) { for (i = 0; (i < exp->count) && (c < num->values[0]); i++) { int j, found = 0; for (j = exp->count - 1; j >= exp->count - num->values[0]; j--) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } else { for (i = 0; (i < exp->count) && (c < (exp->count - num->values[0])); i++) { int j, found = 0; for (j = 0; j < exp->count - num->values[0]; j++) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } exp->count = c; free_roll(num); free(slist); free(mask); return exp; } #line 2296 "tree.c" struct val_list * high_eval__(high *this) #line 435 "eval.tc" { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"high\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; // ready, start the actual filtering: // we want up to cnum->values[0] items from cexp in cret int *slist = (int*)malloc(sizeof(int) * cexp->count); int *mask = (int*)malloc(sizeof(int) * cexp->count); memcpy(slist, cexp->values, sizeof(int) * cexp->count); memset(mask, 0, sizeof(int) * cexp->count); quicksort(slist, 0, cexp->count - 1); reverse(slist, 0, cexp->count - 1); int p = 0, i; if (this->type == keep) { // how many do we want? cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < cnum->values[0]); i++) { int j, found = 0; for (j = 0; j < cnum->values[0]; j++) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } else { cret->count = max(cexp->count - cnum->values[0], 0); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < (cexp->count - cnum->values[0])); i++) { int j, found = 0; for (j = cexp->count - 1; j >= cnum->values[0]; j--) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; // XXX der mask kram auch bei high, und auch im // roll.tc mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } free(slist); free(mask); cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } #line 2384 "tree.c" struct high_vtable__ const high_vt__ = { &filter_vt__, high_kind, "high", (void (*)(expression *this__, int depth))high_printtree__, (struct roll_value * (*)(expression *this__))high_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))high_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void low_printtree__(low *this, int depth) #line 191 "printtree.tc" { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("low\n"); printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 2412 "tree.c" struct roll_value * low_roll__(low *this) #line 322 "roll.tc" { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to last isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } int *slist = (int*)malloc(sizeof(int) * exp->count); int *mask = (int*)malloc(sizeof(int) * exp->count); memcpy(slist, exp->values, sizeof(int) * exp->count); memset(mask, 0, sizeof(int) * exp->count); quicksort(slist, 0, exp->count -1); int p = 0, i, c = 0; if (this->type == keep) { for (i = 0; (i < exp->count) && (c < num->values[0]); i++) { int j, found = 0; for (j = 0; j < num->values[0]; j++) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } else { for (i = 0; (i < exp->count) && (c < (exp->count - num->values[0])); i++) { int j, found = 0; for (j = exp->count - 1; j >= num->values[0]; j--) { if ((exp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } else { } } if (found) { exp->values[p++] = exp->values[i]; c++; } } } exp->count = c; free_roll(num); free(slist); free(mask); return exp; } #line 2474 "tree.c" struct val_list * low_eval__(low *this) #line 521 "eval.tc" { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"low\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; // ready, start the actual filtering: // we want up to cnum->values[0] items from cexp in cret int *slist = (int*)malloc(sizeof(int) * cexp->count); int *mask = (int*)malloc(sizeof(int) * cexp->count); memcpy(slist, cexp->values, sizeof(int) * cexp->count); memset(mask, 0, sizeof(int) * cexp->count); quicksort(slist, 0, cexp->count - 1); int p = 0, i; if (this->type == keep) { // how many do we want? cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < cnum->values[0]); i++) { int j, found = 0; for (j = 0; j < cnum->values[0]; j++) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } else { cret->count = max(cexp->count - cnum->values[0], 0); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < (cexp->count - cnum->values[0])); i++) { int j, found = 0; for (j = cexp->count - 1; j >= cnum->values[0]; j--) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; // XXX der mask kram auch bei high, und auch im // roll.tc mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } free(slist); free(mask); cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } #line 2561 "tree.c" struct low_vtable__ const low_vt__ = { &filter_vt__, low_kind, "low", (void (*)(expression *this__, int depth))low_printtree__, (struct roll_value * (*)(expression *this__))low_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))low_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void comparison_printtree__(comparison *this, int depth) #line 205 "printtree.tc" { indent(depth); if (this->type == drop) { printf("drop "); } else { printf("keep "); } printf("comparison "); switch (this->comp) { case eq: printf("eq\n"); break; case ne: printf("ne\n"); break; case gt: printf("gt\n"); break; case lt: printf("lt\n"); break; case ge: printf("ge\n"); break; case le: printf("le\n"); break; default: yyerror("Unexpected comparison (really bad)"); } printtree(this->expr1, depth+1); printtree(this->expr2, depth+1); } #line 2611 "tree.c" struct roll_value * comparison_roll__(comparison *this) #line 438 "roll.tc" { struct roll_value *num = roll(this->expr1); struct roll_value *exp = roll(this->expr2); if (num->count != 1) { yyerror("Argument 1 to comparison isn't scalar"); free_roll(num); exp->count = 1; exp->values[0] = 0; return exp; } int o, n = 0; for (o = 0; o < exp->count; o++) { int c = 0; switch (this->comp) { case eq: c = exp->values[o] == num->values[0]; break; case ne: c = exp->values[o] != num->values[0]; break; case gt: c = exp->values[o] > num->values[0]; break; case lt: c = exp->values[o] < num->values[0]; break; case ge: c = exp->values[o] >= num->values[0]; break; case le: c = exp->values[o] <= num->values[0]; break; default: yyerror("Unexpected comparison (really bad)"); } if (this->type == drop) { c = !c; } if (c) { exp->values[n++] = exp->values[o]; } } exp->count = n; free_roll(num); return exp; } #line 2661 "tree.c" struct val_list * comparison_eval__(comparison *this) #line 606 "eval.tc" { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to comparison operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = list_new (cexp->count, cexp->prob * cnum->prob); cret->count = 0; // updated below int o; for (o = 0; o < cexp->count; o++) { int c = 0; switch (this->comp) { case eq: c = cexp->values[o] == cnum->values[0]; break; case ne: c = cexp->values[o] != cnum->values[0]; break; case gt: c = cexp->values[o] > cnum->values[0]; break; case lt: c = cexp->values[o] < cnum->values[0]; break; case ge: c = cexp->values[o] >= cnum->values[0]; break; case le: c = cexp->values[o] <= cnum->values[0]; break; default: yyerror("Unexpected comparison (really bad)"); list_free(exp); list_free(num); return error_val(); } if (this->type == drop) { c = !c; } if (c) { cret->values[cret->count++] = cexp->values[o]; } } list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } #line 2729 "tree.c" struct comparison_vtable__ const comparison_vt__ = { &filter_vt__, comparison_kind, "comparison", (void (*)(expression *this__, int depth))comparison_printtree__, (struct roll_value * (*)(expression *this__))comparison_roll__, (void (*)(expression *this__, struct symtab * st))binary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))binary_set_ordering__, (struct val_list * (*)(expression *this__))comparison_eval__, (expression * (*)(expression *this__))binary_optimize__, }; void negate_printtree__(negate *this, int depth) #line 31 "printtree.tc" { indent(depth); printf("-\n"); printtree(this->expr, depth+1); } #line 2750 "tree.c" struct roll_value * negate_roll__(negate *this) #line 171 "roll.tc" { struct roll_value *rv = roll(this->expr); if (rv->count != 1) { yyerror("Argument 1 to negate (-) isn't scalar"); rv->count = 1; rv->values[0] = 0; return rv; } rv->values[0] *= -1; return rv; } #line 2765 "tree.c" struct val_list * negate_eval__(negate *this) #line 832 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *cside = sides; while (cside) { // make sure this is scalar if (cside->count != 1) { yyerror("Argument to negate operator is not scalar"); return error_val(); } cside->values[0] *= -1; cside = cside->next; } return sides; } #line 2784 "tree.c" struct negate_vtable__ const negate_vt__ = { &unary_vt__, negate_kind, "negate", (void (*)(expression *this__, int depth))negate_printtree__, (struct roll_value * (*)(expression *this__))negate_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))unary_set_ordering__, (struct val_list * (*)(expression *this__))negate_eval__, (expression * (*)(expression *this__))unary_optimize__, }; void dice_printtree__(dice *this, int depth) #line 100 "printtree.tc" { indent(depth); printf("d\n"); printtree(this->expr, depth+1); } #line 2805 "tree.c" struct roll_value * dice_roll__(dice *this) #line 184 "roll.tc" { struct roll_value *rv = roll(this->expr); if (rv->count != 1) { yyerror("Argument 1 to dice (d) isn't scalar"); rv->count = 1; rv->values[0] = 0; return rv; } if (rv->values[0] < 1) { yyerror("Argument 1 to dice (d) isn't >= 1"); rv->count = 1; rv->values[0] = 0; return rv; } rv->values[0] = 1 + (int) (rv->values[0] * (rand() / (RAND_MAX + 1.0))); return rv; } #line 2826 "tree.c" struct val_list * dice_eval__(dice *this) #line 849 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { // make sure this is scalar and > 0 if (cside->count != 1) { yyerror("Argument to \"dice\" operator is not scalar"); list_free(sides); return error_val(); } if (cside->values[0] <= 0) { yyerror("Argument to \"dice\" operator is not > 0"); list_free(sides); return error_val(); } int i; for (i = 1; i <= cside->values[0]; i++) { // create a matching result struct val_list *cret = list_new(1, cside->prob/cside->values[0]); cret->values[0] = i; list_add(&ret, cret, this->ordering); } cside = cside->next; } list_free(sides); return ret; } #line 2859 "tree.c" struct dice_vtable__ const dice_vt__ = { &unary_vt__, dice_kind, "dice", (void (*)(expression *this__, int depth))dice_printtree__, (struct roll_value * (*)(expression *this__))dice_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))unary_set_ordering__, (struct val_list * (*)(expression *this__))dice_eval__, (expression * (*)(expression *this__))unary_optimize__, }; void sum_printtree__(sum *this, int depth) #line 107 "printtree.tc" { indent(depth); printf("sum\n"); printtree(this->expr, depth+1); } #line 2880 "tree.c" struct roll_value * sum_roll__(sum *this) #line 203 "roll.tc" { int s = 0; int i; struct roll_value *rv = roll(this->expr); for (i = 0; i < rv->count; i++) { s += rv->values[i]; } rv->count = 1; rv->values = (int*)realloc(rv->values, sizeof(int) * rv->count); rv->values[0] = s; return rv; } #line 2896 "tree.c" void sum_set_ordering__(sum *this, ordering_type ordering) #line 25 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr, agnostic); } #line 2904 "tree.c" struct val_list * sum_eval__(sum *this) #line 880 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { int sum = 0; int i; for (i = 0; i < cside->count; i++) { sum += cside->values[i]; } struct val_list *cret = list_new(1, cside->prob); cret->values[0] = sum; list_add(&ret, cret, this->ordering); cside = cside->next; } list_free(sides); return ret; } #line 2927 "tree.c" expression * sum_optimize__(sum *this) #line 251 "optimize.tc" { if (yykind(this->expr) == rep_kind) { rep *crep = (rep*)this->expr; if (yykind(crep->expr2) == dice_kind) { dice *cdice = (dice*)crep->expr2; if (yykind(cdice->expr) == number_kind) { // case: sum N#dM expression *replace = sumrepdice_create( eval(crep->expr1), ((number*)cdice->expr)->num); return replace; } } else { // case: sum N#XXX expression *replace = sumrepany_create( eval(crep->expr1), eval(sum_create(crep->expr2))); return replace; } } return (expression*)this; } #line 2954 "tree.c" struct sum_vtable__ const sum_vt__ = { &unary_vt__, sum_kind, "sum", (void (*)(expression *this__, int depth))sum_printtree__, (struct roll_value * (*)(expression *this__))sum_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))sum_set_ordering__, (struct val_list * (*)(expression *this__))sum_eval__, (expression * (*)(expression *this__))sum_optimize__, }; void prod_printtree__(prod *this, int depth) #line 114 "printtree.tc" { indent(depth); printf("prod\n"); printtree(this->expr, depth+1); } #line 2975 "tree.c" struct roll_value * prod_roll__(prod *this) #line 217 "roll.tc" { int s = 1; int i; struct roll_value *rv = roll(this->expr); for (i = 0; i < rv->count; i++) { s *= rv->values[i]; } rv->count = 1; rv->values = (int*)realloc(rv->values, sizeof(int) * rv->count); rv->values[0] = s; return rv; } #line 2991 "tree.c" void prod_set_ordering__(prod *this, ordering_type ordering) #line 31 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr, agnostic); } #line 2999 "tree.c" struct val_list * prod_eval__(prod *this) #line 901 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { int prod = 1; int i; for (i = 0; i < cside->count; i++) { prod *= cside->values[i]; } struct val_list *cret = list_new(1, cside->prob); cret->values[0] = prod; list_add(&ret, cret, this->ordering); cside = cside->next; } list_free(sides); return ret; } #line 3022 "tree.c" struct prod_vtable__ const prod_vt__ = { &unary_vt__, prod_kind, "prod", (void (*)(expression *this__, int depth))prod_printtree__, (struct roll_value * (*)(expression *this__))prod_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))prod_set_ordering__, (struct val_list * (*)(expression *this__))prod_eval__, (expression * (*)(expression *this__))unary_optimize__, }; void count_printtree__(count *this, int depth) #line 121 "printtree.tc" { indent(depth); printf("count\n"); printtree(this->expr, depth+1); } #line 3043 "tree.c" struct roll_value * count_roll__(count *this) #line 258 "roll.tc" { struct roll_value *rv = roll(this->expr); rv->values = realloc(rv->values, sizeof(int)); rv->values[0] = rv->count; rv->count = 1; return rv; } #line 3054 "tree.c" void count_set_ordering__(count *this, ordering_type ordering) #line 37 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr, agnostic); } #line 3062 "tree.c" struct val_list * count_eval__(count *this) #line 922 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { struct val_list *cret = list_new(1, cside->prob); cret->values[0] = cside->count; list_add(&ret, cret, this->ordering); cside = cside->next; } list_free(sides); return ret; } #line 3080 "tree.c" struct count_vtable__ const count_vt__ = { &unary_vt__, count_kind, "count", (void (*)(expression *this__, int depth))count_printtree__, (struct roll_value * (*)(expression *this__))count_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))count_set_ordering__, (struct val_list * (*)(expression *this__))count_eval__, (expression * (*)(expression *this__))unary_optimize__, }; void perm_printtree__(perm *this, int depth) #line 128 "printtree.tc" { indent(depth); printf("perm\n"); printtree(this->expr, depth+1); } #line 3101 "tree.c" struct roll_value * perm_roll__(perm *this) #line 231 "roll.tc" { struct roll_value *rv = roll(this->expr); permute(rv->values, rv->count); return rv; } #line 3110 "tree.c" void perm_set_ordering__(perm *this, ordering_type ordering) #line 49 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr, agnostic); } #line 3118 "tree.c" struct val_list * perm_eval__(perm *this) #line 950 "eval.tc" { struct val_list *exp = eval(this->expr); struct val_list *cexp = exp; struct val_list *ret = NULL; if (this->ordering == agnostic) { return exp; } while(cexp) { all_permutations(cexp->values, cexp->count, cb_perm, &ret, cexp->prob / factorial(cexp->count)); cexp = cexp->next; } list_free(exp); return ret; } #line 3139 "tree.c" struct perm_vtable__ const perm_vt__ = { &unary_vt__, perm_kind, "perm", (void (*)(expression *this__, int depth))perm_printtree__, (struct roll_value * (*)(expression *this__))perm_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))perm_set_ordering__, (struct val_list * (*)(expression *this__))perm_eval__, (expression * (*)(expression *this__))unary_optimize__, }; void sort_printtree__(sort *this, int depth) #line 135 "printtree.tc" { indent(depth); printf("sort\n"); printtree(this->expr, depth+1); } #line 3160 "tree.c" struct roll_value * sort_roll__(sort *this) #line 238 "roll.tc" { struct roll_value *rv = roll(this->expr); /* sortiere */ quicksort(rv->values, 0, rv->count - 1); return rv; } #line 3170 "tree.c" void sort_set_ordering__(sort *this, ordering_type ordering) #line 43 "ordering.tc" { this->ordering = ordering; set_ordering(this->expr, agnostic); } #line 3178 "tree.c" struct val_list * sort_eval__(sort *this) #line 969 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *cside = sides; if (this->ordering != agnostic) { while (cside) { quicksort(cside->values, 0, cside->count - 1); cside = cside->next; } } return sides; } #line 3194 "tree.c" struct sort_vtable__ const sort_vt__ = { &unary_vt__, sort_kind, "sort", (void (*)(expression *this__, int depth))sort_printtree__, (struct roll_value * (*)(expression *this__))sort_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))sort_set_ordering__, (struct val_list * (*)(expression *this__))sort_eval__, (expression * (*)(expression *this__))unary_optimize__, }; void rev_printtree__(rev *this, int depth) #line 142 "printtree.tc" { indent(depth); printf("rev\n"); printtree(this->expr, depth+1); } #line 3215 "tree.c" struct roll_value * rev_roll__(rev *this) #line 246 "roll.tc" { int i; struct roll_value *rv = roll(this->expr); for (i = 0; i < rv->count/2; i++) { rv->values[i] ^= rv->values[rv->count-1-i]; rv->values[rv->count-1-i] ^= rv->values[i]; rv->values[i] ^= rv->values[rv->count-1-i]; } return rv; } #line 3229 "tree.c" struct val_list * rev_eval__(rev *this) #line 983 "eval.tc" { struct val_list *sides = eval(this->expr); struct val_list *cside = sides; if (this->ordering != agnostic) { while (cside) { int i, j; i = 0; j = cside->count-1; while (i < j) { int t = cside->values[i]; cside->values[i] = cside->values[j]; cside->values[j] = t; i++; j--; } cside = cside->next; } } return sides; } #line 3253 "tree.c" struct rev_vtable__ const rev_vt__ = { &unary_vt__, rev_kind, "rev", (void (*)(expression *this__, int depth))rev_printtree__, (struct roll_value * (*)(expression *this__))rev_roll__, (void (*)(expression *this__, struct symtab * st))unary_set_symtab__, (void (*)(expression *this__, ordering_type ordering))unary_set_ordering__, (struct val_list * (*)(expression *this__))rev_eval__, (expression * (*)(expression *this__))unary_optimize__, }; expression *elist_create(void) { elist *node__ = (elist *)yynodealloc(sizeof(struct elist__)); if(node__ == 0) return 0; node__->vtable__ = &elist_vt__; node__->kind__ = elist_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; return (expression *)node__; } expression *number_create(int num) { number *node__ = (number *)yynodealloc(sizeof(struct number__)); if(node__ == 0) return 0; node__->vtable__ = &number_vt__; node__->kind__ = number_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->num = num; return (expression *)node__; } expression *ifthenelse_create(expression * if_expr, expression * then_expr, expression * else_expr) { ifthenelse *node__ = (ifthenelse *)yynodealloc(sizeof(struct ifthenelse__)); if(node__ == 0) return 0; node__->vtable__ = &ifthenelse_vt__; node__->kind__ = ifthenelse_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->if_expr = if_expr; node__->then_expr = then_expr; node__->else_expr = else_expr; return (expression *)node__; } expression *variable_create(char * varname) { variable *node__ = (variable *)yynodealloc(sizeof(struct variable__)); if(node__ == 0) return 0; node__->vtable__ = &variable_vt__; node__->kind__ = variable_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->varname = varname; return (expression *)node__; } expression *sumrepdice_create(struct val_list * num_dice, int num_sides) { sumrepdice *node__ = (sumrepdice *)yynodealloc(sizeof(struct sumrepdice__)); if(node__ == 0) return 0; node__->vtable__ = &sumrepdice_vt__; node__->kind__ = sumrepdice_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->num_dice = num_dice; node__->num_sides = num_sides; return (expression *)node__; } expression *sumrepany_create(struct val_list * number, struct val_list * data) { sumrepany *node__ = (sumrepany *)yynodealloc(sizeof(struct sumrepany__)); if(node__ == 0) return 0; node__->vtable__ = &sumrepany_vt__; node__->kind__ = sumrepany_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->number = number; node__->data = data; return (expression *)node__; } expression *scat_create(expression * expr1, expression * expr2) { scat *node__ = (scat *)yynodealloc(sizeof(struct scat__)); if(node__ == 0) return 0; node__->vtable__ = &scat_vt__; node__->kind__ = scat_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *rep_create(expression * expr1, expression * expr2) { rep *node__ = (rep *)yynodealloc(sizeof(struct rep__)); if(node__ == 0) return 0; node__->vtable__ = &rep_vt__; node__->kind__ = rep_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *range_create(expression * expr1, expression * expr2) { range *node__ = (range *)yynodealloc(sizeof(struct range__)); if(node__ == 0) return 0; node__->vtable__ = &range_vt__; node__->kind__ = range_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *lcat_create(expression * expr1, expression * expr2) { lcat *node__ = (lcat *)yynodealloc(sizeof(struct lcat__)); if(node__ == 0) return 0; node__->vtable__ = &lcat_vt__; node__->kind__ = lcat_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *let_create(expression * expr1, expression * expr2, char * varname) { let *node__ = (let *)yynodealloc(sizeof(struct let__)); if(node__ == 0) return 0; node__->vtable__ = &let_vt__; node__->kind__ = let_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->varname = varname; return (expression *)node__; } expression *foreach_create(expression * expr1, expression * expr2, char * varname) { foreach *node__ = (foreach *)yynodealloc(sizeof(struct foreach__)); if(node__ == 0) return 0; node__->vtable__ = &foreach_vt__; node__->kind__ = foreach_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->varname = varname; return (expression *)node__; } expression *whiledo_create(expression * expr1, expression * expr2, char * varname) { whiledo *node__ = (whiledo *)yynodealloc(sizeof(struct whiledo__)); if(node__ == 0) return 0; node__->vtable__ = &whiledo_vt__; node__->kind__ = whiledo_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->varname = varname; return (expression *)node__; } expression *plus_create(expression * expr1, expression * expr2) { plus *node__ = (plus *)yynodealloc(sizeof(struct plus__)); if(node__ == 0) return 0; node__->vtable__ = &plus_vt__; node__->kind__ = plus_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *minus_create(expression * expr1, expression * expr2) { minus *node__ = (minus *)yynodealloc(sizeof(struct minus__)); if(node__ == 0) return 0; node__->vtable__ = &minus_vt__; node__->kind__ = minus_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *multi_create(expression * expr1, expression * expr2) { multi *node__ = (multi *)yynodealloc(sizeof(struct multi__)); if(node__ == 0) return 0; node__->vtable__ = &multi_vt__; node__->kind__ = multi_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *divi_create(expression * expr1, expression * expr2) { divi *node__ = (divi *)yynodealloc(sizeof(struct divi__)); if(node__ == 0) return 0; node__->vtable__ = &divi_vt__; node__->kind__ = divi_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *mod_create(expression * expr1, expression * expr2) { mod *node__ = (mod *)yynodealloc(sizeof(struct mod__)); if(node__ == 0) return 0; node__->vtable__ = &mod_vt__; node__->kind__ = mod_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *expo_create(expression * expr1, expression * expr2) { expo *node__ = (expo *)yynodealloc(sizeof(struct expo__)); if(node__ == 0) return 0; node__->vtable__ = &expo_vt__; node__->kind__ = expo_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; return (expression *)node__; } expression *first_create(expression * expr1, expression * expr2, filter_type type) { first *node__ = (first *)yynodealloc(sizeof(struct first__)); if(node__ == 0) return 0; node__->vtable__ = &first_vt__; node__->kind__ = first_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->type = type; return (expression *)node__; } expression *last_create(expression * expr1, expression * expr2, filter_type type) { last *node__ = (last *)yynodealloc(sizeof(struct last__)); if(node__ == 0) return 0; node__->vtable__ = &last_vt__; node__->kind__ = last_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->type = type; return (expression *)node__; } expression *high_create(expression * expr1, expression * expr2, filter_type type) { high *node__ = (high *)yynodealloc(sizeof(struct high__)); if(node__ == 0) return 0; node__->vtable__ = &high_vt__; node__->kind__ = high_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->type = type; return (expression *)node__; } expression *low_create(expression * expr1, expression * expr2, filter_type type) { low *node__ = (low *)yynodealloc(sizeof(struct low__)); if(node__ == 0) return 0; node__->vtable__ = &low_vt__; node__->kind__ = low_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->type = type; return (expression *)node__; } expression *comparison_create(expression * expr1, expression * expr2, filter_type type, comparison_type comp) { comparison *node__ = (comparison *)yynodealloc(sizeof(struct comparison__)); if(node__ == 0) return 0; node__->vtable__ = &comparison_vt__; node__->kind__ = comparison_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr1 = expr1; node__->expr2 = expr2; node__->type = type; node__->comp = comp; return (expression *)node__; } expression *negate_create(expression * expr) { negate *node__ = (negate *)yynodealloc(sizeof(struct negate__)); if(node__ == 0) return 0; node__->vtable__ = &negate_vt__; node__->kind__ = negate_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *dice_create(expression * expr) { dice *node__ = (dice *)yynodealloc(sizeof(struct dice__)); if(node__ == 0) return 0; node__->vtable__ = &dice_vt__; node__->kind__ = dice_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *sum_create(expression * expr) { sum *node__ = (sum *)yynodealloc(sizeof(struct sum__)); if(node__ == 0) return 0; node__->vtable__ = &sum_vt__; node__->kind__ = sum_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *prod_create(expression * expr) { prod *node__ = (prod *)yynodealloc(sizeof(struct prod__)); if(node__ == 0) return 0; node__->vtable__ = &prod_vt__; node__->kind__ = prod_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *count_create(expression * expr) { count *node__ = (count *)yynodealloc(sizeof(struct count__)); if(node__ == 0) return 0; node__->vtable__ = &count_vt__; node__->kind__ = count_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *perm_create(expression * expr) { perm *node__ = (perm *)yynodealloc(sizeof(struct perm__)); if(node__ == 0) return 0; node__->vtable__ = &perm_vt__; node__->kind__ = perm_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *sort_create(expression * expr) { sort *node__ = (sort *)yynodealloc(sizeof(struct sort__)); if(node__ == 0) return 0; node__->vtable__ = &sort_vt__; node__->kind__ = sort_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } expression *rev_create(expression * expr) { rev *node__ = (rev *)yynodealloc(sizeof(struct rev__)); if(node__ == 0) return 0; node__->vtable__ = &rev_vt__; node__->kind__ = rev_kind; node__->filename__ = yycurrfilename(); node__->linenum__ = yycurrlinenum(); node__->symtab = NULL; node__->ordering = caring; node__->expr = expr; return (expression *)node__; } struct yy_vtable__ { const struct yy_vtable__ *parent__; int kind__; }; int yyisa__(const void *vtable__, int kind__) { const struct yy_vtable__ *vt; vt = (const struct yy_vtable__ *)vtable__; while(vt != 0) { if(vt->kind__ == kind__) return 1; vt = vt->parent__; } return 0; } dicelab-0.7/eval.tc0000644000175000017500000006071311303206024011141 00000000000000%operation %virtual struct val_list *eval(expression *this) // XXX free shit more often // XXX ifthenelse example in README etc is wrong, should be without the "count" operator %decls %{ #include extern float cmd_threshold; struct val_list { double prob; int count; int *values; struct val_list *next; }; void list_free(struct val_list *list); %} %{ struct val_list *list_new(size_t count, double prob) { struct val_list *ret = (struct val_list*)malloc(sizeof(struct val_list)); ret->next = NULL; ret->prob = prob; ret->count = count; ret->values = count ? (int*)malloc(count * sizeof(int)): NULL; memset(ret->values, 0, count * sizeof(int)); return ret; } // add cret to ret void list_add(struct val_list **ret, struct val_list *cret, ordering_type ordering) { // and add to the list struct val_list *search = *ret; struct val_list *lsearch = NULL; if (ordering == agnostic) { quicksort(cret->values, 0, cret->count-1); } while (search) { if ((search->count == cret->count) && (memcmp(search->values, cret->values, cret->count * sizeof(int)) == 0)) { break; } lsearch = search; search = search->next; } if (search) { // already present, add search->prob += cret->prob; free(cret->values); free(cret); } else if (lsearch) { lsearch->next = cret; } else { *ret = cret; } } struct val_list *error_val() { struct val_list *ret = list_new(1, 1.0); ret->values[0] = 0; return ret; } void list_free(struct val_list *list) { while (list != NULL) { struct val_list *cur = list; list = list->next; free(cur->values); free(cur); } } %} eval(elist) { return list_new(0, 1.0); } eval(mathop) { struct val_list *e1 = eval(this->expr1); struct val_list *e2 = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ce1 = e1; struct val_list *ce2; while (ce1) { ce2 = e2; while (ce2) { if (ce1->count != 1) { yyerror("Argument 1 to math operator is not scalar"); list_free(e1); list_free(e2); return error_val(); } if (ce2->count != 1) { yyerror("Argument 2 to math operator is not scalar"); list_free(e1); list_free(e2); return error_val(); } struct val_list *cret = list_new(1, ce1->prob * ce2->prob); switch (yykind(this)) { case plus_kind: cret->values[0] = ce1->values[0] + ce2->values[0]; break; case minus_kind: cret->values[0] = ce1->values[0] - ce2->values[0]; break; case multi_kind: cret->values[0] = ce1->values[0] * ce2->values[0]; break; case divi_kind: cret->values[0] = ce1->values[0] / ce2->values[0]; break; case mod_kind: cret->values[0] = ce1->values[0] % ce2->values[0]; break; case expo_kind: cret->values[0] = (int) pow(ce1->values[0], ce2->values[0]); break; default: yyerror("Unknown math op"); list_free(e1); list_free(e2); return error_val(); } list_add(&ret, cret, this->ordering); ce2 = ce2->next; } ce1 = ce1->next; } list_free(e1); list_free(e2); return ret; } // XXX do this with mathop refactoring eval(scat) { struct val_list *e1 = eval(this->expr1); struct val_list *e2 = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ce1 = e1; struct val_list *ce2; while (ce1) { ce2 = e2; while (ce2) { if (ce1->count != 1) { yyerror("Argument 1 to scalar concatenation is not scalar"); list_free(e1); list_free(e2); return error_val(); } if (ce2->count != 1) { yyerror("Argument 2 to scalar concatenation is not scalar"); list_free(e1); list_free(e2); return error_val(); } struct val_list *cret = list_new(1, ce1->prob * ce2->prob); int i = 10; while (i < ce2->values[0]) { i *= 10; } cret->values[0] = ce1->values[0]; cret->values[0] *= i; cret->values[0] += ce2->values[0]; list_add(&ret, cret, this->ordering); ce2 = ce2->next; } ce1 = ce1->next; } list_free(e1); list_free(e2); return ret; } // XXX this should be done recursively ? eval(rep) { struct val_list *cnt = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ccnt = cnt; int i; while (ccnt) { if (ccnt->count != 1) { yyerror("Argument to repetition operator is not scalar"); list_free(cnt); list_free(exp); return error_val(); } // init everything int icnt = ccnt->values[0]; if (icnt > 0) { int expcnt = 0; struct val_list *cexp = exp; while (cexp) { expcnt++; cexp = cexp->next; } int pos[icnt]; memset(pos, 0, icnt * sizeof(int)); struct val_list *index[expcnt]; i = 0; cexp = exp; while (cexp) { index[i] = cexp; i++; cexp = cexp->next; } // the main iteration do { // do this set int len = 0; double prob = ccnt->prob; for (i = 0; i < icnt; i++) { len += index[pos[i]]->count; prob *= index[pos[i]]->prob; } struct val_list *cret = list_new(len, prob); int cp = 0; for (i = 0; i < icnt; i++) { memcpy(&cret->values[cp], index[pos[i]]->values, index[pos[i]]->count * sizeof(int)); cp += index[pos[i]]->count; } list_add(&ret, cret, this->ordering); // next iteration pos[0]++; i = 0; while ((pos[i] == expcnt) && (i < icnt-1)){ pos[i] = 0; i++; pos[i]++; } } while (pos[icnt-1] < expcnt); } else { list_add(&ret, list_new(0, ccnt->prob), this->ordering); } // next iteration ccnt=ccnt->next; } // if we have nothing, return an empty list if (ret == NULL) { struct val_list *cret = list_new(0, 1.0); list_add(&ret, cret, this->ordering); } list_free(cnt); list_free(exp); return ret; } eval(range) { struct val_list *from = eval(this->expr1); struct val_list *to = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cfrom = from; struct val_list *cto; while (cfrom) { cto = to; while (cto) { // check both are scalar if (cfrom->count != 1) { yyerror("Argument \"from\" to range operator is not scalar"); list_free(from); list_free(to); return error_val(); } if (cto->count != 1) { yyerror("Argument \"to\" to range operator is not scalar"); list_free(from); list_free(to); return error_val(); } int ifrom = cfrom->values[0]; int ito = cto->values[0]; int count = ito - ifrom + 1; if (count < 0) { count = 0; } struct val_list *cret = list_new(count, cfrom->prob * cto->prob); int i, c; for (i = ifrom, c = 0; i <= ito; ++i, ++c) { cret->values[c] = i; } list_add(&ret, cret, this->ordering); cto = cto->next; } cfrom = cfrom->next; } list_free(from); list_free(to); return ret; } eval(lcat) { struct val_list *e1 = eval(this->expr1); struct val_list *e2 = eval(this->expr2); struct val_list *ret = NULL; struct val_list *ce1 = e1; struct val_list *ce2; while (ce1) { ce2 = e2; while (ce2) { struct val_list *cret = list_new (ce1->count + ce2->count, ce1->prob * ce2->prob); memcpy(cret->values, ce1->values, ce1->count * sizeof(int)); memcpy(&cret->values[ce1->count], ce2->values, ce2->count * sizeof(int)); list_add(&ret, cret, this->ordering); ce2 = ce2->next; } ce1 = ce1->next; } list_free(e1); list_free(e2); return ret; } eval(first) { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"first\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; if (this->type == drop) { cret->count = cexp->count - cnum->values[0]; if (cret->count <= 0) { cret->count = 0; } cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, &cexp->values[cexp->count - cret->count], cret->count * sizeof(int)); } else { cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, cexp->values, cret->count * sizeof(int)); } cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } eval(last) { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"last\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; if (this->type == drop) { cret->count = max(cexp->count - cnum->values[0], 0); cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, cexp->values, cret->count * sizeof(int)); } else { cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, &cexp->values[cexp->count - cret->count], cret->count * sizeof(int)); // XXX this block is complete bollocks /* if (cnum->values[0] < cexp->count) { cret->count = cnum->values[0]; cret->values = (int*)malloc(cret->count * sizeof(int)); memcpy(cret->values, &cexp->values[cexp->count - cnum->values[0]], cret->count * sizeof(int)); }*/ } cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } eval(high) { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"high\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; // ready, start the actual filtering: // we want up to cnum->values[0] items from cexp in cret int *slist = (int*)malloc(sizeof(int) * cexp->count); int *mask = (int*)malloc(sizeof(int) * cexp->count); memcpy(slist, cexp->values, sizeof(int) * cexp->count); memset(mask, 0, sizeof(int) * cexp->count); quicksort(slist, 0, cexp->count - 1); reverse(slist, 0, cexp->count - 1); int p = 0, i; if (this->type == keep) { // how many do we want? cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < cnum->values[0]); i++) { int j, found = 0; for (j = 0; j < cnum->values[0]; j++) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } else { cret->count = max(cexp->count - cnum->values[0], 0); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < (cexp->count - cnum->values[0])); i++) { int j, found = 0; for (j = cexp->count - 1; j >= cnum->values[0]; j--) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; // XXX der mask kram auch bei high, und auch im // roll.tc mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } free(slist); free(mask); cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } eval(low) { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to \"low\" operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = (struct val_list*) malloc(sizeof(struct val_list)); cret->next = NULL; // ready, start the actual filtering: // we want up to cnum->values[0] items from cexp in cret int *slist = (int*)malloc(sizeof(int) * cexp->count); int *mask = (int*)malloc(sizeof(int) * cexp->count); memcpy(slist, cexp->values, sizeof(int) * cexp->count); memset(mask, 0, sizeof(int) * cexp->count); quicksort(slist, 0, cexp->count - 1); int p = 0, i; if (this->type == keep) { // how many do we want? cret->count = min(cexp->count, cnum->values[0]); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < cnum->values[0]); i++) { int j, found = 0; for (j = 0; j < cnum->values[0]; j++) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } else { cret->count = max(cexp->count - cnum->values[0], 0); cret->values = (int*)malloc(sizeof(int) * cret->count); for (i = 0; (i < cexp->count) && (p < (cexp->count - cnum->values[0])); i++) { int j, found = 0; for (j = cexp->count - 1; j >= cnum->values[0]; j--) { if ((cexp->values[i] == slist[j]) && (!mask[j])) { found = 1; // XXX der mask kram auch bei high, und auch im // roll.tc mask[j] = 1; break; } } if (found) { cret->values[p++] = cexp->values[i]; } } } free(slist); free(mask); cret->prob = cexp->prob * cnum->prob; list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } eval(comparison) { struct val_list *num = eval(this->expr1); struct val_list *exp = eval(this->expr2); struct val_list *ret = NULL; struct val_list *cnum = num; struct val_list *cexp; while (cnum) { // make sure cnum is skalar if (cnum->count != 1) { yyerror("Argument 1 to comparison operator is not scalar"); list_free(exp); list_free(num); return error_val(); } cexp = exp; while (cexp) { struct val_list *cret = list_new (cexp->count, cexp->prob * cnum->prob); cret->count = 0; // updated below int o; for (o = 0; o < cexp->count; o++) { int c = 0; switch (this->comp) { case eq: c = cexp->values[o] == cnum->values[0]; break; case ne: c = cexp->values[o] != cnum->values[0]; break; case gt: c = cexp->values[o] > cnum->values[0]; break; case lt: c = cexp->values[o] < cnum->values[0]; break; case ge: c = cexp->values[o] >= cnum->values[0]; break; case le: c = cexp->values[o] <= cnum->values[0]; break; default: yyerror("Unexpected comparison (really bad)"); list_free(exp); list_free(num); return error_val(); } if (this->type == drop) { c = !c; } if (c) { cret->values[cret->count++] = cexp->values[o]; } } list_add(&ret, cret, this->ordering); cexp = cexp->next; } cnum = cnum->next; } list_free(exp); list_free(num); return ret; } eval(let) { struct val_list *cnt = eval(this->expr1); struct val_list *ret = NULL; struct val_list *ccnt = cnt; while (ccnt) { struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = ccnt->count; nst->rvalue->values = (int*)malloc(sizeof(int) * ccnt->count); memcpy(nst->rvalue->values, ccnt->values, sizeof(int) * ccnt->count); nst->next = this->symtab; set_symtab(this->expr2, nst); struct val_list *cur = eval(this->expr2); struct val_list *ccur = cur; while (ccur) { struct val_list *temp = ccur; ccur = ccur->next; temp->next = NULL; temp->prob *= ccnt->prob; list_add(&ret, temp, this->ordering); } free_roll(nst->rvalue); free(nst); ccnt = ccnt->next; } list_free(cnt); return ret; } eval(foreach) { struct val_list *cnt = eval(this->expr1); struct val_list *ccnt = cnt; int i; struct val_list *tret = NULL; struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = this->varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = 1; nst->rvalue->values = (int*)malloc(sizeof(int)); nst->next = this->symtab; set_symtab(this->expr2, nst); // each possibility while (ccnt) { struct val_list *ret = list_new(0, 1.0); for (i = 0; i < ccnt->count; i++) { nst->rvalue->values[0] = ccnt->values[i]; struct val_list *cur = eval(this->expr2); // append each possibility in cur to each in ret, multiply // the probability with the one from ccnt. struct val_list *cret = ret; struct val_list *nret = NULL; while (cret) { struct val_list *ccur = cur; while (ccur) { struct val_list *item = list_new( ccur->count + cret->count, ccur->prob * cret->prob); memcpy(item->values, cret->values, sizeof(int) * cret->count); memcpy(&item->values[cret->count], ccur->values, sizeof(int) * ccur->count); list_add(&nret, item, this->ordering); ccur = ccur->next; } cret = cret->next; } list_free(cur); list_free(ret); ret = nret; nret = NULL; } struct val_list *cret = ret; while (cret) { cret->prob *= ccnt->prob; struct val_list *temp = cret; cret = cret->next; temp->next = NULL; list_add(&tret, temp, this->ordering); } ccnt = ccnt->next; } free_roll(nst->rvalue); free(nst); list_free(cnt); return tret; } %{ void rec_whiledo(struct val_list *v, char *varname, struct symtab *symtab, expression *expr, int *data, int count, struct val_list **ret, ordering_type ordering) { struct val_list *cv = v; while (cv) { // create a current list int ccount = count + cv->count; int *cdata = (int*)malloc(ccount * sizeof(int)); memcpy(cdata, data, count * sizeof(int)); memcpy(&cdata[count], cv->values, cv->count * sizeof(int)); // do this recursion if ((cv->count != 0) && (cv->prob >= cmd_threshold)) { // set the variable struct symtab *nst = (struct symtab*)malloc(sizeof(struct symtab)); nst->name = varname; nst->rvalue = (struct roll_value*)malloc(sizeof(struct roll_value)); nst->rvalue->count = cv->count; nst->rvalue->values = (int*)malloc(sizeof(int) * cv->count); memcpy(nst->rvalue->values, cv->values, sizeof(int) * cv->count); nst->next = symtab; set_symtab(expr, nst); // call the function struct val_list *x = eval(expr); // adjust the probability struct val_list *cx = x; while (cx) { cx->prob *= cv->prob; cx = cx->next; } // recursive call rec_whiledo(x, varname, symtab, expr, cdata, ccount, ret, ordering); // free the data, symtab and list free(cdata); free_roll(nst->rvalue); free(nst); list_free(x); } else { // add to final list struct val_list *cur = list_new(ccount, cv->prob); free(cur->values); cur->values = cdata; list_add(ret, cur, ordering); } // next element cv = cv->next; } } %} eval(whiledo) { struct val_list *expe = eval(this->expr1); struct val_list *ret = NULL; rec_whiledo(expe, this->varname, this->symtab, this->expr2, NULL, 0, &ret, this->ordering); list_free(expe); return ret; } eval(negate) { struct val_list *sides = eval(this->expr); struct val_list *cside = sides; while (cside) { // make sure this is scalar if (cside->count != 1) { yyerror("Argument to negate operator is not scalar"); return error_val(); } cside->values[0] *= -1; cside = cside->next; } return sides; } eval(dice) { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { // make sure this is scalar and > 0 if (cside->count != 1) { yyerror("Argument to \"dice\" operator is not scalar"); list_free(sides); return error_val(); } if (cside->values[0] <= 0) { yyerror("Argument to \"dice\" operator is not > 0"); list_free(sides); return error_val(); } int i; for (i = 1; i <= cside->values[0]; i++) { // create a matching result struct val_list *cret = list_new(1, cside->prob/cside->values[0]); cret->values[0] = i; list_add(&ret, cret, this->ordering); } cside = cside->next; } list_free(sides); return ret; } eval(sum) { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { int sum = 0; int i; for (i = 0; i < cside->count; i++) { sum += cside->values[i]; } struct val_list *cret = list_new(1, cside->prob); cret->values[0] = sum; list_add(&ret, cret, this->ordering); cside = cside->next; } list_free(sides); return ret; } eval(prod) { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { int prod = 1; int i; for (i = 0; i < cside->count; i++) { prod *= cside->values[i]; } struct val_list *cret = list_new(1, cside->prob); cret->values[0] = prod; list_add(&ret, cret, this->ordering); cside = cside->next; } list_free(sides); return ret; } eval(count) { struct val_list *sides = eval(this->expr); struct val_list *ret = NULL; struct val_list *cside = sides; while (cside) { struct val_list *cret = list_new(1, cside->prob); cret->values[0] = cside->count; list_add(&ret, cret, this->ordering); cside = cside->next; } list_free(sides); return ret; } %{ void cb_perm(int *data, int count, void *arg, float farg) { struct val_list **pret = (struct val_list**)arg; struct val_list *current = list_new(count, farg); memcpy(current->values, data, current->count * sizeof(int)); // XXX pass this from the tree instead of using caring all the time // or even better, don't do the permutations if we don't care about the // ordering list_add(pret, current, caring); } %} eval(perm) { struct val_list *exp = eval(this->expr); struct val_list *cexp = exp; struct val_list *ret = NULL; if (this->ordering == agnostic) { return exp; } while(cexp) { all_permutations(cexp->values, cexp->count, cb_perm, &ret, cexp->prob / factorial(cexp->count)); cexp = cexp->next; } list_free(exp); return ret; } eval(sort) { struct val_list *sides = eval(this->expr); struct val_list *cside = sides; if (this->ordering != agnostic) { while (cside) { quicksort(cside->values, 0, cside->count - 1); cside = cside->next; } } return sides; } eval(rev) { struct val_list *sides = eval(this->expr); struct val_list *cside = sides; if (this->ordering != agnostic) { while (cside) { int i, j; i = 0; j = cside->count-1; while (i < j) { int t = cside->values[i]; cside->values[i] = cside->values[j]; cside->values[j] = t; i++; j--; } cside = cside->next; } } return sides; } eval(number) { struct val_list *ret = list_new(1, 1.0); ret->values[0] = this->num; return ret; } eval(ifthenelse) { struct val_list *cnt = eval(this->if_expr); struct val_list *ccnt = cnt; struct val_list *ret = NULL; while (ccnt) { struct val_list *cur; if (ccnt->count > 0) { cur = eval(this->then_expr); } else { cur = eval(this->else_expr); } struct val_list *temp; while (cur) { temp = cur; cur = cur->next; temp->next = NULL; temp->prob *= ccnt->prob; list_add(&ret, temp, this->ordering); } ccnt = ccnt->next; } list_free(cnt); return ret; } eval(variable) { struct symtab *nst = this->symtab; struct val_list *ret = NULL; while (nst != NULL) { if (strcmp(this->varname, nst->name) == 0) { ret = list_new(nst->rvalue->count, 1.0); memcpy(ret->values, nst->rvalue->values, sizeof(int) * nst->rvalue->count); break; } nst = nst->next; } if (ret == NULL) { char *emsg = (char*)malloc(sizeof(char)*22+strlen(this->varname)); sprintf(emsg, "Variable \"%s\" not found", this->varname); yyerror(emsg); free(emsg); ret = error_val(); } return ret; } dicelab-0.7/lex.l0000644000175000017500000000174011303206024010622 00000000000000%{ #include "tree.h" #include "par.h" %} %option noyywrap %option nounput %option yylineno %% /* remove comments */ \/\/.* ^[ \t]*#.* [0-9]+ { yylval.ival = atoi(yytext); return NUMBER; } /* reserved words */ "d" return DICE; "sum" return SUM; "prod" return PROD; "count" return COUNT; "perm" return PERM; "sort" return SORT; "rev" return REV; "drop" return DROP; "keep" return KEEP; "low" return LOW; "high" return HIGH; "first" return FIRST; "last" return LAST; "let" return LET; "while" return WHILE; "foreach" return FOREACH; "in" return IN; "do" return DO; "if" return IF; "then" return THEN; "else" return ELSE; "==" return EQ; "!=" return NE; "<=" return LE; ">=" return GE; "<" return LT; ">" return GT; ".." return RANGE; [A-Za-z]+ { yylval.tval = (char*)malloc((strlen(yytext)+1) * sizeof(char)); strcpy(yylval.tval, yytext); return VARIABLE; } /* eat all whitespaces */ \r\n [[:space:]]+ /* return other single-characters directly */ . return(yytext[0]); dicelab-0.7/main.c0000644000175000017500000001070111303206024010742 00000000000000#include #include #include #include #include #include #include #include "config.h" #define DEFAULT_COUNT 10000 #define MINIMUM_COUNT 1 #define MAXIMUM_COUNT 100000000 #define DEFAULT_THRESH 0.000001 #ifdef MINFLOAT #define MINIMUM_THRESH MINFLOAT #else #define MINIMUM_THRESH 0.0000001 #endif #define MAXIMUM_THRESH 0.01 extern void yyparse(); extern FILE *yyin; int cmd_parse_tree = 0; int cmd_roll = 0; int cmd_rolleval = 0; int cmd_calc = 0; int cmd_count = DEFAULT_COUNT; float cmd_threshold = DEFAULT_THRESH; extern char *filename; static struct option long_options[] = { {"help", no_argument, 0, 'h'}, {"version", no_argument, 0, 'v'}, {"print-tree", no_argument, 0, 'p'}, {"roll", no_argument, 0, 'r'}, {"eval", no_argument, 0, 'e'}, {"calc", no_argument, 0, 'c'}, {"file", required_argument, 0, 'f'}, {"count", required_argument, 0, 'n'}, {"threshold", required_argument, 0, 't'}, {0, 0, 0, 0} }; void usage() { fprintf(stderr, "Usage: dicelab [options] [-f ]\n" "Options:\n" " --help -h -? print this text\n" " --version -v print the program version\n" " --print-tree -p print the parse tree (for debugging)\n" " --eval -e evaluate the statistical distribution by\n" " re-rolling\n" " --calc -c calculate the distribution\n" " --count -n specify the number of rolls used with --eval\n" " default is %i\n" " --roll -r roll the dice as specified, will also be used\n" " if no other action is requested\n" " --threshold -t cutoff threshold, results with a probability less\n" " than this value will be discarded by some operations\n" " when using --calc\n" "File:\n" " --file -f read the dice rolling specs from the file\n" " specified, use stdin if not supplied\n\n", DEFAULT_COUNT); }; void splitargv(int argc, char *argv[], int *margc, char ***margv) { *margc = 0; *margv = NULL; int i; for (i = 0; i < argc; i++) { char *tok; int first = 1; while ((tok = strtok(first ? argv[i] : NULL, " ")) != NULL) { first = 0; (*margc)++; *margv = (char**)realloc(*margv, sizeof(char*) * (*margc)); (*margv)[(*margc)-1] = tok; } } } int main(int argc, char *argv[]) { srand(time(NULL)); char *fname = NULL; int option_index = 0; int c; int margc; char **margv; splitargv(argc, argv, &margc, &margv); while (1) { c = getopt_long(margc, margv, "?hvprecn:f:t:", long_options, &option_index); if (c == -1) { break; } switch(c) { case 'v': printf("%s v%s by %s\n", PACKAGE_NAME, PACKAGE_VERSION, PACKAGE_BUGREPORT); return 0; break; case 'p': cmd_parse_tree = 1; break; case 'r': cmd_roll = 1; break; case 'e': cmd_rolleval = 1; break; case 'c': cmd_calc = 1; break; case 'n': // XXX checl atoi and atof for errors (e.g. param not a number) cmd_count = atoi(optarg); if (cmd_count < MINIMUM_COUNT) { fprintf(stderr, "Value for --count too low, adjusted to %i\n", MINIMUM_COUNT); cmd_count = MINIMUM_COUNT; } if (cmd_count > MAXIMUM_COUNT) { fprintf(stderr, "Value for --count too high, adjusted to %i\n", MAXIMUM_COUNT); cmd_count = MAXIMUM_COUNT; } break; case 't': cmd_threshold = atof(optarg); if (cmd_threshold < MINIMUM_THRESH) { fprintf(stderr, "Value for --threshold too low, adjusted\n"); cmd_threshold = MINIMUM_THRESH; } if (cmd_threshold > MAXIMUM_THRESH) { fprintf(stderr, "Value for --threshold too high, adjusted to %f\n", MAXIMUM_THRESH); cmd_threshold = MAXIMUM_THRESH; } break; case 'f': fname = (char*)malloc((strlen(optarg)+1)*sizeof(char)); filename = fname; strcpy(fname, optarg); break; default: usage(); return 1; } } if (optind < margc) { fprintf(stderr, "useless argument \"%s\"\n", margv[optind]); usage(); return 1; } if ((cmd_parse_tree == 0) && (cmd_roll == 0) && (cmd_rolleval == 0) && (cmd_calc == 0)) { cmd_roll = 1; } // clean up the cmdline parsing free(margv); margv = NULL; yyin = stdin; if (fname) { yyin = fopen(fname, "r"); if (yyin == NULL) { fprintf(stderr, "Could not open file \"%s\": %s\n", fname, strerror(errno)); free(fname); return 1; } } yyparse(); if(fname) { free(fname); } return 0; } dicelab-0.7/COPYING0000644000175000017500000004310311303206024010707 00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. dicelab-0.7/AUTHORS0000644000175000017500000000045211303206024010724 00000000000000A U T H O R S ============= Dicelab was written by Robert Lemmen . I would not have been able to do this without the previous work, code and comments from Torben Mogensen and Joel Uckelman. many thanks go to Jonas Koelker who sent in many patches and interesting ideas. dicelab-0.7/optimize.tc0000644000175000017500000001541311303206443012054 00000000000000%operation %virtual expression* optimize(expression *this) %{ #include #ifndef MINFLOAT #define MINFLOAT 0.0000001 #endif // this is taken from http://en.wikipedia.org/wiki/Dice // calculates the probability for value "pos" in the sum of "num" // dice with "sides" faces double Fsumdice(double *cache, int mnum, int num, int sides, int pos) { if (pos > ((num*sides-num)/2)+num) { pos = num*sides - pos + num; } if (num == 1) { if ((pos < 1) || (pos > sides)) { return 0.0; } return 1.0/sides; } else { if (pos < num) { return 0.0; } int i; if (cache[mnum*(pos-num)+num] < -0.5) { double ret = 0; for (i = 1; i < min(pos, sides+1); i++) { ret += Fsumdice(cache, mnum, 1, sides, i) * Fsumdice(cache, mnum, num-1, sides, pos-i); } cache[mnum*(pos-num)+num] = ret; return ret; } return cache[mnum*(pos-num)+num]; } } // calculates the probability that the sum of "num" rolls of // distribution "dist" have the value "pos" double Fsumany(double *cache, int mnum, int minval, int maxval, int num, struct val_list *dist, int pos) { struct val_list *cdist = dist; if (num == 1) { while (cdist) { if (cdist->values[0] == pos) { return cdist->prob; } cdist = cdist->next; } return 0.0; } else { int cpos = pos*mnum+num; if ((pos < minval * num) || (pos > maxval * pos)) { return 0.0; } if (cache[cpos] < -0.5) { double ret = 0.0; while (cdist) { ret += cdist->prob * Fsumany(cache, mnum, minval, maxval, num - 1, dist, pos - cdist->values[0]); cdist = cdist->next; } cache[cpos] = ret; return ret; } return cache[cpos]; } } %} // optimized version of sum N#dM %node sumrepdice expression = { struct val_list *num_dice; int num_sides; } roll(sumrepdice) { // unsupported, only used in eval } printtree(sumrepdice) { // unsupported, only used in eval } set_symtab(sumrepdice) { // not needed, don't use symtab } eval(sumrepdice) { int n; struct val_list *ret = NULL; struct val_list *cnum = this->num_dice; while (cnum) { if (cnum->count != 1) { yyerror("Argument 1 to sumrep operator is not scalar"); list_free(this->num_dice); list_free(ret); return error_val(); } int num_dice_val = cnum->values[0]; if (num_dice_val > 0) { int expected = num_dice_val* ((num_dice_val*this->num_sides-num_dice_val)/2) +num_dice_val+1; double *cache = malloc(sizeof(double) * expected); for (n = 0; n < expected; n++) { cache[n] = -1.0; } for (n = num_dice_val * this->num_sides; n >= num_dice_val; n--) { struct val_list *cret = (struct val_list*)malloc(sizeof(struct val_list)); cret->next = NULL; cret->count = 1; cret->prob = Fsumdice(cache, num_dice_val, num_dice_val, this->num_sides, n) * cnum->prob; cret->values = (int*)malloc(sizeof(int)); cret->values[0] = n; list_add(&ret, cret, this->ordering); } free(cache); } cnum = cnum->next; } if (ret == NULL) { return list_new(1, 1.0); } return ret; } %node sumrepany expression = { struct val_list *number; struct val_list *data; } roll(sumrepany) { // unsupported, only used in eval } printtree(sumrepany) { // unsupported, only used in eval } set_symtab(sumrepany) { // not needed, don't use symtab } eval(sumrepany) { int n; struct val_list *ret = NULL; struct val_list *cnum = this->number; int minval = -1; int maxval = 0; struct val_list *cval = this->data; while (cval) { if ((minval == -1) || (cval->values[0] < minval)) { minval = cval->values[0]; } if (cval->values[0] > maxval) { maxval = cval->values[0]; } cval = cval->next; } while (cnum) { if (cnum->count != 1) { yyerror("Argument 1 to sumrep operator is not scalar"); list_free(this->number); list_free(this->data); list_free(ret); return error_val(); } if (cnum->values[0] == 0) { struct val_list *cret = (struct val_list*)malloc(sizeof(struct val_list)); cret->next = NULL; cret->count = 1; cret->prob = cnum->prob; cret->values = (int*)malloc(sizeof(int)); cret->values[0] = 0; list_add(&ret, cret, this->ordering); } else { int expected = (cnum->values[0] * maxval + 1) * cnum->values[0] + 1; double *cache = malloc(sizeof(double) * expected); for (n = 0; n < expected; n++) { cache[n] = -1.0; } for (n = cnum->values[0] * minval; n <= cnum->values[0] * maxval; n++) { struct val_list *cret = (struct val_list*)malloc(sizeof(struct val_list)); cret->next = NULL; cret->count = 1; cret->prob = Fsumany(cache, cnum->values[0], minval, maxval, cnum->values[0], this->data, n) * cnum->prob; cret->values = (int*)malloc(sizeof(int)); cret->values[0] = n; if (cret->prob > MINFLOAT) { list_add(&ret, cret, this->ordering); } else { list_free(cret); } } free(cache); } cnum = cnum->next; } if (ret == NULL) { return list_new(1, 1.0); } return ret; } // optimization fuctions, replaces the tree with a different version optimize(expression) { return this; } optimize(binary) { this->expr1 = optimize(this->expr1); this->expr2 = optimize(this->expr2); return (expression*)this; } optimize(unary) { this->expr = optimize(this->expr); return (expression*)this; } optimize(ifthenelse) { this->if_expr = optimize(this->if_expr); this->then_expr = optimize(this->then_expr); this->else_expr = optimize(this->else_expr); return (expression*)this; } optimize(sum) { if (yykind(this->expr) == rep_kind) { rep *crep = (rep*)this->expr; if (yykind(crep->expr2) == dice_kind) { dice *cdice = (dice*)crep->expr2; if (yykind(cdice->expr) == number_kind) { // case: sum N#dM expression *replace = sumrepdice_create( eval(crep->expr1), ((number*)cdice->expr)->num); return replace; } } else { // case: sum N#XXX expression *replace = sumrepany_create( eval(crep->expr1), eval(sum_create(crep->expr2))); return replace; } } return (expression*)this; }