felko

#!/usr/bin/env python3
# coding: utf-8

import re
from collections import namedtuple
from functools import wraps


class ParseError(Exception):
	pass

felko

#!/usr/bin/env python3.4
# coding: utf-8

from collections import ChainMap

class Bytecode:
    def __init__(self, instructions):
        self.instructions = instructions

    def __str__(self):

felko

FIBONACCI SEQUENCE
You have to use an IDE or website in order to visualize the memory

+++++++>          The number of numbers to load
+>+>              Setup the two first numbers

<[<]>[
  [>]             Move to the right most ptr
  << [->>+>+<<<]  Store the first number in the 2 next free ptr
  >>>[<<<+>>>-]   Shift the last value in the first number ptr

felko

#!/usr/bin/env python3.5
# coding: utf-8

from abc import *
from collections import ChainMap, OrderedDict

import re
from operator import eq

felko

# -*- coding: utf-8 -*-

import random

HEIGHT = 32
BLOCK, VOID = True, False

class Block:
    blocks = []

felko

# Types

abstract type Type
end

struct VarType <: Type
    name  :: String
    rigid :: Bool
end

felko

#!/usr/bin/env python3.7
# coding: utf-8

import types
import functools
import abc
import typing
from contextlib import contextmanager
from collections import OrderedDict

felko

#!/usr/bin/env python3.8

import re
import sys
import os
import uuid
from pathlib import Path
import glob
import time
import datetime

felko

#!/usr/bin/env python3.8

import os
import sys
import re
import glob

ZK, = sys.argv[1:]

def make_link_regex(url_regex):

felko

{-# LANGUAGE
    LambdaCase
  , OverloadedLists
  , OverloadedStrings
  , RecordWildCards
  , BlockArguments
  , DeriveFunctor
  , TypeApplications
  , GeneralizedNewtypeDeriving
  #-}