Please create an account to participate in the Slashdot moderation system

 



Forgot your password?
typodupeerror
×

Comment Re:wrong level of complexity (Score 1) 184

Not the grammar you're thinking of. In Computer Science grammars are used to represent languages, and the sentences that can be represented by them. For example, the language that generates all sentences of the form a^n b^n, meaning n a's followed by n b's. Grammars in this sense are a collection of rules, such as: S -> aSb We say that S is a terminal, and a and b are non-terminals. Now there are restrictions on the types of rules we can have, which creates a hierarchy of grammars, where regular grammars are on one side of the spectrum (one terminal S creates one non-terminal a), and unrestricted grammars are on the opposite side (no rules). Unrestricted grammars are obviously much more complicated to deal with, but their power is immense. Hence when the grandparent talked about using an unrestricted grammar, he meant that we don't have the power to deal with it, but if we did, hoooo boy :)

Comment Arch Linux (Score 1) 660

I have been playing around with this very minimalist distro the past few days. I can get it to go from completly shut down to a graphical login in about 35 seconds. This includes grub and everything. Getting it to boot into a text-only login will probably take less time, but I haven't benchmarked it yet.

Slashdot Top Deals

This file will self-destruct in five minutes.

Working...