1 # Ocean Interpreter - Stoney Creek version
3 Ocean is intended to be a compiled language, so this interpreter is
4 not targeted at being the final product. It is, rather, an intermediate
5 stage and fills that role in two distinct ways.
7 Firstly, it exists as a platform to experiment with the early language
8 design. An interpreter is easy to write and easy to get working, so
9 the barrier for entry is lower if I aim to start with an interpreter.
11 Secondly, the plan for the Ocean compiler is to write it in the
12 [Ocean language](http://ocean-lang.org). To achieve this we naturally
13 need some sort of boot-strap process and this interpreter - written in
14 portable C - will fill that role. It will be used to bootstrap the
17 Two features that are not needed to fill either of these roles are
18 performance and completeness. The interpreter only needs to be fast
19 enough to run small test programs and occasionally to run the compiler
20 on itself. It only needs to be complete enough to test aspects of the
21 design which are developed before the compiler is working, and to run
22 the compiler on itself. Any features not used by the compiler when
23 compiling itself are superfluous. They may be included anyway, but
26 Nonetheless, the interpreter should end up being reasonably complete,
27 and any performance bottlenecks which appear and are easily fixed, will
32 This second version of the interpreter exists to test out the
33 structured statement providing conditions and iteration, and simple
34 variable scoping. Clearly we need some minimal other functionality so
35 that values can be tested and instructions iterated over. All that
36 functionality is clearly not normative at this stage (not that
37 anything is **really** normative yet) and will change, so early test
38 code will certainly break in later versions.
40 The under-test parts of the language are:
42 - conditional/looping structured statements
43 - the `use` statement which is needed for that
44 - Variable binding using ":=" and "::=", and assignment using "=".
46 Elements which are present to make a usable language are:
48 - "blocks" of multiple statements.
49 - `pass`: a statement which does nothing.
50 - expressions: `+`, `-`, `*`, `/`, `%` can apply to numbers and `++` can
51 catenate strings. `and`, `or`, `not` manipulate Booleans, and
52 normal comparison operators can work on all three types.
53 - `print`: will print the values in a list of expressions.
54 - `program`: is given a list of identifiers to initialize from
59 Versions of the interpreter which obviously do not support a complete
60 language will be named after creeks and streams. This one is Stoney
63 Once we have something reasonably resembling a complete language, the
64 names of rivers will be used.
65 Early versions of the compiler will be named after seas. Major
66 releases of the compiler will be named after oceans. Hopefully I will
67 be finished once I get to the Pacific Ocean release.
71 As well as parsing and executing a program, the interpreter can print
72 out the program from the parsed internal structure. This is useful
73 for validating the parsing.
74 So the main requirements of the interpreter are:
76 - Parse the program, possibly with tracing,
77 - Analyse the parsed program to ensure consistency,
79 - Execute the program.
81 This is all performed by a single C program extracted with
84 There will be two formats for printing the program: a default and one
85 that uses bracketing. So a `--bracket` command line option is needed
86 for that. Normally the first code section found is used, however an
87 alternate section can be requested so that a file (such as this one)
88 can contain multiple programs This is effected with the `--section`
91 This code must be compiled with `-fplan9-extensions` so that anonymous
92 structures can be used.
94 ###### File: oceani.mk
96 myCFLAGS := -Wall -g -fplan9-extensions
97 CFLAGS := $(filter-out $(myCFLAGS),$(CFLAGS)) $(myCFLAGS)
98 myLDLIBS:= libparser.o libscanner.o libmdcode.o -licuuc
99 LDLIBS := $(filter-out $(myLDLIBS),$(LDLIBS)) $(myLDLIBS)
101 all :: $(LDLIBS) oceani
102 oceani.c oceani.h : oceani.mdc parsergen
103 ./parsergen -o oceani --LALR --tag Parser oceani.mdc
104 oceani.mk: oceani.mdc md2c
107 oceani: oceani.o $(LDLIBS)
108 $(CC) $(CFLAGS) -o oceani oceani.o $(LDLIBS)
110 ###### Parser: header
113 struct parse_context {
114 struct token_config config;
122 #define container_of(ptr, type, member) ({ \
123 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
124 (type *)( (char *)__mptr - offsetof(type,member) );})
126 #define config2context(_conf) container_of(_conf, struct parse_context, \
135 #include <sys/mman.h>
154 static char Usage[] = "Usage: oceani --trace --print --noexec --brackets"
155 "--section=SectionName prog.ocn\n";
156 static const struct option long_options[] = {
157 {"trace", 0, NULL, 't'},
158 {"print", 0, NULL, 'p'},
159 {"noexec", 0, NULL, 'n'},
160 {"brackets", 0, NULL, 'b'},
161 {"section", 1, NULL, 's'},
164 const char *options = "tpnbs";
165 int main(int argc, char *argv[])
171 char *section = NULL;
172 struct parse_context context = {
174 .ignored = (1 << TK_line_comment)
175 | (1 << TK_block_comment),
176 .number_chars = ".,_+-",
181 int doprint=0, dotrace=0, doexec=1, brackets=0;
184 while ((opt = getopt_long(argc, argv, options, long_options, NULL))
187 case 't': dotrace=1; break;
188 case 'p': doprint=1; break;
189 case 'n': doexec=0; break;
190 case 'b': brackets=1; break;
191 case 's': section = optarg; break;
192 default: fprintf(stderr, Usage);
196 if (optind >= argc) {
197 fprintf(stderr, "oceani: no input file given\n");
200 fd = open(argv[optind], O_RDONLY);
202 fprintf(stderr, "oceani: cannot open %s\n", argv[optind]);
205 context.file_name = argv[optind];
206 len = lseek(fd, 0, 2);
207 file = mmap(NULL, len, PROT_READ, MAP_SHARED, fd, 0);
208 s = code_extract(file, file+len, NULL);
210 fprintf(stderr, "oceani: could not find any code in %s\n",
215 ## context initialization
219 for (ss = s; ss; ss = ss->next) {
220 struct text sec = ss->section;
221 if (sec.len == strlen(section) &&
222 strncmp(sec.txt, section, sec.len) == 0)
226 prog = parse_oceani(ss->code, &context.config,
227 dotrace ? stderr : NULL);
229 fprintf(stderr, "oceani: cannot find section %s\n",
234 prog = parse_oceani(s->code, &context.config,
235 dotrace ? stderr : NULL);
237 fprintf(stderr, "oceani: fatal parser error.\n");
238 context.parse_error = 1;
241 print_exec(*prog, 0, brackets);
242 if (prog && doexec && !context.parse_error) {
243 if (!analyse_prog(*prog, &context)) {
244 fprintf(stderr, "oceani: type error in program - not running.\n");
247 interp_prog(*prog, argv+optind+1);
254 struct section *t = s->next;
260 ## free context types
261 exit(context.parse_error ? 1 : 0);
266 The four requirements of parse, analyse, print, interpret apply to
267 each language element individually so that is how most of the code
270 Three of the four are fairly self explanatory. The one that requires
271 a little explanation is the analysis step.
273 The current language design does not require the types of variables to
274 be declared, but they must still have a single type. Different
275 operations impose different requirements on the variables, for example
276 addition requires both arguments to be numeric, and assignment
277 requires the variable on the left to have the same type as the
278 expression on the right.
280 Analysis involves propagating these type requirements around and
281 consequently setting the type of each variable. If any requirements
282 are violated (e.g. a string is compared with a number) or if a
283 variable needs to have two different types, then an error is raised
284 and the program will not run.
286 If the same variable is declared in both branchs of an 'if/else', or
287 in all cases of a 'switch' then the multiple instances may be merged
288 into just one variable if the variable is references after the
289 conditional statement. When this happens, the types must naturally be
290 consistent across all the branches. When the variable is not used
291 outside the if, the variables in the different branches are distinct
292 and can be of different types.
294 Determining the types of all variables early is important for
295 processing command line arguments. These can be assigned to any type
296 of variable, but we must first know the correct type so any required
297 conversion can happen. If a variable is associated with a command
298 line argument but no type can be interpreted (e.g. the variable is
299 only ever used in a `print` statement), then the type is set to
302 Undeclared names may only appear in "use" statements and "case" expressions.
303 These names are given a type of "label" and a unique value.
304 This allows them to fill the role of a name in an enumerated type, which
305 is useful for testing the `switch` statement.
307 As we will see, the condition part of a `while` statement can return
308 either a Boolean or some other type. This requires that the expect
309 type that gets passed around comprises a type (`enum vtype`) and a
310 flag to indicate that `Vbool` is also permitted.
312 As there are, as yet, no distinct types that are compatible, there
313 isn't much subtlety in the analysis. When we have distinct number
314 types, this will become more interesting.
318 When analysis discovers an inconsistency it needs to report an error;
319 just refusing to run the code ensures that the error doesn't cascade,
320 but by itself it isn't very useful. A clear understand of the sort of
321 error message that are useful will help guide the process of analysis.
323 At a simplistic level, the only sort of error that type analysis can
324 report is that the type of some construct doesn't match a contextual
325 requirement. For example, in `4 + "hello"` the addition provides a
326 contextual requirement for numbers, but `"hello"` is not a number. In
327 this particular example no further information is needed as the types
328 are obvious from local information. When a variable is involved that
329 isn't the case. It may be helpful to explain why the variable has a
330 particular type, by indicating the location where the type was set,
331 whether by declaration or usage.
333 Using a recursive-descent analysis we can easily detect a problem at
334 multiple locations. In "`hello:= "there"; 4 + hello`" the addition
335 will detect that one argument is not a number and the usage of `hello`
336 will detect that a number was wanted, but not provided. In this
337 (early) version of the language, we will generate error reports at
338 multiple locations, so the use of `hello` will report an error and
339 explain were the value was set, and the addition will report an error
340 and say why numbers are needed. To be able to report locations for
341 errors, each language element will need to record a file location
342 (line and column) and each variable will need to record the language
343 element where its type was set. For now we will assume that each line
344 of an error message indicates one location in the file, and up to 2
345 types. So we provide a `printf`-like function which takes a format, a
346 language (a `struct exec` which has not yet been introduced), and 2
347 types. "`%1`" reports the first type, "`%2`" reports the second. We
348 will need a function to print the location, once we know how that is
349 stored. As will be explained later, there are sometimes extra rules for
350 type matching and they might affect error messages, we need to pass those
353 As well as type errors, we sometimes need to report problems with
354 tokens, which might be unexpected or might name a type that has not
355 been defined. For these we have `tok_err()` which reports an error
356 with a given token. Each of the error functions sets the flag in the
357 context so indicate that parsing failed.
361 static void fput_loc(struct exec *loc, FILE *f);
363 ###### core functions
365 static void type_err(struct parse_context *c,
366 char *fmt, struct exec *loc,
367 struct type *t1, int rules, struct type *t2)
369 fprintf(stderr, "%s:", c->file_name);
370 fput_loc(loc, stderr);
371 for (; *fmt ; fmt++) {
378 case '%': fputc(*fmt, stderr); break;
379 default: fputc('?', stderr); break;
381 type_print(t1, stderr);
384 type_print(t2, stderr);
393 static void tok_err(struct parse_context *c, char *fmt, struct token *t)
395 fprintf(stderr, "%s:%d:%d: %s: %.*s\n", c->file_name, t->line, t->col, fmt,
396 t->txt.len, t->txt.txt);
402 One last introductory step before detailing the language elements and
403 providing their four requirements is to establish the data structures
404 to store these elements.
406 There are two key objects that we need to work with: executable
407 elements which comprise the program, and values which the program
408 works with. Between these are the variables in their various scopes
409 which hold the values, and types which classify the values stored and
410 manipulatd by executables.
414 Values come in a wide range of types, with more likely to be added.
415 Each type needs to be able to parse and print its own values (for
416 convenience at least) as well as to compare two values, at least for
417 equality and possibly for order. For now, values might need to be
418 duplicated and freed, though eventually such manipulations will be
419 better integrated into the language.
421 Rather than requiring every numeric type to support all numeric
422 operations (add, multiple, etc), we allow types to be able to present
423 as one of a few standard types: integer, float, and fraction. The
424 existance of these conversion functions enable types to determine if
425 they are compatible with other types.
427 Named type are stored in a simple linked list. Objects of each type are "values"
428 which are often passed around by value.
435 ## value union fields
442 struct value (*init)(struct type *type);
443 struct value (*prepare)(struct type *type);
444 struct value (*parse)(struct type *type, char *str);
445 void (*print)(struct value val);
446 void (*print_type)(struct type *type, FILE *f);
447 int (*cmp_order)(struct value v1, struct value v2);
448 int (*cmp_eq)(struct value v1, struct value v2);
449 struct value (*dup)(struct value val);
450 void (*free)(struct value val);
451 int (*compat)(struct type *this, struct type *other);
452 long long (*to_int)(struct value *v);
453 double (*to_float)(struct value *v);
454 int (*to_mpq)(mpq_t *q, struct value *v);
462 struct type *typelist;
466 static struct type *find_type(struct parse_context *c, struct text s)
468 struct type *l = c->typelist;
471 text_cmp(l->name, s) != 0)
476 static struct type *add_type(struct parse_context *c, struct text s,
481 n = calloc(1, sizeof(*n));
484 n->next = c->typelist;
489 static void free_type(struct type *t)
491 /* The type is always a reference to something in the
492 * context, so we don't need to free anything.
496 static void free_value(struct value v)
502 static int type_compat(struct type *require, struct type *have, int rules)
504 if ((rules & Rboolok) && have == Tbool)
506 if ((rules & Rnolabel) && have == Tlabel)
508 if (!require || !have)
512 return require->compat(require, have);
514 return require == have;
517 static void type_print(struct type *type, FILE *f)
520 fputs("*unknown*type*", f);
521 else if (type->name.len)
522 fprintf(f, "%.*s", type->name.len, type->name.txt);
523 else if (type->print_type)
524 type->print_type(type, f);
526 fputs("*invalid*type*", f);
529 static struct value val_prepare(struct type *type)
534 return type->prepare(type);
539 static struct value val_init(struct type *type)
544 return type->init(type);
549 static struct value dup_value(struct value v)
552 return v.type->dup(v);
556 static int value_cmp(struct value left, struct value right)
558 if (left.type && left.type->cmp_order)
559 return left.type->cmp_order(left, right);
560 if (left.type && left.type->cmp_eq)
561 return left.type->cmp_eq(left, right);
565 static void print_value(struct value v)
567 if (v.type && v.type->print)
573 static struct value parse_value(struct type *type, char *arg)
577 if (type && type->parse)
578 return type->parse(type, arg);
585 static void free_value(struct value v);
586 static int type_compat(struct type *require, struct type *have, int rules);
587 static void type_print(struct type *type, FILE *f);
588 static struct value val_init(struct type *type);
589 static struct value dup_value(struct value v);
590 static int value_cmp(struct value left, struct value right);
591 static void print_value(struct value v);
592 static struct value parse_value(struct type *type, char *arg);
594 ###### free context types
596 while (context.typelist) {
597 struct type *t = context.typelist;
599 context.typelist = t->next;
605 Values of the base types can be numbers, which we represent as
606 multi-precision fractions, strings, Booleans and labels. When
607 analysing the program we also need to allow for places where no value
608 is meaningful (type `Tnone`) and where we don't know what type to
609 expect yet (type is `NULL`).
611 Values are never shared, they are always copied when used, and freed
612 when no longer needed.
614 When propagating type information around the program, we need to
615 determine if two types are compatible, where type `NULL` is compatible
616 with anything. There are two special cases with type compatibility,
617 both related to the Conditional Statement which will be described
618 later. In some cases a Boolean can be accepted as well as some other
619 primary type, and in others any type is acceptable except a label (`Vlabel`).
620 A separate function encode these cases will simplify some code later.
622 When assigning command line arguments to variables, we need to be able
623 to parse each type from a string.
631 myLDLIBS := libnumber.o libstring.o -lgmp
632 LDLIBS := $(filter-out $(myLDLIBS),$(LDLIBS)) $(myLDLIBS)
634 ###### type union fields
635 enum vtype {Vnone, Vstr, Vnum, Vbool, Vlabel} vtype;
637 ###### value union fields
644 static void _free_value(struct value v)
646 switch (v.type->vtype) {
648 case Vstr: free(v.str.txt); break;
649 case Vnum: mpq_clear(v.num); break;
655 ###### value functions
657 static struct value _val_prepare(struct type *type)
662 switch(type->vtype) {
666 memset(&rv.num, 0, sizeof(rv.num));
682 static struct value _val_init(struct type *type)
687 switch(type->vtype) {
691 mpq_init(rv.num); break;
693 rv.str.txt = malloc(1);
706 static struct value _dup_value(struct value v)
710 switch (rv.type->vtype) {
721 mpq_set(rv.num, v.num);
724 rv.str.len = v.str.len;
725 rv.str.txt = malloc(rv.str.len);
726 memcpy(rv.str.txt, v.str.txt, v.str.len);
732 static int _value_cmp(struct value left, struct value right)
735 if (left.type != right.type)
736 return left.type - right.type;
737 switch (left.type->vtype) {
738 case Vlabel: cmp = left.label == right.label ? 0 : 1; break;
739 case Vnum: cmp = mpq_cmp(left.num, right.num); break;
740 case Vstr: cmp = text_cmp(left.str, right.str); break;
741 case Vbool: cmp = left.bool - right.bool; break;
747 static void _print_value(struct value v)
749 switch (v.type->vtype) {
751 printf("*no-value*"); break;
753 printf("*label-%p*", v.label); break;
755 printf("%.*s", v.str.len, v.str.txt); break;
757 printf("%s", v.bool ? "True":"False"); break;
762 mpf_set_q(fl, v.num);
763 gmp_printf("%Fg", fl);
770 static struct value _parse_value(struct type *type, char *arg)
778 switch(type->vtype) {
784 val.str.len = strlen(arg);
785 val.str.txt = malloc(val.str.len);
786 memcpy(val.str.txt, arg, val.str.len);
793 tx.txt = arg; tx.len = strlen(tx.txt);
794 if (number_parse(val.num, tail, tx) == 0)
797 mpq_neg(val.num, val.num);
799 printf("Unsupported suffix: %s\n", arg);
804 if (strcasecmp(arg, "true") == 0 ||
805 strcmp(arg, "1") == 0)
807 else if (strcasecmp(arg, "false") == 0 ||
808 strcmp(arg, "0") == 0)
811 printf("Bad bool: %s\n", arg);
819 static void _free_value(struct value v);
821 static struct type base_prototype = {
823 .prepare = _val_prepare,
824 .parse = _parse_value,
825 .print = _print_value,
826 .cmp_order = _value_cmp,
827 .cmp_eq = _value_cmp,
832 static struct type *Tbool, *Tstr, *Tnum, *Tnone, *Tlabel;
835 static struct type *add_base_type(struct parse_context *c, char *n, enum vtype vt)
837 struct text txt = { n, strlen(n) };
840 t = add_type(c, txt, &base_prototype);
845 ###### context initialization
847 Tbool = add_base_type(&context, "Boolean", Vbool);
848 Tstr = add_base_type(&context, "string", Vstr);
849 Tnum = add_base_type(&context, "number", Vnum);
850 Tnone = add_base_type(&context, "none", Vnone);
851 Tlabel = add_base_type(&context, "label", Vlabel);
855 Variables are scoped named values. We store the names in a linked
856 list of "bindings" sorted lexically, and use sequential search and
863 struct binding *next; // in lexical order
867 This linked list is stored in the parse context so that "reduce"
868 functions can find or add variables, and so the analysis phase can
869 ensure that every variable gets a type.
873 struct binding *varlist; // In lexical order
877 static struct binding *find_binding(struct parse_context *c, struct text s)
879 struct binding **l = &c->varlist;
884 (cmp = text_cmp((*l)->name, s)) < 0)
888 n = calloc(1, sizeof(*n));
895 Each name can be linked to multiple variables defined in different
896 scopes. Each scope starts where the name is declared and continues
897 until the end of the containing code block. Scopes of a given name
898 cannot nest, so a declaration while a name is in-scope is an error.
900 ###### binding fields
901 struct variable *var;
905 struct variable *previous;
907 struct binding *name;
908 struct exec *where_decl;// where name was declared
909 struct exec *where_set; // where type was set
913 While the naming seems strange, we include local constants in the
914 definition of variables. A name declared `var := value` can
915 subsequently be changed, but a name declared `var ::= value` cannot -
918 ###### variable fields
921 Scopes in parallel branches can be partially merged. More
922 specifically, if a given name is declared in both branches of an
923 if/else then its scope is a candidate for merging. Similarly if
924 every branch of an exhaustive switch (e.g. has an "else" clause)
925 declares a given name, then the scopes from the branches are
926 candidates for merging.
928 Note that names declared inside a loop (which is only parallel to
929 itself) are never visible after the loop. Similarly names defined in
930 scopes which are not parallel, such as those started by `for` and
931 `switch`, are never visible after the scope. Only variables defined in
932 both `then` and `else` (including the implicit then after an `if`, and
933 excluding `then` used with `for`) and in all `case`s and `else` of a
934 `switch` or `while` can be visible beyond the `if`/`switch`/`while`.
936 Labels, which are a bit like variables, follow different rules.
937 Labels are not explicitly declared, but if an undeclared name appears
938 in a context where a label is legal, that effectively declares the
939 name as a label. The declaration remains in force (or in scope) at
940 least to the end of the immediately containing block and conditionally
941 in any larger containing block which does not declare the name in some
942 other way. Importantly, the conditional scope extension happens even
943 if the label is only used in one parallel branch of a conditional --
944 when used in one branch it is treated as having been declared in all
947 Merge candidates are tentatively visible beyond the end of the
948 branching statement which creates them. If the name is used, the
949 merge is affirmed and they become a single variable visible at the
950 outer layer. If not - if it is redeclared first - the merge lapses.
952 To track scopes we have an extra stack, implemented as a linked list,
953 which roughly parallels the parse stack and which is used exclusively
954 for scoping. When a new scope is opened, a new frame is pushed and
955 the child-count of the parent frame is incremented. This child-count
956 is used to distinguish between the first of a set of parallel scopes,
957 in which declared variables must not be in scope, and subsequent
958 branches, whether they must already be conditionally scoped.
960 To push a new frame *before* any code in the frame is parsed, we need a
961 grammar reduction. This is most easily achieved with a grammar
962 element which derives the empty string, and creates the new scope when
963 it is recognized. This can be placed, for example, between a keyword
964 like "if" and the code following it.
968 struct scope *parent;
974 struct scope *scope_stack;
977 static void scope_pop(struct parse_context *c)
979 struct scope *s = c->scope_stack;
981 c->scope_stack = s->parent;
986 static void scope_push(struct parse_context *c)
988 struct scope *s = calloc(1, sizeof(*s));
990 c->scope_stack->child_count += 1;
991 s->parent = c->scope_stack;
999 OpenScope -> ${ scope_push(config2context(config)); }$
1002 Each variable records a scope depth and is in one of four states:
1004 - "in scope". This is the case between the declaration of the
1005 variable and the end of the containing block, and also between
1006 the usage with affirms a merge and the end of that block.
1008 The scope depth is not greater than the current parse context scope
1009 nest depth. When the block of that depth closes, the state will
1010 change. To achieve this, all "in scope" variables are linked
1011 together as a stack in nesting order.
1013 - "pending". The "in scope" block has closed, but other parallel
1014 scopes are still being processed. So far, every parallel block at
1015 the same level that has closed has declared the name.
1017 The scope depth is the depth of the last parallel block that
1018 enclosed the declaration, and that has closed.
1020 - "conditionally in scope". The "in scope" block and all parallel
1021 scopes have closed, and no further mention of the name has been
1022 seen. This state includes a secondary nest depth which records the
1023 outermost scope seen since the variable became conditionally in
1024 scope. If a use of the name is found, the variable becomes "in
1025 scope" and that secondary depth becomes the recorded scope depth.
1026 If the name is declared as a new variable, the old variable becomes
1027 "out of scope" and the recorded scope depth stays unchanged.
1029 - "out of scope". The variable is neither in scope nor conditionally
1030 in scope. It is permanently out of scope now and can be removed from
1031 the "in scope" stack.
1034 ###### variable fields
1035 int depth, min_depth;
1036 enum { OutScope, PendingScope, CondScope, InScope } scope;
1037 struct variable *in_scope;
1039 ###### parse context
1041 struct variable *in_scope;
1043 All variables with the same name are linked together using the
1044 'previous' link. Those variable that have
1045 been affirmatively merged all have a 'merged' pointer that points to
1046 one primary variable - the most recently declared instance. When
1047 merging variables, we need to also adjust the 'merged' pointer on any
1048 other variables that had previously been merged with the one that will
1049 no longer be primary.
1051 ###### variable fields
1052 struct variable *merged;
1054 ###### ast functions
1056 static void variable_merge(struct variable *primary, struct variable *secondary)
1060 if (primary->merged)
1062 primary = primary->merged;
1064 for (v = primary->previous; v; v=v->previous)
1065 if (v == secondary || v == secondary->merged ||
1066 v->merged == secondary ||
1067 (v->merged && v->merged == secondary->merged)) {
1068 v->scope = OutScope;
1069 v->merged = primary;
1073 ###### free context vars
1075 while (context.varlist) {
1076 struct binding *b = context.varlist;
1077 struct variable *v = b->var;
1078 context.varlist = b->next;
1081 struct variable *t = v;
1089 #### Manipulating Bindings
1091 When a name is conditionally visible, a new declaration discards the
1092 old binding - the condition lapses. Conversely a usage of the name
1093 affirms the visibility and extends it to the end of the containing
1094 block - i.e. the block that contains both the original declaration and
1095 the latest usage. This is determined from `min_depth`. When a
1096 conditionally visible variable gets affirmed like this, it is also
1097 merged with other conditionally visible variables with the same name.
1099 When we parse a variable declaration we either signal an error if the
1100 name is currently bound, or create a new variable at the current nest
1101 depth if the name is unbound or bound to a conditionally scoped or
1102 pending-scope variable. If the previous variable was conditionally
1103 scoped, it and its homonyms becomes out-of-scope.
1105 When we parse a variable reference (including non-declarative
1106 assignment) we signal an error if the name is not bound or is bound to
1107 a pending-scope variable; update the scope if the name is bound to a
1108 conditionally scoped variable; or just proceed normally if the named
1109 variable is in scope.
1111 When we exit a scope, any variables bound at this level are either
1112 marked out of scope or pending-scoped, depending on whether the
1113 scope was sequential or parallel.
1115 When exiting a parallel scope we check if there are any variables that
1116 were previously pending and are still visible. If there are, then
1117 there weren't redeclared in the most recent scope, so they cannot be
1118 merged and must become out-of-scope. If it is not the first of
1119 parallel scopes (based on `child_count`), we check that there was a
1120 previous binding that is still pending-scope. If there isn't, the new
1121 variable must now be out-of-scope.
1123 When exiting a sequential scope that immediately enclosed parallel
1124 scopes, we need to resolve any pending-scope variables. If there was
1125 no `else` clause, and we cannot determine that the `switch` was exhaustive,
1126 we need to mark all pending-scope variable as out-of-scope. Otherwise
1127 all pending-scope variables become conditionally scoped.
1130 enum closetype { CloseSequential, CloseParallel, CloseElse };
1132 ###### ast functions
1134 static struct variable *var_decl(struct parse_context *c, struct text s)
1136 struct binding *b = find_binding(c, s);
1137 struct variable *v = b->var;
1139 switch (v ? v->scope : OutScope) {
1141 /* Caller will report the error */
1145 v && v->scope == CondScope;
1147 v->scope = OutScope;
1151 v = calloc(1, sizeof(*v));
1152 v->previous = b->var;
1155 v->min_depth = v->depth = c->scope_depth;
1157 v->in_scope = c->in_scope;
1159 v->val = val_prepare(NULL);
1163 static struct variable *var_ref(struct parse_context *c, struct text s)
1165 struct binding *b = find_binding(c, s);
1166 struct variable *v = b->var;
1167 struct variable *v2;
1169 switch (v ? v->scope : OutScope) {
1172 /* Signal an error - once that is possible */
1175 /* All CondScope variables of this name need to be merged
1176 * and become InScope
1178 v->depth = v->min_depth;
1180 for (v2 = v->previous;
1181 v2 && v2->scope == CondScope;
1183 variable_merge(v, v2);
1191 static void var_block_close(struct parse_context *c, enum closetype ct)
1193 /* close of all variables that are in_scope */
1194 struct variable *v, **vp, *v2;
1197 for (vp = &c->in_scope;
1198 v = *vp, v && v->depth > c->scope_depth && v->min_depth > c->scope_depth;
1202 case CloseParallel: /* handle PendingScope */
1206 if (c->scope_stack->child_count == 1)
1207 v->scope = PendingScope;
1208 else if (v->previous &&
1209 v->previous->scope == PendingScope)
1210 v->scope = PendingScope;
1211 else if (v->val.type == Tlabel)
1212 v->scope = PendingScope;
1213 else if (v->name->var == v)
1214 v->scope = OutScope;
1215 if (ct == CloseElse) {
1216 /* All Pending variables with this name
1217 * are now Conditional */
1219 v2 && v2->scope == PendingScope;
1221 v2->scope = CondScope;
1226 v2 && v2->scope == PendingScope;
1228 if (v2->val.type != Tlabel)
1229 v2->scope = OutScope;
1231 case OutScope: break;
1234 case CloseSequential:
1235 if (v->val.type == Tlabel)
1236 v->scope = PendingScope;
1239 v->scope = OutScope;
1242 /* There was no 'else', so we can only become
1243 * conditional if we know the cases were exhaustive,
1244 * and that doesn't mean anything yet.
1245 * So only labels become conditional..
1248 v2 && v2->scope == PendingScope;
1250 if (v2->val.type == Tlabel) {
1251 v2->scope = CondScope;
1252 v2->min_depth = c->scope_depth;
1254 v2->scope = OutScope;
1257 case OutScope: break;
1261 if (v->scope == OutScope)
1270 Executables can be lots of different things. In many cases an
1271 executable is just an operation combined with one or two other
1272 executables. This allows for expressions and lists etc. Other times
1273 an executable is something quite specific like a constant or variable
1274 name. So we define a `struct exec` to be a general executable with a
1275 type, and a `struct binode` which is a subclass of `exec`, forms a
1276 node in a binary tree, and holds an operation. There will be other
1277 subclasses, and to access these we need to be able to `cast` the
1278 `exec` into the various other types.
1281 #define cast(structname, pointer) ({ \
1282 const typeof( ((struct structname *)0)->type) *__mptr = &(pointer)->type; \
1283 if (__mptr && *__mptr != X##structname) abort(); \
1284 (struct structname *)( (char *)__mptr);})
1286 #define new(structname) ({ \
1287 struct structname *__ptr = ((struct structname *)calloc(1,sizeof(struct structname))); \
1288 __ptr->type = X##structname; \
1289 __ptr->line = -1; __ptr->column = -1; \
1292 #define new_pos(structname, token) ({ \
1293 struct structname *__ptr = ((struct structname *)calloc(1,sizeof(struct structname))); \
1294 __ptr->type = X##structname; \
1295 __ptr->line = token.line; __ptr->column = token.col; \
1304 enum exec_types type;
1312 struct exec *left, *right;
1315 ###### ast functions
1317 static int __fput_loc(struct exec *loc, FILE *f)
1321 if (loc->line >= 0) {
1322 fprintf(f, "%d:%d: ", loc->line, loc->column);
1325 if (loc->type == Xbinode)
1326 return __fput_loc(cast(binode,loc)->left, f) ||
1327 __fput_loc(cast(binode,loc)->right, f);
1330 static void fput_loc(struct exec *loc, FILE *f)
1332 if (!__fput_loc(loc, f))
1333 fprintf(f, "??:??: ");
1336 Each different type of `exec` node needs a number of functions
1337 defined, a bit like methods. We must be able to be able to free it,
1338 print it, analyse it and execute it. Once we have specific `exec`
1339 types we will need to parse them too. Let's take this a bit more
1344 The parser generator requires a `free_foo` function for each struct
1345 that stores attributes and they will be `exec`s and subtypes there-of.
1346 So we need `free_exec` which can handle all the subtypes, and we need
1349 ###### ast functions
1351 static void free_binode(struct binode *b)
1356 free_exec(b->right);
1360 ###### core functions
1361 static void free_exec(struct exec *e)
1370 ###### forward decls
1372 static void free_exec(struct exec *e);
1374 ###### free exec cases
1375 case Xbinode: free_binode(cast(binode, e)); break;
1379 Printing an `exec` requires that we know the current indent level for
1380 printing line-oriented components. As will become clear later, we
1381 also want to know what sort of bracketing to use.
1383 ###### ast functions
1385 static void do_indent(int i, char *str)
1392 ###### core functions
1393 static void print_binode(struct binode *b, int indent, int bracket)
1397 ## print binode cases
1401 static void print_exec(struct exec *e, int indent, int bracket)
1407 print_binode(cast(binode, e), indent, bracket); break;
1412 ###### forward decls
1414 static void print_exec(struct exec *e, int indent, int bracket);
1418 As discussed, analysis involves propagating type requirements around
1419 the program and looking for errors.
1421 So `propagate_types` is passed an expected type (being a `struct type`
1422 pointer together with some `val_rules` flags) that the `exec` is
1423 expected to return, and returns the type that it does return, either
1424 of which can be `NULL` signifying "unknown". An `ok` flag is passed
1425 by reference. It is set to `0` when an error is found, and `2` when
1426 any change is made. If it remains unchanged at `1`, then no more
1427 propagation is needed.
1431 enum val_rules {Rnolabel = 1<<0, Rboolok = 1<<1, Rnoconstant = 2<<1};
1435 if (rules & Rnolabel)
1436 fputs(" (labels not permitted)", stderr);
1439 ###### core functions
1441 static struct type *propagate_types(struct exec *prog, struct parse_context *c, int *ok,
1442 struct type *type, int rules)
1449 switch (prog->type) {
1452 struct binode *b = cast(binode, prog);
1454 ## propagate binode cases
1458 ## propagate exec cases
1465 Interpreting an `exec` doesn't require anything but the `exec`. State
1466 is stored in variables and each variable will be directly linked from
1467 within the `exec` tree. The exception to this is the whole `program`
1468 which needs to look at command line arguments. The `program` will be
1469 interpreted separately.
1471 Each `exec` can return a value, which may be `Tnone` but must be non-NULL;
1473 ###### core functions
1476 struct value val, *lval;
1479 static struct lrval _interp_exec(struct exec *e);
1481 static struct value interp_exec(struct exec *e)
1483 struct lrval ret = _interp_exec(e);
1486 return dup_value(*ret.lval);
1491 static struct value *linterp_exec(struct exec *e)
1493 struct lrval ret = _interp_exec(e);
1498 static struct lrval _interp_exec(struct exec *e)
1501 struct value rv, *lrv = NULL;
1512 struct binode *b = cast(binode, e);
1513 struct value left, right, *lleft;
1514 left.type = right.type = Tnone;
1516 ## interp binode cases
1518 free_value(left); free_value(right);
1521 ## interp exec cases
1528 ## Language elements
1530 Each language element needs to be parsed, printed, analysed,
1531 interpreted, and freed. There are several, so let's just start with
1532 the easy ones and work our way up.
1536 We have already met values as separate objects. When manifest
1537 constants appear in the program text, that must result in an executable
1538 which has a constant value. So the `val` structure embeds a value in
1554 $0 = new_pos(val, $1);
1555 $0->val.type = Tbool;
1559 $0 = new_pos(val, $1);
1560 $0->val.type = Tbool;
1564 $0 = new_pos(val, $1);
1565 $0->val.type = Tnum;
1568 if (number_parse($0->val.num, tail, $1.txt) == 0)
1569 mpq_init($0->val.num);
1571 tok_err(config2context(config), "error: unsupported number suffix",
1576 $0 = new_pos(val, $1);
1577 $0->val.type = Tstr;
1580 string_parse(&$1, '\\', &$0->val.str, tail);
1582 tok_err(config2context(config), "error: unsupported string suffix",
1587 $0 = new_pos(val, $1);
1588 $0->val.type = Tstr;
1591 string_parse(&$1, '\\', &$0->val.str, tail);
1593 tok_err(config2context(config), "error: unsupported string suffix",
1598 ###### print exec cases
1601 struct val *v = cast(val, e);
1602 if (v->val.type == Tstr)
1604 print_value(v->val);
1605 if (v->val.type == Tstr)
1610 ###### propagate exec cases
1613 struct val *val = cast(val, prog);
1614 if (!type_compat(type, val->val.type, rules)) {
1615 type_err(c, "error: expected %1%r found %2",
1616 prog, type, rules, val->val.type);
1619 return val->val.type;
1622 ###### interp exec cases
1624 rv = dup_value(cast(val, e)->val);
1627 ###### ast functions
1628 static void free_val(struct val *v)
1636 ###### free exec cases
1637 case Xval: free_val(cast(val, e)); break;
1639 ###### ast functions
1640 // Move all nodes from 'b' to 'rv', reversing the order.
1641 // In 'b' 'left' is a list, and 'right' is the last node.
1642 // In 'rv', left' is the first node and 'right' is a list.
1643 static struct binode *reorder_bilist(struct binode *b)
1645 struct binode *rv = NULL;
1648 struct exec *t = b->right;
1652 b = cast(binode, b->left);
1662 Just as we used a `val` to wrap a value into an `exec`, we similarly
1663 need a `var` to wrap a `variable` into an exec. While each `val`
1664 contained a copy of the value, each `var` hold a link to the variable
1665 because it really is the same variable no matter where it appears.
1666 When a variable is used, we need to remember to follow the `->merged`
1667 link to find the primary instance.
1675 struct variable *var;
1681 VariableDecl -> IDENTIFIER : ${ {
1682 struct variable *v = var_decl(config2context(config), $1.txt);
1683 $0 = new_pos(var, $1);
1688 v = var_ref(config2context(config), $1.txt);
1690 type_err(config2context(config), "error: variable '%v' redeclared",
1691 $0, Tnone, 0, Tnone);
1692 type_err(config2context(config), "info: this is where '%v' was first declared",
1693 v->where_decl, Tnone, 0, Tnone);
1696 | IDENTIFIER :: ${ {
1697 struct variable *v = var_decl(config2context(config), $1.txt);
1698 $0 = new_pos(var, $1);
1704 v = var_ref(config2context(config), $1.txt);
1706 type_err(config2context(config), "error: variable '%v' redeclared",
1707 $0, Tnone, 0, Tnone);
1708 type_err(config2context(config), "info: this is where '%v' was first declared",
1709 v->where_decl, Tnone, 0, Tnone);
1712 | IDENTIFIER : Type ${ {
1713 struct variable *v = var_decl(config2context(config), $1.txt);
1714 $0 = new_pos(var, $1);
1719 v->val = val_prepare($<3);
1721 v = var_ref(config2context(config), $1.txt);
1723 type_err(config2context(config), "error: variable '%v' redeclared",
1724 $0, Tnone, 0, Tnone);
1725 type_err(config2context(config), "info: this is where '%v' was first declared",
1726 v->where_decl, Tnone, 0, Tnone);
1729 | IDENTIFIER :: Type ${ {
1730 struct variable *v = var_decl(config2context(config), $1.txt);
1731 $0 = new_pos(var, $1);
1736 v->val = val_prepare($<3);
1739 v = var_ref(config2context(config), $1.txt);
1741 type_err(config2context(config), "error: variable '%v' redeclared",
1742 $0, Tnone, 0, Tnone);
1743 type_err(config2context(config), "info: this is where '%v' was first declared",
1744 v->where_decl, Tnone, 0, Tnone);
1749 Variable -> IDENTIFIER ${ {
1750 struct variable *v = var_ref(config2context(config), $1.txt);
1751 $0 = new_pos(var, $1);
1753 /* This might be a label - allocate a var just in case */
1754 v = var_decl(config2context(config), $1.txt);
1756 v->val = val_prepare(Tlabel);
1757 v->val.label = &v->val;
1761 cast(var, $0)->var = v;
1766 Type -> IDENTIFIER ${
1767 $0 = find_type(config2context(config), $1.txt);
1769 tok_err(config2context(config),
1770 "error: undefined type", &$1);
1777 ###### print exec cases
1780 struct var *v = cast(var, e);
1782 struct binding *b = v->var->name;
1783 printf("%.*s", b->name.len, b->name.txt);
1790 if (loc->type == Xvar) {
1791 struct var *v = cast(var, loc);
1793 struct binding *b = v->var->name;
1794 fprintf(stderr, "%.*s", b->name.len, b->name.txt);
1796 fputs("???", stderr);
1798 fputs("NOTVAR", stderr);
1801 ###### propagate exec cases
1805 struct var *var = cast(var, prog);
1806 struct variable *v = var->var;
1808 type_err(c, "%d:BUG: no variable!!", prog, Tnone, 0, Tnone);
1814 if (v->constant && (rules & Rnoconstant)) {
1815 type_err(c, "error: Cannot assign to a constant: %v",
1816 prog, NULL, 0, NULL);
1817 type_err(c, "info: name was defined as a constant here",
1818 v->where_decl, NULL, 0, NULL);
1822 if (v->val.type == NULL) {
1823 if (type && *ok != 0) {
1824 v->val = val_prepare(type);
1825 v->where_set = prog;
1830 if (!type_compat(type, v->val.type, rules)) {
1831 type_err(c, "error: expected %1%r but variable '%v' is %2", prog,
1832 type, rules, v->val.type);
1833 type_err(c, "info: this is where '%v' was set to %1", v->where_set,
1834 v->val.type, rules, Tnone);
1842 ###### interp exec cases
1845 struct var *var = cast(var, e);
1846 struct variable *v = var->var;
1854 ###### ast functions
1856 static void free_var(struct var *v)
1861 ###### free exec cases
1862 case Xvar: free_var(cast(var, e)); break;
1864 ### Expressions: Boolean
1866 Our first user of the `binode` will be expressions, and particularly
1867 Boolean expressions. As I haven't implemented precedence in the
1868 parser generator yet, we need different names for each precedence
1869 level used by expressions. The outer most or lowest level precedence
1870 are Boolean operators which form an `Expression` out of `BTerm`s and
1871 `BFact`s. As well as `or` `and`, and `not` we have `and then` and `or
1872 else` which only evaluate the second operand if the result would make
1885 Expression -> Expression or BTerm ${ {
1886 struct binode *b = new(binode);
1892 | Expression or else BTerm ${ {
1893 struct binode *b = new(binode);
1899 | BTerm ${ $0 = $<1; }$
1901 BTerm -> BTerm and BFact ${ {
1902 struct binode *b = new(binode);
1908 | BTerm and then BFact ${ {
1909 struct binode *b = new(binode);
1915 | BFact ${ $0 = $<1; }$
1917 BFact -> not BFact ${ {
1918 struct binode *b = new(binode);
1925 ###### print binode cases
1927 print_exec(b->left, -1, 0);
1929 print_exec(b->right, -1, 0);
1932 print_exec(b->left, -1, 0);
1933 printf(" and then ");
1934 print_exec(b->right, -1, 0);
1937 print_exec(b->left, -1, 0);
1939 print_exec(b->right, -1, 0);
1942 print_exec(b->left, -1, 0);
1943 printf(" or else ");
1944 print_exec(b->right, -1, 0);
1948 print_exec(b->right, -1, 0);
1951 ###### propagate binode cases
1957 /* both must be Tbool, result is Tbool */
1958 propagate_types(b->left, c, ok, Tbool, 0);
1959 propagate_types(b->right, c, ok, Tbool, 0);
1960 if (type && type != Tbool) {
1961 type_err(c, "error: %1 operation found where %2 expected", prog,
1967 ###### interp binode cases
1969 rv = interp_exec(b->left);
1970 right = interp_exec(b->right);
1971 rv.bool = rv.bool && right.bool;
1974 rv = interp_exec(b->left);
1976 rv = interp_exec(b->right);
1979 rv = interp_exec(b->left);
1980 right = interp_exec(b->right);
1981 rv.bool = rv.bool || right.bool;
1984 rv = interp_exec(b->left);
1986 rv = interp_exec(b->right);
1989 rv = interp_exec(b->right);
1993 ### Expressions: Comparison
1995 Of slightly higher precedence that Boolean expressions are
1997 A comparison takes arguments of any type, but the two types must be
2000 To simplify the parsing we introduce an `eop` which can record an
2001 expression operator.
2008 ###### ast functions
2009 static void free_eop(struct eop *e)
2024 | Expr CMPop Expr ${ {
2025 struct binode *b = new(binode);
2031 | Expr ${ $0 = $<1; }$
2036 CMPop -> < ${ $0.op = Less; }$
2037 | > ${ $0.op = Gtr; }$
2038 | <= ${ $0.op = LessEq; }$
2039 | >= ${ $0.op = GtrEq; }$
2040 | == ${ $0.op = Eql; }$
2041 | != ${ $0.op = NEql; }$
2043 ###### print binode cases
2051 print_exec(b->left, -1, 0);
2053 case Less: printf(" < "); break;
2054 case LessEq: printf(" <= "); break;
2055 case Gtr: printf(" > "); break;
2056 case GtrEq: printf(" >= "); break;
2057 case Eql: printf(" == "); break;
2058 case NEql: printf(" != "); break;
2061 print_exec(b->right, -1, 0);
2064 ###### propagate binode cases
2071 /* Both must match but not be labels, result is Tbool */
2072 t = propagate_types(b->left, c, ok, NULL, Rnolabel);
2074 propagate_types(b->right, c, ok, t, 0);
2076 t = propagate_types(b->right, c, ok, NULL, Rnolabel);
2078 t = propagate_types(b->left, c, ok, t, 0);
2080 if (!type_compat(type, Tbool, 0)) {
2081 type_err(c, "error: Comparison returns %1 but %2 expected", prog,
2082 Tbool, rules, type);
2087 ###### interp binode cases
2096 left = interp_exec(b->left);
2097 right = interp_exec(b->right);
2098 cmp = value_cmp(left, right);
2101 case Less: rv.bool = cmp < 0; break;
2102 case LessEq: rv.bool = cmp <= 0; break;
2103 case Gtr: rv.bool = cmp > 0; break;
2104 case GtrEq: rv.bool = cmp >= 0; break;
2105 case Eql: rv.bool = cmp == 0; break;
2106 case NEql: rv.bool = cmp != 0; break;
2107 default: rv.bool = 0; break;
2112 ### Expressions: The rest
2114 The remaining expressions with the highest precedence are arithmetic
2115 and string concatenation. They are `Expr`, `Term`, and `Factor`.
2116 The `Factor` is where the `Value` and `Variable` that we already have
2119 `+` and `-` are both infix and prefix operations (where they are
2120 absolute value and negation). These have different operator names.
2122 We also have a 'Bracket' operator which records where parentheses were
2123 found. This makes it easy to reproduce these when printing. Once
2124 precedence is handled better I might be able to discard this.
2136 Expr -> Expr Eop Term ${ {
2137 struct binode *b = new(binode);
2143 | Term ${ $0 = $<1; }$
2145 Term -> Term Top Factor ${ {
2146 struct binode *b = new(binode);
2152 | Factor ${ $0 = $<1; }$
2154 Factor -> ( Expression ) ${ {
2155 struct binode *b = new_pos(binode, $1);
2161 struct binode *b = new(binode);
2166 | Value ${ $0 = $<1; }$
2167 | Variable ${ $0 = $<1; }$
2170 Eop -> + ${ $0.op = Plus; }$
2171 | - ${ $0.op = Minus; }$
2173 Uop -> + ${ $0.op = Absolute; }$
2174 | - ${ $0.op = Negate; }$
2176 Top -> * ${ $0.op = Times; }$
2177 | / ${ $0.op = Divide; }$
2178 | % ${ $0.op = Rem; }$
2179 | ++ ${ $0.op = Concat; }$
2181 ###### print binode cases
2188 print_exec(b->left, indent, 0);
2190 case Plus: fputs(" + ", stdout); break;
2191 case Minus: fputs(" - ", stdout); break;
2192 case Times: fputs(" * ", stdout); break;
2193 case Divide: fputs(" / ", stdout); break;
2194 case Rem: fputs(" % ", stdout); break;
2195 case Concat: fputs(" ++ ", stdout); break;
2198 print_exec(b->right, indent, 0);
2202 print_exec(b->right, indent, 0);
2206 print_exec(b->right, indent, 0);
2210 print_exec(b->right, indent, 0);
2214 ###### propagate binode cases
2220 /* both must be numbers, result is Tnum */
2223 /* as propagate_types ignores a NULL,
2224 * unary ops fit here too */
2225 propagate_types(b->left, c, ok, Tnum, 0);
2226 propagate_types(b->right, c, ok, Tnum, 0);
2227 if (!type_compat(type, Tnum, 0)) {
2228 type_err(c, "error: Arithmetic returns %1 but %2 expected", prog,
2235 /* both must be Tstr, result is Tstr */
2236 propagate_types(b->left, c, ok, Tstr, 0);
2237 propagate_types(b->right, c, ok, Tstr, 0);
2238 if (!type_compat(type, Tstr, 0)) {
2239 type_err(c, "error: Concat returns %1 but %2 expected", prog,
2246 return propagate_types(b->right, c, ok, type, 0);
2248 ###### interp binode cases
2251 rv = interp_exec(b->left);
2252 right = interp_exec(b->right);
2253 mpq_add(rv.num, rv.num, right.num);
2256 rv = interp_exec(b->left);
2257 right = interp_exec(b->right);
2258 mpq_sub(rv.num, rv.num, right.num);
2261 rv = interp_exec(b->left);
2262 right = interp_exec(b->right);
2263 mpq_mul(rv.num, rv.num, right.num);
2266 rv = interp_exec(b->left);
2267 right = interp_exec(b->right);
2268 mpq_div(rv.num, rv.num, right.num);
2273 left = interp_exec(b->left);
2274 right = interp_exec(b->right);
2275 mpz_init(l); mpz_init(r); mpz_init(rem);
2276 mpz_tdiv_q(l, mpq_numref(left.num), mpq_denref(left.num));
2277 mpz_tdiv_q(r, mpq_numref(right.num), mpq_denref(right.num));
2278 mpz_tdiv_r(rem, l, r);
2279 rv = val_init(Tnum);
2280 mpq_set_z(rv.num, rem);
2281 mpz_clear(r); mpz_clear(l); mpz_clear(rem);
2285 rv = interp_exec(b->right);
2286 mpq_neg(rv.num, rv.num);
2289 rv = interp_exec(b->right);
2290 mpq_abs(rv.num, rv.num);
2293 rv = interp_exec(b->right);
2296 left = interp_exec(b->left);
2297 right = interp_exec(b->right);
2299 rv.str = text_join(left.str, right.str);
2303 ###### value functions
2305 static struct text text_join(struct text a, struct text b)
2308 rv.len = a.len + b.len;
2309 rv.txt = malloc(rv.len);
2310 memcpy(rv.txt, a.txt, a.len);
2311 memcpy(rv.txt+a.len, b.txt, b.len);
2316 ### Blocks, Statements, and Statement lists.
2318 Now that we have expressions out of the way we need to turn to
2319 statements. There are simple statements and more complex statements.
2320 Simple statements do not contain newlines, complex statements do.
2322 Statements often come in sequences and we have corresponding simple
2323 statement lists and complex statement lists.
2324 The former comprise only simple statements separated by semicolons.
2325 The later comprise complex statements and simple statement lists. They are
2326 separated by newlines. Thus the semicolon is only used to separate
2327 simple statements on the one line. This may be overly restrictive,
2328 but I'm not sure I ever want a complex statement to share a line with
2331 Note that a simple statement list can still use multiple lines if
2332 subsequent lines are indented, so
2334 ###### Example: wrapped simple statement list
2339 is a single simple statement list. This might allow room for
2340 confusion, so I'm not set on it yet.
2342 A simple statement list needs no extra syntax. A complex statement
2343 list has two syntactic forms. It can be enclosed in braces (much like
2344 C blocks), or it can be introduced by a colon and continue until an
2345 unindented newline (much like Python blocks). With this extra syntax
2346 it is referred to as a block.
2348 Note that a block does not have to include any newlines if it only
2349 contains simple statements. So both of:
2351 if condition: a=b; d=f
2353 if condition { a=b; print f }
2357 In either case the list is constructed from a `binode` list with
2358 `Block` as the operator. When parsing the list it is most convenient
2359 to append to the end, so a list is a list and a statement. When using
2360 the list it is more convenient to consider a list to be a statement
2361 and a list. So we need a function to re-order a list.
2362 `reorder_bilist` serves this purpose.
2364 The only stand-alone statement we introduce at this stage is `pass`
2365 which does nothing and is represented as a `NULL` pointer in a `Block`
2366 list. Other stand-alone statements will follow once the infrastructure
2386 Block -> Open Statementlist Close ${ $0 = $<2; }$
2387 | Open Newlines Statementlist Close ${ $0 = $<3; }$
2388 | Open SimpleStatements } ${ $0 = reorder_bilist($<2); }$
2389 | Open Newlines SimpleStatements } ${ $0 = reorder_bilist($<3); }$
2390 | : Statementlist ${ $0 = $<2; }$
2391 | : SimpleStatements ${ $0 = reorder_bilist($<2); }$
2393 Statementlist -> ComplexStatements ${ $0 = reorder_bilist($<1); }$
2395 ComplexStatements -> ComplexStatements ComplexStatement ${
2401 | ComplexStatements NEWLINE ${ $0 = $<1; }$
2402 | ComplexStatement ${
2410 ComplexStatement -> SimpleStatements NEWLINE ${
2411 $0 = reorder_bilist($<1);
2413 ## ComplexStatement Grammar
2416 SimpleStatements -> SimpleStatements ; SimpleStatement ${
2422 | SimpleStatement ${
2428 | SimpleStatements ; ${ $0 = $<1; }$
2430 SimpleStatement -> pass ${ $0 = NULL; }$
2431 ## SimpleStatement Grammar
2433 ###### print binode cases
2437 if (b->left == NULL)
2440 print_exec(b->left, indent, 0);
2443 print_exec(b->right, indent, 0);
2446 // block, one per line
2447 if (b->left == NULL)
2448 do_indent(indent, "pass\n");
2450 print_exec(b->left, indent, bracket);
2452 print_exec(b->right, indent, bracket);
2456 ###### propagate binode cases
2459 /* If any statement returns something other than Tnone
2460 * or Tbool then all such must return same type.
2461 * As each statement may be Tnone or something else,
2462 * we must always pass NULL (unknown) down, otherwise an incorrect
2463 * error might occur. We never return Tnone unless it is
2468 for (e = b; e; e = cast(binode, e->right)) {
2469 t = propagate_types(e->left, c, ok, NULL, rules);
2470 if ((rules & Rboolok) && t == Tbool)
2472 if (t && t != Tnone && t != Tbool) {
2475 else if (t != type) {
2476 type_err(c, "error: expected %1%r, found %2",
2477 e->left, type, rules, t);
2485 ###### interp binode cases
2487 while (rv.type == Tnone &&
2490 rv = interp_exec(b->left);
2491 b = cast(binode, b->right);
2495 ### The Print statement
2497 `print` is a simple statement that takes a comma-separated list of
2498 expressions and prints the values separated by spaces and terminated
2499 by a newline. No control of formatting is possible.
2501 `print` faces the same list-ordering issue as blocks, and uses the
2507 ###### SimpleStatement Grammar
2509 | print ExpressionList ${
2510 $0 = reorder_bilist($<2);
2512 | print ExpressionList , ${
2517 $0 = reorder_bilist($0);
2528 ExpressionList -> ExpressionList , Expression ${
2541 ###### print binode cases
2544 do_indent(indent, "print");
2548 print_exec(b->left, -1, 0);
2552 b = cast(binode, b->right);
2558 ###### propagate binode cases
2561 /* don't care but all must be consistent */
2562 propagate_types(b->left, c, ok, NULL, Rnolabel);
2563 propagate_types(b->right, c, ok, NULL, Rnolabel);
2566 ###### interp binode cases
2572 for ( ; b; b = cast(binode, b->right))
2576 left = interp_exec(b->left);
2589 ###### Assignment statement
2591 An assignment will assign a value to a variable, providing it hasn't
2592 be declared as a constant. The analysis phase ensures that the type
2593 will be correct so the interpreter just needs to perform the
2594 calculation. There is a form of assignment which declares a new
2595 variable as well as assigning a value. If a name is assigned before
2596 it is declared, and error will be raised as the name is created as
2597 `Tlabel` and it is illegal to assign to such names.
2603 ###### SimpleStatement Grammar
2604 | Variable = Expression ${
2610 | VariableDecl = Expression ${
2618 if ($1->var->where_set == NULL) {
2619 type_err(config2context(config), "Variable declared with no type or value: %v",
2629 ###### print binode cases
2632 do_indent(indent, "");
2633 print_exec(b->left, indent, 0);
2635 print_exec(b->right, indent, 0);
2642 struct variable *v = cast(var, b->left)->var;
2643 do_indent(indent, "");
2644 print_exec(b->left, indent, 0);
2645 if (cast(var, b->left)->var->constant) {
2646 if (v->where_decl == v->where_set) {
2648 type_print(v->val.type, stdout);
2653 if (v->where_decl == v->where_set) {
2655 type_print(v->val.type, stdout);
2662 print_exec(b->right, indent, 0);
2669 ###### propagate binode cases
2673 /* Both must match and not be labels,
2674 * Type must support 'dup',
2675 * For Assign, left must not be constant.
2678 t = propagate_types(b->left, c, ok, NULL,
2679 Rnolabel | (b->op == Assign ? Rnoconstant : 0));
2684 if (propagate_types(b->right, c, ok, t, 0) != t)
2685 if (b->left->type == Xvar)
2686 type_err(c, "info: variable '%v' was set as %1 here.",
2687 cast(var, b->left)->var->where_set, t, rules, Tnone);
2689 t = propagate_types(b->right, c, ok, NULL, Rnolabel);
2691 propagate_types(b->left, c, ok, t,
2692 (b->op == Assign ? Rnoconstant : 0));
2694 if (t && t->dup == NULL) {
2695 type_err(c, "error: cannot assign value of type %1", b, t, 0, NULL);
2702 ###### interp binode cases
2705 lleft = linterp_exec(b->left);
2706 right = interp_exec(b->right);
2717 struct variable *v = cast(var, b->left)->var;
2721 right = interp_exec(b->right);
2723 right = val_init(v->val.type);
2730 ### The `use` statement
2732 The `use` statement is the last "simple" statement. It is needed when
2733 the condition in a conditional statement is a block. `use` works much
2734 like `return` in C, but only completes the `condition`, not the whole
2740 ###### SimpleStatement Grammar
2742 $0 = new_pos(binode, $1);
2747 ###### print binode cases
2750 do_indent(indent, "use ");
2751 print_exec(b->right, -1, 0);
2756 ###### propagate binode cases
2759 /* result matches value */
2760 return propagate_types(b->right, c, ok, type, 0);
2762 ###### interp binode cases
2765 rv = interp_exec(b->right);
2768 ### The Conditional Statement
2770 This is the biggy and currently the only complex statement. This
2771 subsumes `if`, `while`, `do/while`, `switch`, and some parts of `for`.
2772 It is comprised of a number of parts, all of which are optional though
2773 set combinations apply. Each part is (usually) a key word (`then` is
2774 sometimes optional) followed by either an expression or a code block,
2775 except the `casepart` which is a "key word and an expression" followed
2776 by a code block. The code-block option is valid for all parts and,
2777 where an expression is also allowed, the code block can use the `use`
2778 statement to report a value. If the code block does not report a value
2779 the effect is similar to reporting `True`.
2781 The `else` and `case` parts, as well as `then` when combined with
2782 `if`, can contain a `use` statement which will apply to some
2783 containing conditional statement. `for` parts, `do` parts and `then`
2784 parts used with `for` can never contain a `use`, except in some
2785 subordinate conditional statement.
2787 If there is a `forpart`, it is executed first, only once.
2788 If there is a `dopart`, then it is executed repeatedly providing
2789 always that the `condpart` or `cond`, if present, does not return a non-True
2790 value. `condpart` can fail to return any value if it simply executes
2791 to completion. This is treated the same as returning `True`.
2793 If there is a `thenpart` it will be executed whenever the `condpart`
2794 or `cond` returns True (or does not return any value), but this will happen
2795 *after* `dopart` (when present).
2797 If `elsepart` is present it will be executed at most once when the
2798 condition returns `False` or some value that isn't `True` and isn't
2799 matched by any `casepart`. If there are any `casepart`s, they will be
2800 executed when the condition returns a matching value.
2802 The particular sorts of values allowed in case parts has not yet been
2803 determined in the language design, so nothing is prohibited.
2805 The various blocks in this complex statement potentially provide scope
2806 for variables as described earlier. Each such block must include the
2807 "OpenScope" nonterminal before parsing the block, and must call
2808 `var_block_close()` when closing the block.
2810 The code following "`if`", "`switch`" and "`for`" does not get its own
2811 scope, but is in a scope covering the whole statement, so names
2812 declared there cannot be redeclared elsewhere. Similarly the
2813 condition following "`while`" is in a scope the covers the body
2814 ("`do`" part) of the loop, and which does not allow conditional scope
2815 extension. Code following "`then`" (both looping and non-looping),
2816 "`else`" and "`case`" each get their own local scope.
2818 The type requirements on the code block in a `whilepart` are quite
2819 unusal. It is allowed to return a value of some identifiable type, in
2820 which case the loop aborts and an appropriate `casepart` is run, or it
2821 can return a Boolean, in which case the loop either continues to the
2822 `dopart` (on `True`) or aborts and runs the `elsepart` (on `False`).
2823 This is different both from the `ifpart` code block which is expected to
2824 return a Boolean, or the `switchpart` code block which is expected to
2825 return the same type as the casepart values. The correct analysis of
2826 the type of the `whilepart` code block is the reason for the
2827 `Rboolok` flag which is passed to `propagate_types()`.
2829 The `cond_statement` cannot fit into a `binode` so a new `exec` is
2838 struct exec *action;
2839 struct casepart *next;
2841 struct cond_statement {
2843 struct exec *forpart, *condpart, *dopart, *thenpart, *elsepart;
2844 struct casepart *casepart;
2847 ###### ast functions
2849 static void free_casepart(struct casepart *cp)
2853 free_exec(cp->value);
2854 free_exec(cp->action);
2861 static void free_cond_statement(struct cond_statement *s)
2865 free_exec(s->forpart);
2866 free_exec(s->condpart);
2867 free_exec(s->dopart);
2868 free_exec(s->thenpart);
2869 free_exec(s->elsepart);
2870 free_casepart(s->casepart);
2874 ###### free exec cases
2875 case Xcond_statement: free_cond_statement(cast(cond_statement, e)); break;
2877 ###### ComplexStatement Grammar
2878 | CondStatement ${ $0 = $<1; }$
2883 // both ForThen and Whilepart open scopes, and CondSuffix only
2884 // closes one - so in the first branch here we have another to close.
2885 CondStatement -> ForThen WhilePart CondSuffix ${
2887 $0->forpart = $1.forpart; $1.forpart = NULL;
2888 $0->thenpart = $1.thenpart; $1.thenpart = NULL;
2889 $0->condpart = $2.condpart; $2.condpart = NULL;
2890 $0->dopart = $2.dopart; $2.dopart = NULL;
2891 var_block_close(config2context(config), CloseSequential);
2893 | WhilePart CondSuffix ${
2895 $0->condpart = $1.condpart; $1.condpart = NULL;
2896 $0->dopart = $1.dopart; $1.dopart = NULL;
2898 | SwitchPart CondSuffix ${
2902 | IfPart IfSuffix ${
2904 $0->condpart = $1.condpart; $1.condpart = NULL;
2905 $0->thenpart = $1.thenpart; $1.thenpart = NULL;
2906 // This is where we close an "if" statement
2907 var_block_close(config2context(config), CloseSequential);
2910 CondSuffix -> IfSuffix ${
2912 // This is where we close scope of the whole
2913 // "for" or "while" statement
2914 var_block_close(config2context(config), CloseSequential);
2916 | CasePart CondSuffix ${
2918 $1->next = $0->casepart;
2923 CasePart -> Newlines case Expression OpenScope Block ${
2924 $0 = calloc(1,sizeof(struct casepart));
2927 var_block_close(config2context(config), CloseParallel);
2929 | case Expression OpenScope Block ${
2930 $0 = calloc(1,sizeof(struct casepart));
2933 var_block_close(config2context(config), CloseParallel);
2937 IfSuffix -> Newlines ${ $0 = new(cond_statement); }$
2938 | Newlines else OpenScope Block ${
2939 $0 = new(cond_statement);
2941 var_block_close(config2context(config), CloseElse);
2943 | else OpenScope Block ${
2944 $0 = new(cond_statement);
2946 var_block_close(config2context(config), CloseElse);
2948 | Newlines else OpenScope CondStatement ${
2949 $0 = new(cond_statement);
2951 var_block_close(config2context(config), CloseElse);
2953 | else OpenScope CondStatement ${
2954 $0 = new(cond_statement);
2956 var_block_close(config2context(config), CloseElse);
2961 // These scopes are closed in CondSuffix
2962 ForPart -> for OpenScope SimpleStatements ${
2963 $0 = reorder_bilist($<3);
2965 | for OpenScope Block ${
2969 ThenPart -> then OpenScope SimpleStatements ${
2970 $0 = reorder_bilist($<3);
2971 var_block_close(config2context(config), CloseSequential);
2973 | then OpenScope Block ${
2975 var_block_close(config2context(config), CloseSequential);
2978 ThenPartNL -> ThenPart OptNL ${
2982 // This scope is closed in CondSuffix
2983 WhileHead -> while OpenScope Block ${
2988 ForThen -> ForPart OptNL ThenPartNL ${
2996 // This scope is closed in CondSuffix
2997 WhilePart -> while OpenScope Expression Block ${
2998 $0.type = Xcond_statement;
3002 | WhileHead OptNL do Block ${
3003 $0.type = Xcond_statement;
3008 IfPart -> if OpenScope Expression OpenScope Block ${
3009 $0.type = Xcond_statement;
3012 var_block_close(config2context(config), CloseParallel);
3014 | if OpenScope Block OptNL then OpenScope Block ${
3015 $0.type = Xcond_statement;
3018 var_block_close(config2context(config), CloseParallel);
3022 // This scope is closed in CondSuffix
3023 SwitchPart -> switch OpenScope Expression ${
3026 | switch OpenScope Block ${
3030 ###### print exec cases
3032 case Xcond_statement:
3034 struct cond_statement *cs = cast(cond_statement, e);
3035 struct casepart *cp;
3037 do_indent(indent, "for");
3038 if (bracket) printf(" {\n"); else printf(":\n");
3039 print_exec(cs->forpart, indent+1, bracket);
3042 do_indent(indent, "} then {\n");
3044 do_indent(indent, "then:\n");
3045 print_exec(cs->thenpart, indent+1, bracket);
3047 if (bracket) do_indent(indent, "}\n");
3051 if (cs->condpart && cs->condpart->type == Xbinode &&
3052 cast(binode, cs->condpart)->op == Block) {
3054 do_indent(indent, "while {\n");
3056 do_indent(indent, "while:\n");
3057 print_exec(cs->condpart, indent+1, bracket);
3059 do_indent(indent, "} do {\n");
3061 do_indent(indent, "do:\n");
3062 print_exec(cs->dopart, indent+1, bracket);
3064 do_indent(indent, "}\n");
3066 do_indent(indent, "while ");
3067 print_exec(cs->condpart, 0, bracket);
3072 print_exec(cs->dopart, indent+1, bracket);
3074 do_indent(indent, "}\n");
3079 do_indent(indent, "switch");
3081 do_indent(indent, "if");
3082 if (cs->condpart && cs->condpart->type == Xbinode &&
3083 cast(binode, cs->condpart)->op == Block) {
3088 print_exec(cs->condpart, indent+1, bracket);
3090 do_indent(indent, "}\n");
3092 do_indent(indent, "then:\n");
3093 print_exec(cs->thenpart, indent+1, bracket);
3097 print_exec(cs->condpart, 0, bracket);
3103 print_exec(cs->thenpart, indent+1, bracket);
3105 do_indent(indent, "}\n");
3110 for (cp = cs->casepart; cp; cp = cp->next) {
3111 do_indent(indent, "case ");
3112 print_exec(cp->value, -1, 0);
3117 print_exec(cp->action, indent+1, bracket);
3119 do_indent(indent, "}\n");
3122 do_indent(indent, "else");
3127 print_exec(cs->elsepart, indent+1, bracket);
3129 do_indent(indent, "}\n");
3134 ###### propagate exec cases
3135 case Xcond_statement:
3137 // forpart and dopart must return Tnone
3138 // thenpart must return Tnone if there is a dopart,
3139 // otherwise it is like elsepart.
3141 // be bool if there is no casepart
3142 // match casepart->values if there is a switchpart
3143 // either be bool or match casepart->value if there
3145 // elsepart and casepart->action must match the return type
3146 // expected of this statement.
3147 struct cond_statement *cs = cast(cond_statement, prog);
3148 struct casepart *cp;
3150 t = propagate_types(cs->forpart, c, ok, Tnone, 0);
3151 if (!type_compat(Tnone, t, 0))
3153 t = propagate_types(cs->dopart, c, ok, Tnone, 0);
3154 if (!type_compat(Tnone, t, 0))
3157 t = propagate_types(cs->thenpart, c, ok, Tnone, 0);
3158 if (!type_compat(Tnone, t, 0))
3161 if (cs->casepart == NULL)
3162 propagate_types(cs->condpart, c, ok, Tbool, 0);
3164 /* Condpart must match case values, with bool permitted */
3166 for (cp = cs->casepart;
3167 cp && !t; cp = cp->next)
3168 t = propagate_types(cp->value, c, ok, NULL, 0);
3169 if (!t && cs->condpart)
3170 t = propagate_types(cs->condpart, c, ok, NULL, Rboolok);
3171 // Now we have a type (I hope) push it down
3173 for (cp = cs->casepart; cp; cp = cp->next)
3174 propagate_types(cp->value, c, ok, t, 0);
3175 propagate_types(cs->condpart, c, ok, t, Rboolok);
3178 // (if)then, else, and case parts must return expected type.
3179 if (!cs->dopart && !type)
3180 type = propagate_types(cs->thenpart, c, ok, NULL, rules);
3182 type = propagate_types(cs->elsepart, c, ok, NULL, rules);
3183 for (cp = cs->casepart;
3186 type = propagate_types(cp->action, c, ok, NULL, rules);
3189 propagate_types(cs->thenpart, c, ok, type, rules);
3190 propagate_types(cs->elsepart, c, ok, type, rules);
3191 for (cp = cs->casepart; cp ; cp = cp->next)
3192 propagate_types(cp->action, c, ok, type, rules);
3198 ###### interp exec cases
3199 case Xcond_statement:
3201 struct value v, cnd;
3202 struct casepart *cp;
3203 struct cond_statement *c = cast(cond_statement, e);
3206 interp_exec(c->forpart);
3209 cnd = interp_exec(c->condpart);
3212 if (!(cnd.type == Tnone ||
3213 (cnd.type == Tbool && cnd.bool != 0)))
3215 // cnd is Tnone or Tbool, doesn't need to be freed
3217 interp_exec(c->dopart);
3220 rv = interp_exec(c->thenpart);
3221 if (rv.type != Tnone || !c->dopart)
3225 } while (c->dopart);
3227 for (cp = c->casepart; cp; cp = cp->next) {
3228 v = interp_exec(cp->value);
3229 if (value_cmp(v, cnd) == 0) {
3232 rv = interp_exec(cp->action);
3239 rv = interp_exec(c->elsepart);
3248 Now that we have the shape of the interpreter in place we can add some
3249 complex types and connected them in to the data structures and the
3250 different phases of parse, analyse, print, interpret.
3252 For now, just arrays.
3256 Arrays can be declared by giving a size and a type, as `[size]type' so
3257 `freq:[26]number` declares `freq` to be an array of 26 numbers. The
3258 size can be an arbitrary expression which is evaluated when the name
3261 Arrays cannot be assigned. When pointers are introduced we will also
3262 introduce array slices which can refer to part or all of an array -
3263 the assignment syntax will create a slice. For now, an array can only
3264 ever be referenced by the name it is declared with. It is likely that
3265 a "`copy`" primitive will eventually be define which can be used to
3266 make a copy of an array with controllable depth.
3268 ###### type union fields
3272 struct variable *vsize;
3273 struct type *member;
3276 ###### value union fields
3278 struct value *elmnts;
3281 ###### value functions
3283 static struct value array_prepare(struct type *type)
3288 ret.array.elmnts = NULL;
3292 static struct value array_init(struct type *type)
3298 if (type->array.vsize) {
3301 mpz_tdiv_q(q, mpq_numref(type->array.vsize->val.num),
3302 mpq_denref(type->array.vsize->val.num));
3303 type->array.size = mpz_get_si(q);
3306 ret.array.elmnts = calloc(type->array.size,
3307 sizeof(ret.array.elmnts[0]));
3308 for (i = 0; ret.array.elmnts && i < type->array.size; i++)
3309 ret.array.elmnts[i] = val_init(type->array.member);
3313 static void array_free(struct value val)
3317 if (val.array.elmnts)
3318 for (i = 0; i < val.type->array.size; i++)
3319 free_value(val.array.elmnts[i]);
3320 free(val.array.elmnts);
3323 static int array_compat(struct type *require, struct type *have)
3325 if (have->compat != require->compat)
3327 /* Both are arrays, so we can look at details */
3328 if (!type_compat(require->array.member, have->array.member, 0))
3330 if (require->array.vsize == NULL && have->array.vsize == NULL)
3331 return require->array.size == have->array.size;
3333 return require->array.vsize == have->array.vsize;
3336 static void array_print_type(struct type *type, FILE *f)
3339 if (type->array.vsize) {
3340 struct binding *b = type->array.vsize->name;
3341 fprintf(f, "%.*s]", b->name.len, b->name.txt);
3343 fprintf(f, "%d]", type->array.size);
3344 type_print(type->array.member, f);
3347 static struct type array_prototype = {
3348 .prepare = array_prepare,
3350 .print_type = array_print_type,
3351 .compat = array_compat,
3357 | [ NUMBER ] Type ${
3358 $0 = calloc(1, sizeof(struct type));
3359 *($0) = array_prototype;
3360 $0->array.member = $<4;
3361 $0->array.vsize = NULL;
3365 if (number_parse(num, tail, $2.txt) == 0)
3366 tok_err(config2context(config), "error: unrecognised number", &$2);
3368 tok_err(config2context(config), "error: unsupported number suffix", &$2);
3370 $0->array.size = mpz_get_ui(mpq_numref(num));
3371 if (mpz_cmp_ui(mpq_denref(num), 1) != 0) {
3372 tok_err(config2context(config), "error: array size must be an integer",
3374 } else if (mpz_cmp_ui(mpq_numref(num), 1UL << 30) >= 0)
3375 tok_err(config2context(config), "error: array size is too large",
3381 | [ IDENTIFIER ] Type ${ {
3382 struct variable *v = var_ref(config2context(config), $2.txt);
3385 tok_err(config2context(config), "error: name undeclared", &$2);
3386 else if (!v->constant)
3387 tok_err(config2context(config), "error: array size must be a constant", &$2);
3389 $0 = calloc(1, sizeof(struct type));
3390 *($0) = array_prototype;
3391 $0->array.member = $<4;
3393 $0->array.vsize = v;
3399 ###### variable grammar
3401 | Variable [ Expression ] ${ {
3402 struct binode *b = new(binode);
3409 ###### print binode cases
3411 print_exec(b->left, -1, 0);
3413 print_exec(b->right, -1, 0);
3417 ###### propagate binode cases
3419 /* left must be an array, right must be a number,
3420 * result is the member type of the array
3422 propagate_types(b->right, c, ok, Tnum, 0);
3423 t = propagate_types(b->left, c, ok, NULL, rules & Rnoconstant);
3424 if (!t || t->compat != array_compat) {
3425 type_err(c, "error: %1 cannot be indexed", prog, t, 0, NULL);
3429 if (!type_compat(type, t->array.member, rules)) {
3430 type_err(c, "error: have %1 but need %2", prog,
3431 t->array.member, rules, type);
3434 return t->array.member;
3438 ###### interp binode cases
3443 lleft = linterp_exec(b->left);
3444 right = interp_exec(b->right);
3446 mpz_tdiv_q(q, mpq_numref(right.num), mpq_denref(right.num));
3450 if (i >= 0 && i < lleft->type->array.size)
3451 lrv = &lleft->array.elmnts[i];
3453 rv = val_init(lleft->type->array.member);
3457 ### Finally the whole program.
3459 Somewhat reminiscent of Pascal a (current) Ocean program starts with
3460 the keyword "program" and a list of variable names which are assigned
3461 values from command line arguments. Following this is a `block` which
3462 is the code to execute.
3464 As this is the top level, several things are handled a bit
3466 The whole program is not interpreted by `interp_exec` as that isn't
3467 passed the argument list which the program requires. Similarly type
3468 analysis is a bit more interesting at this level.
3473 ###### Parser: grammar
3476 Program -> program OpenScope Varlist Block OptNL ${
3479 $0->left = reorder_bilist($<3);
3481 var_block_close(config2context(config), CloseSequential);
3482 if (config2context(config)->scope_stack) abort();
3485 tok_err(config2context(config),
3486 "error: unhandled parse error", &$1);
3489 Varlist -> Varlist ArgDecl ${
3498 ArgDecl -> IDENTIFIER ${ {
3499 struct variable *v = var_decl(config2context(config), $1.txt);
3506 ###### print binode cases
3508 do_indent(indent, "program");
3509 for (b2 = cast(binode, b->left); b2; b2 = cast(binode, b2->right)) {
3511 print_exec(b2->left, 0, 0);
3517 print_exec(b->right, indent+1, bracket);
3519 do_indent(indent, "}\n");
3522 ###### propagate binode cases
3523 case Program: abort();
3525 ###### core functions
3527 static int analyse_prog(struct exec *prog, struct parse_context *c)
3529 struct binode *b = cast(binode, prog);
3536 propagate_types(b->right, c, &ok, Tnone, 0);
3541 for (b = cast(binode, b->left); b; b = cast(binode, b->right)) {
3542 struct var *v = cast(var, b->left);
3543 if (!v->var->val.type) {
3544 v->var->where_set = b;
3545 v->var->val = val_prepare(Tstr);
3548 b = cast(binode, prog);
3551 propagate_types(b->right, c, &ok, Tnone, 0);
3556 /* Make sure everything is still consistent */
3557 propagate_types(b->right, c, &ok, Tnone, 0);
3561 static void interp_prog(struct exec *prog, char **argv)
3563 struct binode *p = cast(binode, prog);
3569 al = cast(binode, p->left);
3571 struct var *v = cast(var, al->left);
3572 struct value *vl = &v->var->val;
3574 if (argv[0] == NULL) {
3575 printf("Not enough args\n");
3578 al = cast(binode, al->right);
3580 *vl = parse_value(vl->type, argv[0]);
3581 if (vl->type == NULL)
3585 v = interp_exec(p->right);
3589 ###### interp binode cases
3590 case Program: abort();
3592 ## And now to test it out.
3594 Having a language requires having a "hello world" program. I'll
3595 provide a little more than that: a program that prints "Hello world"
3596 finds the GCD of two numbers, prints the first few elements of
3597 Fibonacci, and performs a binary search for a number.
3599 ###### File: oceani.mk
3602 @echo "===== TEST ====="
3603 ./oceani --section "test: hello" oceani.mdc 55 33
3608 print "Hello World, what lovely oceans you have!"
3609 /* When a variable is defined in both branches of an 'if',
3610 * and used afterwards, the variables are merged.
3616 print "Is", A, "bigger than", B,"? ", bigger
3617 /* If a variable is not used after the 'if', no
3618 * merge happens, so types can be different
3621 double:string = "yes"
3622 print A, "is more than twice", B, "?", double
3625 print "double", B, "is", double
3630 if a > 0 and then b > 0:
3636 print "GCD of", A, "and", B,"is", a
3638 print a, "is not positive, cannot calculate GCD"
3640 print b, "is not positive, cannot calculate GCD"
3645 print "Fibonacci:", f1,f2,
3646 then togo = togo - 1
3654 /* Binary search... */
3659 mid := (lo + hi) / 2
3671 print "Yay, I found", target
3673 print "Closest I found was", mid
3678 for i:=1; then i = i + 1; while i < size:
3679 n := list[i-1] * list[i-1]
3680 list[i] = (n / 100) % 10000
3682 print "Before sort:"
3683 for i:=0; then i = i + 1; while i < size:
3684 print "list[",i,"]=",list[i]
3686 for i := 1; then i=i+1; while i < size:
3687 for j:=i-1; then j=j-1; while j >= 0:
3688 if list[j] > list[j+1]:
3693 for i:=0; then i = i + 1; while i < size:
3694 print "list[",i,"]=",list[i]