| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

Some Victoriagate Links; This Is Why I Left StackOverflow; New TLS Implementation; Maths for Physicists; How I Am 8; 1000 Word Philosophy; Cyberpunk Reading List; Detailed Discussion of Message Dispatch in ParserCombinator Library for Julia; FizzBuzz in Julia w Dependent Types; kokko - Design Shop in Osaka; Summary of Greece, Currently; LLVM and GPUs; See Also; Schoolgirl Groyps (Maths); Japanese Lit; Another Example - Modular Arithmetic; Music from United; Read Agatha Christie for the Plot; A Constructive Look at TempleOS; Music Thread w Many Recommendations; Fixed Version; A Useful Julia Macro To Define Equality And Hash; k3b cdrom access, OpenSuse 13.1; Week 2; From outside, the UK looks less than stellar; Huge Fonts in VirtualBox; Keen - Complex Emergencies; The Fallen of World War II; Some Spanish Fiction; Calling C From Fortran 95; Bjork DJ Set; Z3 Example With Python; Week 1; Useful Guide To Starting With IJulia; UK Election + Media; Review: Reinventing Organizations; Inline Assembly With Julia / LLVM; Against the definition of types; Dumb Crypto Paper; The Search For Quasi-Periodicity...; Is There An Alternative To Processing?; CARDIAC (CARDboard Illustrative Aid to Computation); The Bolivian Case Against Chile At The Hague; Clear, Cogent Economic Arguments For Immigration; A Program To Say If I Am Working; Decent Cards For Ill People; New Photo; Luksic And Barrick Gold; President Bachelet's Speech; Baltimore Primer; libxml2 Parsing Stream; configure.ac Recipe For Library Path; The Davalos Affair For Idiots; Not The Onion: Google Fireside Chat w Kissinger; Bicycle Wheels, Inertia, and Energy; Another Tax Fraud; Google's Borg; A Verion That Redirects To Local HTTP Server; Spanish Accents For Idiots; Aluminium Cans; Advice on Spray Painting; Female View of Online Chat From a Male; UX Reading List; S4 Subgroups - Geometric Interpretation; Fucking Email; The SQM Affair For Idiots; Using Kolmogorov Complexity; Oblique Strategies in bash; Curses Tools; Markov Chain Monte Carlo Without all the Bullshit; Email Para Matias Godoy Mercado; The Penta Affair For Idiots; Example Code To Create numpy Array in C; Good Article on Bias in Graphic Design (NYTimes); Do You Backup github?; Data Mining Books; SimpleDateFormat should be synchronized; British Words; Chinese Govt Intercepts External Web To DDOS github; Numbering Permutations; Teenage Engineering - Low Price Synths; GCHQ Can Do Whatever It Wants; Dublinesque; A Cryptographic SAT Solver; Security Challenges; Word Lists for Crosswords; 3D Printing and Speaker Design; Searchable Snowden Archive; XCode Backdoored; Derived Apps Have Malware (CIA); Rowhammer - Hacking Software Via Hardware (DRAM) Bugs; Immutable SQL Database (Kinda); Tor GPS Tracker; That PyCon Dongle Mess...; ASCII Fluid Dynamics; Brandalism; Table of Shifter, Cassette and Derailleur Compatability; Lenovo Demonstrates How Bad HTTPS Is; Telegraph Owned by HSBC; Smaptop - Sunrise (Music); Equation Group (NSA); UK Torture in NI

© 2006-2015 Andrew Cooke (site) / post authors (content).

Snobol Like Matching in Python

From: "andrew cooke" <andrew@...>

Date: Tue, 30 Dec 2008 13:23:08 -0300 (CLST)

Found this while looking for info for work; need to go back when I have
more time and read it further.

http://www.wilmott.ca/python/patternmatching.html

Particularly like the array subset syntax for specifying repeats:
  * : [0:]
  + : [1:]
  ? : [0:1]
etc

Andrew

Rethinking Parsing

From: "andrew cooke" <andrew@...>

Date: Fri, 2 Jan 2009 21:56:30 -0300 (CLST)

I'm getting the urge to write another parsing library :o)

I like what was done in the work above and it seems like it could be
easily(?) made more general.  The existing package takes a list of
characters and generates labelled words.  It seems to me that could be
changed to generate a list of words.  Or even a list of arbitrary objects.
 And it also seems to me that the parsers could be changed to match not
just lists of characters, but lists of arbitrary objects.

If you do that then it can eat its own tail - you can have various levels
of parsers.  The way I see it, these constrict different levels in the
AST.

Does that make sense?  How is this different from normal?  There's a
slight difference in implementation - the source itself stores the new
stream, rather than it being returned by the parser.  I have no idea if
this is an improvement or not.  I need to read the code for the matcher
again.  Does it help with backtracking?  Is it just an implementation
detail?  What's wrong with returning the match?

Andrew

Stupid

From: "andrew cooke" <andrew@...>

Date: Sat, 3 Jan 2009 16:54:50 -0300 (CLST)

Prev comments were somewhat stupid.

With recursive descent the combinators construct a guided path down to the
matching against characters.  So there's no layered streams of characters
and tokens.

So what does the code in the paper give you?

First of all, it has some nice ideas about syntax.  Most of all - that by
using Python objects rather than just functions, you have  a lot more
freedom to play around.

Second, backtracking.

In addition, something that has always bugged me, and which I'd like to
improve: better diagnostics.

Andrew

Slice Mechanics

From: "andrew cooke" <andrew@...>

Date: Sat, 3 Jan 2009 20:43:23 -0300 (CLST)

I just ran some simple tests.  If the appropriate __ methods are
implemented then:

foo[1] calls foo.__getitem__(1)
foo[1:2] calls foo.__getslice(1, 2)
foo[1:2:3] calls foo.__getitem(slice(1,2,3))

but if __getslice__ is missing then foo[1:2} calls
foo.__getitem(slice(1,2,None)) - that means that getitem handles all
calls, but the single arg case is passed a simple value.

The slice() object looks like an ordinary object with start, stop, step
and indices attributes.

Andrew

More Ideas

From: "andrew cooke" <andrew@...>

Date: Sun, 4 Jan 2009 10:55:13 -0300 (CLST)

- Track deepest search via source for debugging

- Matching returns matched value or [value] or [(name, value)].  Latter
can be used to construct dictionaries.  Can return anything (via function)
but we support those via nice syntax.

- Node class that can be constructed from lists of (name, value). 
Implements iterator (all values) and attribute based (named values)
interface.  Several representations.  str returns matched string
(including unlabelled values).  Tree returns ascii format tree (with named
values only).

Andrew

Comment on this post