This is my just-for-fun Finite State Machine with Stack[?] https://github.com/mto/regular-expression
On Fri, Jul 8, 2011 at 10:49 PM, Huan Truong <[email protected]> wrote: > > Do you know the age of [1] LISP machine back then? > > Emacs' extensibility is restricted just by your imagination. > > E.g. Could you do screencast with Eclipse/Netbeans/IntelliJ? > > Emacs can! > > Man, I code in Turing tapes. > > Turing tapes' extensibility is restricted just by your imagination! > > Can you survive an electric shock on your hard drive with emacs? > Turing tapes can! > > I completely disagree with whoever thinks that you need to use > vi/vim/emacs let alone netbeans/eclipse. > > Once you go Turing, you can never go back. > _______________________________________________ > POST RULES : http://wiki.hanoilug.org/hanoilug:mailing_list_guidelines > _______________________________________________ > HanoiLUG mailing lists: http://lists.hanoilug.org/ > HanoiLUG wiki: http://wiki.hanoilug.org/ > HanoiLUG blog: http://blog.hanoilug.org/ > -- Minh Hoang TO eXoPlatform SAS, tang 8, building 18, Thai Ha, Ha Noi
<<330.gif>>
_______________________________________________ POST RULES : http://wiki.hanoilug.org/hanoilug:mailing_list_guidelines _______________________________________________ HanoiLUG mailing lists: http://lists.hanoilug.org/ HanoiLUG wiki: http://wiki.hanoilug.org/ HanoiLUG blog: http://blog.hanoilug.org/
