Network profile

Sagar P

Reputation

309

Top tag

compilers

Next privilege

500 Rep.

Access review queues

Badges

Newest

Next badge

0/1

Impact

0 posts edited

0 helpful flags

32 votes cast

16 Questions

Votes Activity Newest Views

votes

answer

799

views

Basic doubt in converting PDA to DPDA

Feb 10 '18 at 1:35 Evil 9,202

votes

answer

views

Minimum pumping length of regular language

regular-languages pumping-lemma

Nov 27 '17 at 20:09 Yuval Filmus 250k

votes

answer

112

views

Completeness problem of TM

computability turing-machines semi-decidability

Nov 13 '17 at 12:27 Raphael♦ 69.5k

votes

answer

views

How does left-factoring prevent backtracking?

formal-grammars compilers

Oct 22 '17 at 21:06 fade2black 9,422

vote

answer

672

views

External fragmentation in fixed size partitioning

operating-systems memory-management

Jan 4 '18 at 12:42 Community♦ 1

vote

answers

views

Difference between Non R.E and Co-R.E [closed]

computability turing-machines

Dec 8 '17 at 7:41 Sagar P 309

vote

answer

views

Lexical analysis and reserved words

compilers lexical-analysis

Nov 29 '17 at 12:31 fade2black 9,422

vote

answer

154

views

Determining Ambiguity of grammar

context-free formal-grammars

Nov 7 '17 at 6:28 Hendrik Jan 25.1k

vote

answer

829

views

Complement of DPDA

closure-properties pushdown-automata

Oct 24 '17 at 6:44 Yuval Filmus 250k

vote

answers

416

views

Conflicts in LR(0) parser

compilers

Oct 23 '17 at 10:23 Sagar P 309

vote

answer

474

views

Lexical analysis [closed]

compilers

Oct 23 '17 at 9:57 fade2black 9,422

votes

answers

views

Infinite union of regular language

computability regular-languages

Dec 2 '17 at 20:32 Ariel 12.5k

votes

answer

views

Symbol table usage

compilers

Nov 29 '17 at 14:12 fade2black 9,422

votes

answer

121

views

Will the machine ever reach on any other state other than start state?

computability

Nov 14 '17 at 7:55 Jake 3,608

votes

answers

views

Pumping lemma for non regular languages [duplicate]

pumping-lemma

Nov 12 '17 at 4:10 Sagar P 309

votes

answers

views

Does this grammar generate regular language?

formal-languages regular-languages

Oct 25 '17 at 9:40 Raphael♦ 69.5k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

16 Questions

Basic doubt in converting PDA to DPDA

Minimum pumping length of regular language

Completeness problem of TM

How does left-factoring prevent backtracking?

External fragmentation in fixed size partitioning

Difference between Non R.E and Co-R.E [closed]

Lexical analysis and reserved words

Determining Ambiguity of grammar

Complement of DPDA

Conflicts in LR(0) parser

Lexical analysis [closed]

Infinite union of regular language

Symbol table usage

Will the machine ever reach on any other state other than start state?

Pumping lemma for non regular languages [duplicate]

Does this grammar generate regular language?