ade89ebf79
Remove unused base type variant.
2018-04-17 12:55:41 -07:00
be670a659f
Add results for bad types.
2018-04-17 12:55:30 -07:00
7b1445a262
Add functions for basetypes and their entries in tables.
2018-04-17 12:07:22 -07:00
b1a113a57d
Add free function for freeing the custom structs.
2018-04-17 12:05:48 -07:00
af87c6646d
Add initial implementation of types and values.
2018-04-12 23:54:58 -07:00
d146b71e56
Add an implementation of base types.
...
These will hold information about a type such as (possibly) the
interfaces it implements and the parameters it accepts.
2018-04-12 23:45:30 -07:00
0cfc1df02c
Add placeholder types.
2018-04-07 14:50:06 -07:00
1960ded070
Add initial implementation of a reference counting trie.
2018-04-06 23:55:56 -07:00
dabab1e870
Add a null reference that doesn't call malloc.
2018-04-06 23:53:40 -07:00
60d22c2511
Remove types, while their implementation is not thought out.
2018-04-01 00:18:53 -07:00
e6801255fa
Add a vector of reference counted values.
2018-03-31 22:18:36 -07:00
35fc0e7fd1
Begin the implementation of a type.
2018-03-31 15:54:59 -07:00
c5fa68fdf5
Implement an initial version of reference counting.
2018-03-30 22:37:30 -07:00
7dd81f5e9b
Remove unused (and non-existent) header from code.
2018-03-30 20:51:11 -07:00
26ad341a50
Switch the table to using tries.
2018-03-24 20:47:34 -07:00
56c891f9f8
Implement foreach for the trie.
2018-03-24 20:40:42 -07:00
7afe1a37e4
Implement a trie, sans removal.
2018-03-24 02:01:39 -07:00
77123561f0
Add a function to check if a tree node has a scope.
2018-03-24 00:36:10 -07:00
9500a6f9b0
Make a single "operator" token, and specialize after parse.
2018-03-17 20:56:25 -07:00
7ab5eba529
Make distinction between prefix and postfix unary operators in trees.
2018-03-17 18:25:23 -07:00
4e86ccc253
Use new table features to improve searching for operators.
2018-03-17 18:01:52 -07:00
6b438dbc6d
Store the operator type in the corresponding table entry.
2018-03-17 17:38:13 -07:00
c131fbc758
Implement reserved operator parsing.
2018-03-16 23:09:41 -07:00
27acfb0be7
Register reserved operators as tokens.
2018-03-16 23:09:11 -07:00
d25c1a379a
Add function to search for reserved operators.
2018-03-16 22:11:48 -07:00
ab2311def9
Store function / operator types when they are registered.
2018-03-15 19:41:11 -07:00
429c0bde3e
Add syntax sugar for let.
2018-03-14 13:30:20 -07:00
bb61dbcd54
Add support for the return keyword.
2018-03-08 21:31:24 -08:00
f3f1cc8c43
Rename all the tree enums to have a prefix.
...
This prevents some possible naming collisions.
2018-03-08 21:13:25 -08:00
2d26e45e90
Add function node parsing.
2018-03-08 21:10:05 -08:00
2487cdebe0
Add the ability to parse types.
...
This ability is not integrated with the rest of the parser - in fact, the grammar for things like function declarations (where type declarations are necessary) is not yet determined.
2018-03-06 16:47:11 -08:00
45d955b8bd
Add utility functions for copying strings.
2018-03-06 16:45:55 -08:00
bb26405df0
Add a parse type struct, used to hold type data as it is parsed.
2018-03-06 16:45:43 -08:00
ac8e2ff418
Implement the do-while loop.
2018-02-27 12:30:37 -08:00
976b6d1b1a
Add code to parse while loops.
2018-02-27 11:57:45 -08:00
127a59ba50
Add comments to the debug header.
2018-02-27 11:08:14 -08:00
08513a2315
Add function to print to file.
2018-02-26 18:14:31 -08:00
65071d47b3
Add a function to print the parse tree.
2018-02-25 23:09:35 -08:00
88108bb3c0
Make the has string and has vector functions public.
2018-02-25 22:57:45 -08:00
52ac67026f
Remove function tokens. If functions are first class, they're variables.
2018-02-25 14:12:34 -08:00
7a84babf1e
Add basic function call parsing.
2018-02-24 20:08:17 -08:00
e5c2570bac
Implement parsing if expressions.
2018-02-20 16:38:02 -08:00
8ffcbb0ee2
Make blocks expressions, and add implicit void expression at block ends.
2018-02-18 21:05:06 -08:00
96b2dc234f
Remove currently unused node types from the tree code.
2018-02-18 19:42:54 -08:00
07284d1fb2
Add a table entry free function.
2018-02-17 19:53:33 -08:00
811704be25
Add a recursive tree freeing function.
2018-02-17 19:20:10 -08:00
b1aa2a4bf5
Implement associativity storage for operators.
2018-02-17 16:00:39 -08:00
8cd1d23120
Add functions to separately register different types of operators.
2018-02-17 14:01:48 -08:00
a3ce8fbd9c
Tone down the current token list, in favor of adding them later.
2018-02-17 13:32:55 -08:00
841c2f15e5
Add function to free tree nodes.
2018-02-17 12:55:50 -08:00
ee19f55058
Implement convenience functions for looking up the implemented entries.
2018-02-11 23:00:07 -08:00
72be209f0f
Implement two entry types and a function to store entries in table.
2018-02-11 22:50:08 -08:00
3de3f1ec00
Move structs used to hold custom operators and functions into new header
2018-02-11 22:38:40 -08:00
74034c7b76
Rename header files.
2018-02-11 22:32:42 -08:00
f67b98d7a6
Add a parser struct.
2018-02-11 22:26:19 -08:00
37a6f31b5f
Start the overarching library code, and move result enum elsewhere.
2018-02-11 22:11:33 -08:00
e5351c17a2
Fix code to stick to proper naming convention.
2018-02-11 21:22:01 -08:00
0958ecd1eb
Begin working on an initial implementation for the parser.
2018-02-10 22:40:34 -08:00
6d836a5513
Add parser state code and skeleton for the parsing procedure.
2018-02-10 22:22:51 -08:00
03f27bda18
Write a basic tree header file to hold the structure of the parsed code.
2018-02-10 22:15:51 -08:00
1a6a80d26b
Add the search feature.
2018-02-10 17:57:24 -08:00
a27bdc37f5
Begin working on a table struct to hold information during runtime.
2018-02-10 17:53:07 -08:00
0ff71a9389
Implement lexing code.
2018-02-10 17:13:59 -08:00
b46dccb70d
Add a utility header to convert error codes.
2018-02-10 16:01:08 -08:00
2db840288d
Implement the initialization and freeing of lexer.
2018-02-10 14:21:04 -08:00
10652048ab
Begin working on the lexer.
2018-02-10 13:57:16 -08:00
