Status Update: Week 42

Well I started this week working on Scriptish, but I felt that I needed a break after working on it nearly every day for the past few weeks, so I spent about half the week working on a few other things.

Mozilla Lab's Prospector add-ons, which they announced two weeks ago, caught my attention and I started doing a little hacking on one of them; after spending some time using 2 of the currently 4 prospector add-ons I can tell you that I really like them, because they each focus on solving a single, particular, searching UX/usability issue in the context of the browser, and they're restartless!

Done

Scriptish

  • Released Scriptish 0.1b5 on the 19th.
  • Replacing the status bar icon with a frequently requested toolbar menu-button (It's a button & a drop-down menu), which is added to the add-on bar when Scriptish is installed for the first-time, or when Scriptish is upgraded from a version less than or equal to Scriptish 0.1b5.
  • Added a ID field to the new script window.

GitHub Flavored Markdown

MDC

I noticed that there wasn't any documentation on em:bootstrap on the page describing install manifests, so I added something basic with a link to more information.

Mozilla Labs: Prospector - Find Suggest

  • Performance tweaks.
  • Bug fix when using the find bar on a blank page, which causes an error to be thrown (issue #1).
  • Sorting words with equal frequency alphabetically (issue #3).
  • Changing the regular expression used to split words (issue #4).
  • Requiring words to be 3 characters or longer (issue #2).
  • Making the suggestion limit a user preference (issue #7).

[More]

Track Your rel=canonical URL With Google Analytics

I have been putting some (but very little) effort in to getting my pages tagged with rel=canonical and I have noticed that some of the time I was getting 1+ pageviews with a different page name that were actually for the same page in Google Analytics. So I decided that a little javascript to grab my rel="canonical" and dump that in to pageTracker._trackPageview(); would be nice.

[More]

Regular Expression to Determine if a Base 10 Number is Divisible by 5

This regular expression is a really easy one to write, but it will highlight that when writing regular expressions, it is sometimes easier to skip writing the DFA; which provided to be a useful step when I created a regular expression to determine if a base 10 number is divisible by 3.

The Problem:

Let L = { w | w mod 5 = 0 }, where the alphabet is {0,1,2,3,4,5,6,7,8,9}; give the DFA for L, and convert this in to a regular expression.

 

The Solution:

[More]

Regular Expression to determine if a base 10 number is divisible by 3

I decided to work out the regular expression for matching mod3=0 positive decimal (base 10) integers today. I had a dream about the problem last night (remembering an old lecture) and could not find my notes with the solution (if I even wrote it down). So, after googling around for a bit, I gave up, and worked the solution out myself, because it looks like a good void to fill on the interwebs.

The Problem:

Let L = { w | w mod 3 = 0 }, where the alphabet is {0,1,2,3,4,5,6,7,8,9}; give the Deterministic Finite Automaton (DFA) for L, and convert this to a regular expression.

 

The Solution (don't peak):

[More]

© Erik Vold 2007-2012. Contact Erik Vold. Top ^