schala/schala-lang/language/src/lib.rs

#![feature(trace_macros)]
#![feature(custom_attribute)]
#![feature(unrestricted_attribute_tokens)]
#![feature(slice_patterns, box_patterns, box_syntax)]

//! `schala-lang` is where the Schala programming language is actually implemented. 
//! It defines the `Schala` type, which contains the state for a Schala REPL, and implements
//! `ProgrammingLanguageInterface` and the chain of compiler passes for it.

extern crate itertools;
#[macro_use]
extern crate lazy_static;
#[macro_use]
extern crate maplit;
extern crate schala_repl;
#[macro_use]
extern crate schala_repl_codegen;
#[macro_use]
extern crate schala_lang_codegen;

use std::cell::RefCell;
use std::rc::Rc;

use itertools::Itertools;
use schala_repl::{ProgrammingLanguageInterface, EvalOptions, TraceArtifact, UnfinishedComputation, FinishedComputation};

macro_rules! bx {
  ($e:expr) => { Box::new($e) }
}

mod util;
mod builtin;
mod tokenizing;
mod ast;
mod parsing;
mod symbol_table;
mod typechecking;
mod reduced_ast;
mod eval;

//trace_macros!(true);
#[derive(ProgrammingLanguageInterface)]
#[LanguageName = "Schala"]
#[SourceFileExtension = "schala"]
#[PipelineSteps(load_source, tokenizing, parsing(compact,expanded,trace), symbol_table, typechecking, ast_reducing, eval)]
#[DocMethod = get_doc]
#[HandleCustomInterpreterDirectives = handle_custom_interpreter_directives]
/// All bits of state necessary to parse and execute a Schala program are stored in this struct
/// `state` represents the execution state for the AST-walking interpreter, the other fields
/// should be self-explanatory.
pub struct Schala {
  source_reference: SourceReference,
  state: eval::State<'static>,
  symbol_table: Rc<RefCell<symbol_table::SymbolTable>>,
  type_context: typechecking::TypeContext<'static>,
  active_parser: Option<parsing::Parser>,
}

impl Schala {
  fn get_doc(&self, commands: &Vec<&str>) -> Option<String> {
    Some(format!("Documentation on commands: {:?}", commands))
  }

  fn handle_custom_interpreter_directives(&mut self, commands: &Vec<&str>) -> Option<String> {
    Some(format!("Schala-lang command: {:?} not supported", commands.get(0)))
  }
}

impl Schala {
  /// Creates a new Schala environment *without* any prelude.
  fn new_blank_env() -> Schala {
    let symbols = Rc::new(RefCell::new(symbol_table::SymbolTable::new()));
    Schala {
      source_reference: SourceReference::new(),
      symbol_table: symbols.clone(),
      state: eval::State::new(symbols),
      type_context: typechecking::TypeContext::new(),
      active_parser: None,
    }
  }

  /// Creates a new Schala environment with the standard prelude, which is defined as ordinary
  /// Schala code in the file `prelude.schala`
  pub fn new() -> Schala {
    let prelude = include_str!("prelude.schala");
    let mut s = Schala::new_blank_env();
    s.execute_pipeline(prelude, &EvalOptions::default());
    s
  }
}

fn load_source<'a>(input: &'a str, handle: &mut Schala, _comp: Option<&mut UnfinishedComputation>) -> Result<&'a str, String> {
  handle.source_reference.load_new_source(input);
  Ok(input)
}

fn tokenizing(input: &str, _handle: &mut Schala, comp: Option<&mut UnfinishedComputation>) -> Result<Vec<tokenizing::Token>, String> {
  let tokens = tokenizing::tokenize(input);
  comp.map(|comp| {
    let token_string = tokens.iter().map(|t| format!("{:?}<L:{},C:{}>", t.kind, t.offset.0, t.offset.1)).join(", ");
    comp.add_artifact(TraceArtifact::new("tokens", token_string));
  });

  let errors: Vec<String> = tokens.iter().filter_map(|t| t.get_error()).collect();
  if errors.len() == 0 {
    Ok(tokens)
  } else {
    Err(format!("{:?}", errors))
  }
}

