aprell

#!/usr/bin/awk -f

# For every non-comment, non-blank line
!/(^#)|(^\s*$)/ {
    # n is initially zero, which is "" in a string context!
    numbers[n] = $0
    n++
}

END {

aprell

local function f() end
local function g() return end
local function h() return nil end

-- select can be used to count the number of returned values
print(select("#", f())) -- 0
print(select("#", g())) -- 0
print(select("#", h())) -- 1

-- Note the extra parentheses around the call to force exactly one result (nil)

aprell

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "tasking.h"
#include "async.h"

int fib(int);

TASK_DECL(int, fib, int n, n);

aprell

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "cilk_fake.h"

int fib(int);

void fib_spawn_helper(__cilkrts_stack_frame *sf, int *x, int n)
{
	CILK_FAKE_SPAWN_HELPER_PROLOG(*sf);

aprell

require "b"

aprell

touch $HOME/.mozilla/firefox/*.default/.parentlock

aprell

#!/usr/bin/awk -f

BEGIN {
    i = 0
}

{
    numbers[i++] = $1
}

aprell

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <cilk/cilk.h>

int A[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };

int main(void)
{
    int i;

aprell

diff --git a/Makefile b/Makefile
index 98a7141..a20738b 100644
--- a/Makefile
+++ b/Makefile
@@ -43,7 +43,13 @@ buildapp: $(BUILD)/buildapp ;
 
 $(BUILD)/.reqs:
 	@echo "Downloading requirements"
-	$(LISP_QL) --eval '(ql:quickload :$(NAME))' --quit
+	$(LISP_QL) --eval '(ql:quickload :$(NAME))' \

aprell

char *q = "char *q = %c%s%c; int main(void) { printf(q, 34, q, 34); return 0; }"; int main(void) { printf(q, 34, q, 34); return 0; }