I am taking a course on the formal foundations of programming, one of things we have covered is proving certain properties of languages, i have done most of the work, but I am stuck on these two quest
One of the things that I admire about Python is its distinction between mutable and immutable types. Having spent a while programming in c before coming to Python, I was astonished at how easily Pytho
Let\'s suppose I have the following grammar: S → X X → a | ϵ If that grammar wouldn\'t have ϵ involved, I would construct the first state like:
I\'m trying to create a postfix to infix converter, and I\'m unable to create the grammar for postfix formulas. I\'ve been also looking for it for a while without success..
Do the 开发者_如何转开发main Javascript interpreters have any built in optimisation at all? I\'m thinking of very simple cases like
I am having a dispute with another fellow programmer, over the scope of interfaces. suppose we have the following:
What class of languages do real modern regexes actually recognise? Whenever there is an unbounded length capturing group with a back-reference (e.g. (.*)_\\1) a regex is now matching a non-regular la
I have a language with statements of 4 kinds: s00, s01, s10, s11 where a leading 1 means initial keyword, a trailing 1 means terminated, and I have a separator \";\". I can terminate any statement wit
I can\'t find any applet or program online to convert a context free language into a push down automata... any help would be gre开发者_StackOverflow中文版atly appreciated.It is very easy to do by hand
Im looki开发者_Python百科ng for an algorithm which outputs if the intersection of a regular expression and a contex free grammar is empty or not. I know that this problem is decidable, however, I cann
加载中,请稍侯......