fn parsing(input: Vec<tokenizing::Token>, handle: &mut Schala, comp: Option<&mut UnfinishedComputation>) -> Result<ast::AST, String> {
  use crate::parsing::Parser;

  let mut parser = match handle.active_parser.take() {
    None => Parser::new(input),
    Some(parser) => parser
  };

  let ast = parser.parse();
  let trace = parser.format_parse_trace();

  comp.map(|comp| {
    //TODO need to control which of these debug stages get added
    let opt = comp.cur_debug_options.get(0).map(|s| s.clone());
    match opt {
      None => comp.add_artifact(TraceArtifact::new("ast", format!("{:?}", ast))),
      Some(ref s) if s == "compact" => comp.add_artifact(TraceArtifact::new("ast", format!("{:?}", ast))),
      Some(ref s) if s == "expanded" => comp.add_artifact(TraceArtifact::new("ast", format!("{:#?}", ast))),
      Some(ref s) if s == "trace" => comp.add_artifact(TraceArtifact::new_parse_trace(trace)),
      Some(ref x) => println!("Bad parsing debug option: {}", x),
    };
  });
  ast.map_err(|err| format_parse_error(err, handle))
}

fn format_parse_error(error: parsing::ParseError, handle: &mut Schala) -> String {
  //TODO make token no longer be Optoinal
  if let Some(tok) = error.token {
    let line = tok.offset.0;
    let ch = tok.offset.1;
    let line_from_program = handle.source_reference.get_line(line);
    let location_pointer = format!("{}^", " ".repeat(ch));
    format!(r#"
{}
|
| {}
| {}
"#, error.msg, line_from_program, location_pointer)
  } else {
    format!("{}", error.msg)
  }
}

fn symbol_table(input: ast::AST, handle: &mut Schala, comp: Option<&mut UnfinishedComputation>) -> Result<ast::AST, String> {
  let add = handle.symbol_table.borrow_mut().add_top_level_symbols(&input);
  match add {
    Ok(()) => {
      let artifact = TraceArtifact::new("symbol_table", handle.symbol_table.borrow().debug_symbol_table());
      comp.map(|comp| comp.add_artifact(artifact));
      Ok(input)
    },
    Err(msg) => Err(msg)
  }
}

fn typechecking(input: ast::AST, handle: &mut Schala, comp: Option<&mut UnfinishedComputation>) -> Result<ast::AST, String> {
  let result = handle.type_context.typecheck(&input);

  comp.map(|comp| {
    let artifact = TraceArtifact::new("type", format!("{:?}", result));
    comp.add_artifact(artifact);
  });

  Ok(input)
}

fn ast_reducing(input: ast::AST, handle: &mut Schala, comp: Option<&mut UnfinishedComputation>) -> Result<reduced_ast::ReducedAST, String> {
  let ref symbol_table = handle.symbol_table.borrow();
  let output = input.reduce(symbol_table);
  comp.map(|comp| comp.add_artifact(TraceArtifact::new("ast_reducing", format!("{:?}", output))));
  Ok(output)
}

fn eval(input: reduced_ast::ReducedAST, handle: &mut Schala, comp: Option<&mut UnfinishedComputation>) -> Result<String, String> {
  comp.map(|comp| comp.add_artifact(TraceArtifact::new("value_state", handle.state.debug_print())));
  let evaluation_outputs = handle.state.evaluate(input, true);
  let text_output: Result<Vec<String>, String> = evaluation_outputs
    .into_iter()
    .collect();

  let eval_output: Result<String, String> = text_output
    .map(|v| { v.into_iter().intersperse(format!("\n")).collect() });
  eval_output
}

struct SourceReference {
  lines: Option<Vec<String>>
}

impl SourceReference {
  fn new() -> SourceReference {
    SourceReference { lines: None }
  }

  fn load_new_source(&mut self, source: &str) {
    //TODO this is a lot of heap allocations - maybe there's a way to make it more efficient?
    self.lines = Some(source.lines().map(|s| s.to_string()).collect());
  }

  fn get_line(&self, line: usize) -> String {
    self.lines.as_ref().and_then(|x| x.get(line).map(|s| s.to_string())).unwrap_or(format!("NO LINE FOUND"))
  }
}