| acc ← {⍺←1 ⋄ ((⊢⍪(⍺⍺∘,¯1↑⊢))⍣⍺)⍵} | |
| cell ← {((⍺⍺ ⍵⍵⊢)⌺3)⍵} | |
| code ← {⎕IO←0 ⋄ (+/⍵)⌷⌽(7⍴3)⊤⍺} | |
| expnd ← {(,⍉↑⍺)/,¯1 0 1(+⍤0 1)⍵} | |
| gmob ← {⍵ snap⍨(⊂L),↓⍉↑(⍺⍺ ⍵⍵ ⍵⌷⍨∘⊂¯1 0 1∘+)¨L←⍸1<⍵} | |
| gr ← {(A rule P)(B patn P)⊣A B←⍺⊣P←2|⍵} | |
| initi ← {⍺←1 ⋄ ,[⎕IO-0.5]A,⍺,A←⍵⍴0} | |
| mcomp ← {((⌽⍣(B rule P))0 0 2)+(⊃A B←⍺)patn⊢P←⍵-0 2 0} | |
| mobile ← {((⍺⍺ ⍵⍵ ⍵⌷⍨⊂P)@P)⍵⊣P←¯1 0 1+⍸1<⍵} | |
| msimp ← {((⌽⍣A)0 0 2)+(B@2)P⊣A B←⍺ rule¨⊂P←⍵-0 2 0} |
Legend:
PC stands for parser combinators and PG — parser generators.
| Property | Generators | Combinators | Description |
|---|---|---|---|
| Power | ✔️ LALR | ➕ LL(∞) | PC can't handle left-recursive grammars (though, there's some article¹...). |
This gist is deprecated. You can find the latest instructions here.
Check whether it's already enabled:
$ locale -a | grep ja
| #!/usr/lib/python | |
| # -*- coding: utf-8 -*- | |
| # | |
| # This is a re-implementation of Python's timsort in Python | |
| # itself. This is purely for learning purposes. :) | |
| # References: [ | |
| # https://en.wikipedia.org/wiki/Timsort, | |
| # http://wiki.c2.com/?TimSort | |
| # ] | |
| # |
| module AlgorithmW | |
| // HINDLEY-MILNER TYPE INFERENCE | |
| // Based on http://catamorph.de/documents/AlgorithmW.pdf | |
| // (Now at http://web.archive.org/web/20170704013532/http://catamorph.de/documents/AlgorithmW.pdf) | |
| type Lit = | |
| | LInt of int | |
| | LBool of bool |
| use std::rc::Rc; | |
| trait HKT<U> { | |
| type C; // Current type | |
| type T; // Type with C swapped with U | |
| } | |
| macro_rules! derive_hkt { | |
| ($t:ident) => { | |
| impl<T, U> HKT<U> for $t<T> { |
| Require Import Coq.ZArith.ZArith. | |
| Require Import Coq.ZArith.Znumtheory. | |
| Require Import Coq.Sets.Ensembles. | |
| Require Import Coq.Sets.Finite_sets. | |
| Require Import Coq.PArith.BinPos. | |
| Definition Z_ens := Ensemble Z. | |
| Print Finite. | |
| Print Empty_set. | |
| Definition is_empty_set U A := forall x, ~(In U A x). |
| #!/bin/sh | |
| if test -f .merlin; then | |
| echo ".merlin already exists, bailing out ..." >&2 | |
| exit 1 | |
| else | |
| # You could add your default EXT's and such to this list: |
| This is my short-ish tutorial on how to implement closures in | |
| a simple functional language: Foo. | |
| First, some boilerplate. | |
| > {-# LANGUAGE DeriveFunctor, TypeFamilies #-} | |
| > import Control.Applicative | |
| > import Control.Monad.Gen | |
| > import Control.Monad.Writer | |
| > import Data.Functor.Foldable |
