pepasflo

$ for i in {1..10}; do ./gen-test-file.py 20 ; echo ; done
[{{}{[[(){}[[][[([[][()]])(())]][{}]]][{}]]}}]
{[{{}([{{({[[(({}{{}}()))]]})[{}]}}])}()]}
{[{[[{{[]}([{({(({([])}))}{[]})}]())()}]]}[]()]}
()[({({[]({[{()}{[()]}]}[])}{}()())})[]]
[[([]{}{([([[{(([{()[([])]}])[])[]}](){}(){[]}])])}[])]]
[({{[{[][({[]({[(){()[]}][]})}{}())]}]}{}})[]]
({[]{()}(((({({[]([[[]]])()})})){()}){}[])}()[])
[(){{{[((((([[{{}}({})]{}]([{}]())[])){})))]}}({}()[])}]
[{{{}}([[]([]()({}[]()))])}]

pepasflo

This is a follow-up to https://gist.github.com/pepasflo/89c93ef29447f4e22d0f6fb34a99cea7

The javascript implementation now matches the behavior of the python implementation (it loads the lexing grammar in from a file, and reads input from either stdin or a file).

The lexers now stream the tokens to stdout.

pepasflo

test: kth-from-end 
	./kth-from-end

kth-from-end: kth-from-end.c
	gcc -Wall -Werror -o kth-from-end kth-from-end.c

clean:
	rm -f kth-from-end

.PHONY: test kth-from-end

pepasflo

#!/usr/bin/env python

# A wrapper for 'pod' which detects if it should run 'bundle exec pod' or
# use the system 'pod' command, based on the presence of a 'Gemfile'.

# If a Gemfile exists in any directory above pwd, 'bundle exec pod' should
# be used.  Otherwise, the system 'pod' is used.

# Expected behavior:
#    $ pwd

pepasflo

#!/bin/bash

# use this to create a ~500,000 line C file for performance testing

set -e -o pipefail

if [ ! -e linux-4.19.c ]
then
    curl https://cdn.kernel.org/pub/linux/kernel/v4.x/linux-4.19.tar.xz | unxz | tar x
    cd linux-4.19

pepasflo

#!/usr/bin/env node

var assert = require('assert');

// Each lexed token is a array of three integers:
// 1. the "token type": an index into the list of token patterns.
// 2. the index into the input string marking the start of this token.
// 3. the length of the token.

// The list of "token types" which our lexer understands:

pepasflo

secrets/

pepasflo

Problem description:

https://www.interviewcake.com/question/python/two-egg-problem

A building has 100 floors. One of the floors is the highest floor an egg can be dropped from without breaking.

If an egg is dropped from above that floor, it will break. If it is dropped from that floor or below, it will be completely undamaged and you can drop the egg again.

Given two eggs, find the highest floor an egg can be dropped from without breaking, with as few drops as possible.

pepasflo

++ ./shuffle.py '[1]' '[2]' '[1,2]'
+ test True == True
++ ./shuffle.py '[1]' '[2]' '[2,1]'
+ test True == True
++ ./shuffle.py '[1,2]' '[3]' '[1,2,3]'
+ test True == True
++ ./shuffle.py '[1,2]' '[3]' '[1,3,2]'
+ test True == True
++ ./shuffle.py '[1,2]' '[3]' '[3,1,2]'
+ test True == True

pepasflo

#!/usr/bin/env python

import sys
import json

# Safe access for lists.
def lget(l, i, default=None):
    if len(l) <= i:
        return default
    else: