mnicky mnicky

## gist:df277548d70b50bd141d
"""A simple implementation of a greedy transition-based parser. Released under BSD license."""
from os import path
import os
import sys
from collections import defaultdict
import random
import time
import pickle

SHIFT = 0; RIGHT = 1; LEFT = 2;

## mvnc.sh
#!/bin/bash

RESET="\e[0m"
BLACK="\e[0;30m"
RED="\e[0;31m"
GREEN="\e[0;32m"
YELLOW="\e[0;33m"
BLUE="\e[0;34m"
MAGENTA="\e[0;35m"
CYAN="\e[0;36m"

## simple_infer.clj
;simple inference engine, using bruteforce propagation of modus ponens

;if the fact matches given clause (using supplied map of bindings),
;returns a map of established bindings, else returns false
(defn match
  ([clause fact] (match clause fact {}))
  ([clause fact bnds]
    (let [[cls & clsR] clause, [fct & fctR] fact]
      (cond (contains? #{:not=} cls) {:__special__ clause}
            (= clause fact) bnds

## github_lang_chart.sh
# Display chart of programming languages recognized by GitHub, sorted by their popularity.
# Be patient, it takes about one minute to complete on a good internet connection.

for i in `curl -s "https://github.com/languages" | grep -io "/languages/[^\"]*" | sort | uniq`; do curl -s "https://github.com$i" | grep "<h1>.*</h1>" | sed 's/the most/#1/g' | sed 's/.*<h1>\(.*\) <em>.*#\([0-9]*\).*/\2 \1/g'; done | sort -n

## stopwords-en
able
about
above
abst
accordance
according
accordingly
across
act
actually

## gist:3970044
Rozhovor v kancelárii.
 "Čaf. Workuje to?"
 "No čau, už si tu? Nie, zatiaľ sa mi to nepodarilo rozbehať."
 "Okej, tak sa logofni, ja sa na to luknem."
 "Inak júzujem tvoju stoličku, neva? Len si toto sejvnem a hneď ti ju ritarnem. Aj tak to musím ísť dať sajnúť hedovi."
 "Kľudne si ju nechaj, tejknem si tamtú."
 "Ako chceš, ja už idem za hedom, už si môžeš tejknúť svoju."

 U šéfa:
 "Šéfko, sajneš mi túto invojsu? Vendor ma už obháňa, že sme overďjú."

## gist:4027422
;; outlet code for implementing traditional macro expansion

;; macros

(define (expand form)
  (cond
   ((variable? form) form)
   ((literal? form) form)
   ((macro? (car form))
    (expand ((macro-function (car form)) form)))

## golomb-forest-eval.lisp
;Lisp in Lisp in Golomb forests.  Includes use of linked lists.
;Based on Paul Graham's version of McCarthy's paper and code.
;Uses only eq, cond, atom, quote, cons, car, and cdr.

(defun null. (x)
  (eq x '()))

(defun and. (x y)
  (cond (x
	 (cond (y 't)

## lis.py
################ Lispy: Scheme Interpreter in Python

## (c) Peter Norvig, 2010; See http://norvig.com/lispy.html

################ Symbol, Env classes

from __future__ import division

Symbol = str

## lisp_macros.lisp
;source: http://ideone.com/lEx0T
;explanation: http://stackoverflow.com/a/3685147

(defun null. (x)
      (eq x '()))

(defun and. (x y)
  (cond (x (cond (y 't) ('t '())))
        ('t '())))
	"""A simple implementation of a greedy transition-based parser. Released under BSD license."""
	from os import path
	import os
	import sys
	from collections import defaultdict
	import random
	import time
	import pickle

	SHIFT = 0; RIGHT = 1; LEFT = 2;
	#!/bin/bash

	RESET="\e[0m"
	BLACK="\e[0;30m"
	RED="\e[0;31m"
	GREEN="\e[0;32m"
	YELLOW="\e[0;33m"
	BLUE="\e[0;34m"
	MAGENTA="\e[0;35m"
	CYAN="\e[0;36m"
	;simple inference engine, using bruteforce propagation of modus ponens

	;if the fact matches given clause (using supplied map of bindings),
	;returns a map of established bindings, else returns false
	(defn match
	([clause fact] (match clause fact {}))
	([clause fact bnds]
	(let [[cls & clsR] clause, [fct & fctR] fact]
	(cond (contains? #{:not=} cls) {:__special__ clause}
	(= clause fact) bnds
	# Display chart of programming languages recognized by GitHub, sorted by their popularity.
	# Be patient, it takes about one minute to complete on a good internet connection.

	for i in `curl -s "https://github.com/languages" \| grep -io "/languages/[^\"]" \| sort \| uniq`; do curl -s "https://github.com$i" \| grep "<h1>.</h1>" \| sed 's/the most/#1/g' \| sed 's/.<h1>\(.\) <em>.#\([0-9]\).*/\2 \1/g'; done \| sort -n
	able
	about
	above
	abst
	accordance
	according
	accordingly
	across
	act
	actually
	Rozhovor v kancelárii.
	"Čaf. Workuje to?"
	"No čau, už si tu? Nie, zatiaľ sa mi to nepodarilo rozbehať."
	"Okej, tak sa logofni, ja sa na to luknem."
	"Inak júzujem tvoju stoličku, neva? Len si toto sejvnem a hneď ti ju ritarnem. Aj tak to musím ísť dať sajnúť hedovi."
	"Kľudne si ju nechaj, tejknem si tamtú."
	"Ako chceš, ja už idem za hedom, už si môžeš tejknúť svoju."

	U šéfa:
	"Šéfko, sajneš mi túto invojsu? Vendor ma už obháňa, že sme overďjú."
	;; outlet code for implementing traditional macro expansion

	;; macros

	(define (expand form)
	(cond
	((variable? form) form)
	((literal? form) form)
	((macro? (car form))
	(expand ((macro-function (car form)) form)))
	;Lisp in Lisp in Golomb forests. Includes use of linked lists.
	;Based on Paul Graham's version of McCarthy's paper and code.
	;Uses only eq, cond, atom, quote, cons, car, and cdr.

	(defun null. (x)
	(eq x '()))

	(defun and. (x y)
	(cond (x
	(cond (y 't)
	################ Lispy: Scheme Interpreter in Python

	## (c) Peter Norvig, 2010; See http://norvig.com/lispy.html

	################ Symbol, Env classes

	from __future__ import division

	Symbol = str
	;source: http://ideone.com/lEx0T
	;explanation: http://stackoverflow.com/a/3685147

	(defun null. (x)
	(eq x '()))

	(defun and. (x y)
	(cond (x (cond (y 't) ('t '())))
	('t '())))