TODO.md

@@ -2,6 +2,8 @@
 
 ## Testing
 
+* Get a test library for running many unit tests working
+* Write a human-readable display of the AST
 * Make an automatic (macro-based?) system for numbering compiler errors, this should be every type of error
 
 ## Symbols
@@ -22,10 +24,6 @@
 
 2. Once FQSNs are aware of function parameters, most of the Rc<String> things in eval.rs can go away
 
-## Semantics
-
-* Use annotations to indicate builtin functions
-
 ## Parser
 * I think I can restructure the parser to get rid of most instances of expect!, at least at the beginning of a rule
 

schala-lang/language/src/builtin.rs

@@ -28,6 +28,7 @@ pub enum Builtin {
     GreaterThan,
     GreaterThanOrEqual,
     Comparison,
+    FieldAccess,
     IOPrint,
     IOPrintLn,
     IOGetLine,
@@ -58,6 +59,7 @@ impl Builtin {
             GreaterThan => ty!(Nat -> Nat -> Bool),
             GreaterThanOrEqual => ty!(Nat -> Nat -> Bool),
             Comparison => ty!(Nat -> Nat -> Ordering),
+            FieldAccess => ty!(Unit),
             IOPrint => ty!(Unit),
             IOPrintLn => ty!(Unit),
             IOGetLine => ty!(StringT),
@@ -118,6 +120,7 @@ impl FromStr for Builtin {
             "==" => Equality,
             "=" => Assignment,
             "<=>" => Comparison,
+            "." => FieldAccess,
             "print" => IOPrint,
             "println" => IOPrintLn,
             "getline" => IOGetLine,

schala-lang/language/src/parsing/mod.rs

@@ -394,14 +394,14 @@ impl Parser {
         let tok = self.token_handler.peek();
         let kind = match tok.get_kind() {
             AtSign => self.annotation().map(StatementKind::Declaration),
-            Keyword(Type) => self.type_declaration().map(StatementKind::Declaration),
-            Keyword(Func) => self.func_declaration().map(StatementKind::Declaration),
+            Keyword(Type) => self.type_declaration().map(|decl| StatementKind::Declaration(decl)),
+            Keyword(Func) => self.func_declaration().map(|func| StatementKind::Declaration(func)),
             Keyword(Let) => self.binding_declaration().map(StatementKind::Declaration),
             Keyword(Interface) => self.interface_declaration().map(StatementKind::Declaration),
             Keyword(Impl) => self.impl_declaration().map(StatementKind::Declaration),
             Keyword(Import) => self.import_declaration().map(StatementKind::Import),
             Keyword(Module) => self.module_declaration().map(StatementKind::Module),
-            _ => self.expression().map(StatementKind::Expression),
+            _ => self.expression().map(|expr| StatementKind::Expression(expr)),
         }?;
         let id = self.id_store.fresh();
         Ok(Statement { kind, id, location: tok.location })
@@ -693,9 +693,14 @@ impl Parser {
 
     #[recursive_descent_method]
     fn prefix_expr(&mut self) -> ParseResult<Expression> {
-        while let Semicolon | Newline = self.token_handler.peek_kind() {
+        loop {
+            match self.token_handler.peek_kind() {
+                Semicolon | Newline => {
                     self.token_handler.next();
                 }
+                _ => break,
+            }
+        }
 
         match self.token_handler.peek_kind() {
             Operator(ref op) if PrefixOp::is_prefix(&*op) => {

schala-lang/language/src/reduced_ir/mod.rs

@@ -142,7 +142,7 @@ impl<'a, 'b> Reducer<'a, 'b> {
                     e => return Expression::ReductionError(format!("Bad symbol for NamedStruct: {:?}", e)),
                 };
 
-                let field_order = compute_field_orderings(self.type_context, &type_id, tag).unwrap();
+                let field_order = compute_field_orderings(&self.type_context, &type_id, tag).unwrap();
 
                 let mut field_map = HashMap::new();
                 for (name, expr) in fields.iter() {
@@ -310,7 +310,6 @@ impl<'a, 'b> Reducer<'a, 'b> {
         let def_id = symbol.def_id();
 
         match symbol.spec() {
-            Builtin(b) => Expression::Callable(Callable::Builtin(b)),
             Func => Expression::Lookup(Lookup::Function(def_id.unwrap())),
             GlobalBinding => Expression::Lookup(Lookup::GlobalVar(def_id.unwrap())),
             LocalVariable => Expression::Lookup(Lookup::LocalVar(def_id.unwrap())),

schala-lang/language/src/symbol_table/mod.rs

@@ -12,7 +12,6 @@ use crate::{
         Declaration, ItemId, ModuleSpecifier, Statement, StatementKind, TypeBody, TypeSingletonName, Variant,
         VariantKind,
     },
-    builtin::Builtin,
     tokenizing::Location,
     type_inference::{self, PendingType, TypeBuilder, TypeContext, TypeId, VariantBuilder},
 };
@@ -43,6 +42,7 @@ impl Fqsn {
         Fqsn { scopes: v }
     }
 
+    #[cfg(test)]
     fn from_strs(strs: &[&str]) -> Fqsn {
         let mut scopes = vec![];
         for s in strs {
@@ -152,7 +152,7 @@ pub struct SymbolTable {
 
 impl SymbolTable {
     pub fn new() -> SymbolTable {
-        let mut table = SymbolTable {
+        SymbolTable {
             def_id_store: IdStore::new(),
             symbol_trie: SymbolTrie::new(),
             fq_names: NameTable::new(),
@@ -161,10 +161,7 @@ impl SymbolTable {
             fqsn_to_symbol: HashMap::new(),
             id_to_symbol: HashMap::new(),
             def_to_symbol: HashMap::new(),
-        };
-
-        table.populate_builtins();
-        table
+        }
     }
 
     /// The main entry point into the symbol table. This will traverse the AST in several
@@ -212,24 +209,6 @@ impl SymbolTable {
         self.id_to_symbol.insert(*id, symbol.clone());
         self.def_to_symbol.insert(def_id, symbol);
     }
-
-    fn populate_single_builtin(&mut self, fqsn: Fqsn, builtin: Builtin) {
-        let def_id = self.def_id_store.fresh();
-        let spec = SymbolSpec::Builtin(builtin);
-        let symbol = Rc::new(Symbol { fully_qualified_name: fqsn.clone(), spec, def_id });
-
-        self.symbol_trie.insert(&fqsn);
-        self.fqsn_to_symbol.insert(fqsn, symbol.clone());
-        self.def_to_symbol.insert(def_id, symbol);
-    }
-
-    fn populate_builtins(&mut self) {
-        let fqsn = Fqsn::from_strs(&["println"]);
-        self.populate_single_builtin(fqsn, Builtin::IOPrintLn);
-
-        let fqsn = Fqsn::from_strs(&["print"]);
-        self.populate_single_builtin(fqsn, Builtin::IOPrint);
-    }
 }
 
 struct SymbolTableRunner<'a> {
@@ -279,7 +258,6 @@ impl fmt::Display for Symbol {
 //function parameters (even though they are currently assigned).
 #[derive(Debug, Clone)]
 pub enum SymbolSpec {
-    Builtin(Builtin),
     Func,
     DataConstructor { tag: u32, type_id: TypeId },
     RecordConstructor { tag: u32, members: HashMap<Rc<String>, TypeId>, type_id: TypeId },
@@ -292,7 +270,6 @@ impl fmt::Display for SymbolSpec {
     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
         use self::SymbolSpec::*;
         match self {
-            Builtin(b) => write!(f, "Builtin: {:?}", b),
             Func => write!(f, "Func"),
             DataConstructor { tag, type_id } => write!(f, "DataConstructor(tag: {}, type: {})", tag, type_id),
             RecordConstructor { type_id, tag, .. } =>

schala-lang/language/src/tree_walk_eval/evaluator.rs

@@ -276,13 +276,16 @@ impl<'a, 'b> Evaluator<'a, 'b> {
         let evaled_args = evaled_args?;
 
         Ok(match (builtin, evaled_args.as_slice()) {
+            (FieldAccess, /*&[Node::PrimObject { .. }]*/ _) => {
+                return Err("Field access unimplemented".into());
+            }
             /* builtin functions */
             (IOPrint, &[ref anything]) => {
                 print!("{}", anything.to_repl(self.type_context));
                 Primitive::Tuple(vec![])
             }
             (IOPrintLn, &[ref anything]) => {
-                println!("{}", anything.to_repl(self.type_context));
+                print!("{}", anything.to_repl(self.type_context));
                 Primitive::Tuple(vec![])
             }
             (IOGetLine, &[]) => {