Computer Science, asked by yogisahu01, 1 year ago

CFG can recognized by which grammer?

Answers

Answered by kvnmurty

0

CFG : context free grammar
CFG can be recognized by Pushdown automata , Finite state automata / machine in lexical analysis

Answered by Anonymous

8

CFG CAN BE RECOGNISED BY PUSHDOWN AUTOMATA.

Previous Question

Next Question

Similar questions

English, 7 months ago

Here's an opportunity to sharpen our brain! 1. __i__ 2. V __lat__n 3. H_dw_e 4. rses__e 5. S_ _tim__t 7. C_ _kb __k 9. Lo_i_ 10. D_ _ tingu___h 11. S__ur__e 12. __P__zard 13. Who__ sa 14.__at__ 15._od_rk. 16. __ma__ 17.H__rtbr __k 18. C__diti 19. An __cipa __on 20. __ rri__lum -...

Math, 7 months ago

2x^2-7x+3=0 solve by completing ...

Science, 7 months ago

materials which can be composed or cut easily are called _______ materials ...

Math, 1 year ago

Express2/3 of 1/4 of Rs25.20 as a fraction of 3/2 of Rs 36?

Physics, 1 year ago

flow chart for human eye and colourful world!

Math, 1 year ago

what is the value of pi...

Social Sciences, 1 year ago

Draw a cartoon to depict what elections do to the relationship between voters and political leaders...

Science, 1 year ago

The power of converging lens is 4 D and that of a diverging lens is 2.5 D . What will be the resultant power and nature of this combination of lenses placed closed together ???