Live data from Hacker News

Vim 7.4 is released

vim.org

21–30 of 126 posts

Re: Vim 7.4 is released

#21
post #19
post #9

Complete Changelog ftp://ftp.vim.org/pub/vim/patches/7.3/README (it includes all changes from 7.3 up to 7.4) New patches for 7.4 will be in the patches/7.4 folder.

Wow. Actual .patch files. In 2013. This is ridiculous.

They're managed (or can be) using Bram Moolenaar's own system, Aap: http://www.a-a-p.org/

Re: Vim 7.4 is released

#23
post #15

Very nice! Does anyone remember that nifty syntax highlighting script from a while ago that required a recentish version of Vim? I'll install 7.4 and want to try that out, but I don't remember what it was...

It’s not syntax highlighting, but it needs a recent version of Vim: http://valloric.github.io/YouCompleteMe/ ?

Is it any good? It looks good, but stuff sometimes disappoint.

Re: Vim 7.4 is released

#25
post #8

Earlier quoted context omitted.

It sounds like someone read Russ Cox's work on regexp. Russ Cox? You know that regular expressions have existed since Kleene's first proposals, and everyone with a CS degrees knows that you can compile them to deterministic finite state automata. Right?

And that's why the RE2 implementation has existed equally long! Oh, wait.

There are many implementations the standard operations on finite state automata (determinization, minimization, intersection, concatenation, etc.) and nearly as many implementations of regular expressions[1]. Anyone who is in the trade (of text processing), including Bram Molenaar, will be aware that regular languages can be represented as finite state automata.

However, the problem is that not all regular expressions 'dialects' (most notably Perl regexes) are not regular languages and cannot be represented as a finite state automata. For instance, the introduction of back-references makes regular expressions non-regular.

So, it's not so much being enlightened by Russ Cox, but a trade-off between the convenience of some of the Perl extensions and the ability to apply matching in linear time. Also, for complex expressions, constructing the automaton can be slow.

[1] A small selection:

http://www.brics.dk/automaton/

http://www.let.rug.nl/~vannoord/Fsa/

http://www.complang.org/ragel/

http://open.xerox.com/Services/fst-nlp-tools

Some of the packages can also be used to construct transducers, weighted automata, etc.

Re: Vim 7.4 is released

#28
post #7

Earlier quoted context omitted.

It sounds like someone read Russ Cox's work on regexp. Russ Cox? You know that regular expressions have existed since Kleene's first proposals, and everyone with a CS degrees knows that you can compile them to deterministic finite state automata. Right?

Sadly not everybody is familiar with Automata theory - furthermore, I'm sure he knows and his link is about implementation and is none trivial and none obvious. I'm struggling to understand your negativity here..

I'm struggling to understand your negativity here..

Sorry, that was indeed a bit harsh. I wanted to point out that Bram Molenaar is probably well-aware of DFAs given how well-known they are and how many implementations there are available. I don't think Russ Cox has much too do with it and rather that it is driven by demand - linear time matching is attractive for syntax highlighting.

Re: Vim 7.4 is released

#29

It doesn't appear as though MacVim for 10.7 and 10.8 is released yet though the 10.6 is: http://code.google.com/p/macvim/downloads/list

The source is available if you build it yourself: https://github.com/b4winckler/macvim/releases. The binaries should be coming soon.
Post reply on HN