Computer Science

« first day (2101 days earlier) ← previous day next day → last day (2318 days later) »

parvin

1:31 AM

Hello. I have a question about Automata

I believe this solution is wrong, or maybe I'm making mistake

here is a language, for which the book has written a grammar

I belive the grammar should be like : " S->aSb , S->b "

5 hours later…

Evil

6:48 AM

@parvin no, it was ok.

2 hours later…

DeJaVo

9:06 AM

Hello

this is my question

I really need directions how to start thinking about it

3 hours later…

parvin

12:36 PM

@Evil tnx

Evil

1:00 PM

@parvin if you ommit the empty symbol, it never stops, right?

The S -> Ab is made for one 'b' more than 'a'. A -> aAb is for equal number of 'a' and 'b' and A -> Lambda is to stop rewritting.

It is to make it explicit.

If you use S -> b to stop recursion, it is effectively the same solution.

@parvin your solutionok is good too, these are equivalent, yours is a bit more concise.

5 hours later…

Bounty!

6:06 PM

Q: What would a language look like in which precise GC was implementable as a library?

Suppose you have some programming language with manual memory management. What features does this language need to have in order to be able to implement precise garbage collection as a library, and not as a fundamental language construct? By a precise GC I mean one where only pointers to the hea...