recategorized by
5,987 views
0 votes
0 votes

Context-free grammar can be recognized by 

  1. finite state automation
  2. $2$- way linear bounded automata
  3. push down automata
  4. both (B) and (C)
recategorized by

6 Answers

6 votes
6 votes

Context-free Grammar (CFG) can be recognized by both 2-way linear bounded automata and push down automata . 

regular --> dcfl --> ncfl --> Csl --> recursive -->recursive enumerable (implication)

4 votes
4 votes
Automata Recognized Grammar
Finite Automata Regular Grammar
PDA CFG
LBA CSG
TM REG

So Ans is B.

2-way LinearBounded Automata(it called so bcz Here TM's  Tapes both sides are restricted)

1 votes
1 votes

Context free Grammar can be recognize by both Linear Bounded Automata (LBA) and Push down Automata (PDA).

Hence,Option (D)Both B and C is the correct choice.

Answer:

Related questions

1 votes
1 votes
1 answer
1
admin asked Apr 2, 2020
1,649 views
The most powerful parser is$\text{SLR}$$\text{LALR}$Canonical $\text{LR}$Operator-precedence
1 votes
1 votes
1 answer
2
admin asked Apr 2, 2020
1,272 views
$\text{YACC}$ builds up$\text{SLR}$ parsing tableCanonical $\text{LR}$ parsing table$\text{LALR}$ parsing tableNone of these
0 votes
0 votes
2 answers
3
admin asked Apr 2, 2020
859 views
Which of the following can be accessed by transfer vector approach of linking?External data segmentsExternal subroutinesData located in other procedureAll of these
0 votes
0 votes
2 answers
4
admin asked Apr 2, 2020
934 views
Relocation bits used by relocating loader are specified byRelocating loader itselfLinkerAssemblerMacro processor