TechQA.

Question

Grammar for a^n

score 120 · Answer 1 · 2015-06-15 10:39:32

0

Answer

120

Views

Grammar for a^n

120 views Asked by Themis Beris At 15 June 2015 at 10:39

score 117 · Answer 2 · 2015-06-19 00:44:29

Is there an algorithm for a compiler compiler that generates a recursive descent parser?

117 views Asked by Devin Wall At 19 June 2015 at 00:44

score 1295 · Answer 3 · 2016-12-14 02:45:50

Is $E_{LBA}$ a Turing recognizable language?

1.2k views Asked by rich At 14 December 2016 at 02:45

score 2917 · Answer 4 · 2016-12-18 18:52:17

The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable

2.9k views Asked by Celeste At 18 December 2016 at 18:52

score 906 · Answer 5 · 2016-12-21 22:24:16

Knuth's bit reversal explanation

906 views Asked by FranG At 21 December 2016 at 22:24

score 115 · Answer 6 · 2017-01-02 15:22:58

How do I determine the big O for my nested for loop?

115 views Asked by Selim At 02 January 2017 at 15:22

score 682 · Answer 7 · 2017-01-03 16:35:57

Nullable nonterminals

682 views Asked by Beniamin Ionut Dobre At 03 January 2017 at 16:35

score 443 · Answer 8 · 2014-11-26 10:46:27

YACC: finding shift/reduce conflicts in a grammar

443 views Asked by Neo At 26 November 2014 at 10:46

score 251 · Answer 9 · 2013-12-05 07:06:37

Can this function be simplified (made more "fast")?

251 views Asked by user3063864 At 05 December 2013 at 07:06

score 1335 · Answer 10 · 2013-12-12 03:23:21

how to intuitively think while Designing an NFA

1.3k views Asked by neerajDorle At 12 December 2013 at 03:23

TechQA.

List Question

Grammar for a^n

Is there an algorithm for a compiler compiler that generates a recursive descent parser?

Is $E_{LBA}$ a Turing recognizable language?

The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable

Knuth's bit reversal explanation

How do I determine the big O for my nested for loop?

Nullable nonterminals

YACC: finding shift/reduce conflicts in a grammar

Can this function be simplified (made more "fast")?

how to intuitively think while Designing an NFA

Popular Questions

Popular Tags

Trending Questions