« first day (2101 days earlier)      last day (362 days later) » 

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…
6:48 AM
@parvin no, it was ok.
 
 
2 hours later…
9:06 AM
Hello
this is my question
I really need directions how to start thinking about it
 
 
3 hours later…
12:36 PM
@Evil tnx
 
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…
6:06 PM
5
Q: What would a language look like in which precise GC was implementable as a library?

korrokSuppose 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...

 
 
3 hours later…

« first day (2101 days earlier)      last day (362 days later) »