Andrew Peterson Andruj

## ScriptingLanguageSpec.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                Andruj
                / ScriptingLanguageSpec.md
            
            
              Last active
              November 14, 2015 04:00
            
              
                A idea I had for a compile-to-js scripting language, primarily dealing with streams and file processing.
              
          
    A Node Scripting Language (TB Named)

Variables

// Traditional JavaScript Primitives
$1 = [1,2,3,4]
$2 = 'String'
$3 = true

  
## merge_sort.dart
List merge(List first, List second) {
  if(first.isEmpty) {
    return second;
  }
  if(second.isEmpty) {
    return first;
  }


  if(first.first <= second.first) {

## peaks.dart
// Must have be non-empty.
peaks(list) {
  if(list.length == 1) {
    return list.first;
  }

  if(list.length == 2) {
    return list.reduce((prev, curr) => curr >= prev ? curr : prev);
  }


## binary_search.dart
search(List list, int value, int min, int max) {
  if(min > max) {
    return null;
  }

  final int mid = (max + min) ~/ 2;

  if(value < list[mid]) {
     return search(list, value, min, mid - 1);
  }

## graph.dart
class Node {
  dynamic value;
  bool discovered = false;
  List<Node> links = [];
  int distance = 0;
  int weight;

  @override
  String toString() =>
  '''

## huffman_coding.dart
String encode(String message) {
  final Map frequencies = count(message);
  final sorted = frequencies.values.toList()
    ..sort();
  print(sorted);
  return '';
}

Map<String, int> count(String message) {
  Map freq = {};

## activity_selection.dart
class Activity {
  String name;
  int start;
  int end;

  @override
  String toString() => '$name: $start, $end';
}


## dynamic_fibonacci.dart
var results = {
  0: 0,
  1: 1
};

fib(n) {
  if(!results.containsKey(n)) {
    results[n] = fib(n - 1) + fib(n - 2);
  }


## bottom_up_fibonacci.dart
// This method takes O(n) time but only O(1) space.

fib(int n) {
	if(n == 0) {
    return 0;
  }
  else {
    var previousFib = 0;
    var currentFib = 1;
    while(--n != 0) { // loop is skipped if n = 1

## shortest_weighted_path.dart
import 'dart:math';

// The cost function c(i, j) = ...
final costs = [
  [1,2,3,4,6], // 0
  [5,6,2,3,1], // 1
  [6,2,0,2,6], // 2
  [5,0,2,8,6], // 3
  [1,2,3,4,5], // 4
// 0 1 2 3 4
	List merge(List first, List second) {
	if(first.isEmpty) {
	return second;
	}
	if(second.isEmpty) {
	return first;
	}


	if(first.first <= second.first) {
	// Must have be non-empty.
	peaks(list) {
	if(list.length == 1) {
	return list.first;
	}

	if(list.length == 2) {
	return list.reduce((prev, curr) => curr >= prev ? curr : prev);
	}
	search(List list, int value, int min, int max) {
	if(min > max) {
	return null;
	}

	final int mid = (max + min) ~/ 2;

	if(value < list[mid]) {
	return search(list, value, min, mid - 1);
	}
	class Node {
	dynamic value;
	bool discovered = false;
	List<Node> links = [];
	int distance = 0;
	int weight;

	@override
	String toString() =>
	'''
	String encode(String message) {
	final Map frequencies = count(message);
	final sorted = frequencies.values.toList()
	..sort();
	print(sorted);
	return '';
	}

	Map<String, int> count(String message) {
	Map freq = {};
	class Activity {
	String name;
	int start;
	int end;

	@override
	String toString() => '$name: $start, $end';
	}
	var results = {
	0: 0,
	1: 1
	};

	fib(n) {
	if(!results.containsKey(n)) {
	results[n] = fib(n - 1) + fib(n - 2);
	}
	// This method takes O(n) time but only O(1) space.

	fib(int n) {
	if(n == 0) {
	return 0;
	}
	else {
	var previousFib = 0;
	var currentFib = 1;
	while(--n != 0) { // loop is skipped if n = 1
	import 'dart:math';

	// The cost function c(i, j) = ...
	final costs = [
	[1,2,3,4,6], // 0
	[5,6,2,3,1], // 1
	[6,2,0,2,6], // 2
	[5,0,2,8,6], // 3
	[1,2,3,4,5], // 4
	// 0 1 2 3 4