0 votes 0 votes S -> S is a context-free grammar or not? Theory of Computation theory-of-computation context-free-grammar descriptive + – akankshadewangan24 asked Apr 21, 2017 • recategorized Jun 21, 2022 by Lakshman Bhaiya akankshadewangan24 405 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Yes it context free grammer The language is phi. Rameez Raza answered Apr 21, 2017 Rameez Raza comment Share Follow See all 3 Comments See all 3 3 Comments reply akankshadewangan24 commented Apr 22, 2017 reply Follow Share what is phi? 0 votes 0 votes Rameez Raza commented Apr 22, 2017 reply Follow Share An empty set nothing will be accepted 0 votes 0 votes akankshadewangan24 commented Apr 22, 2017 reply Follow Share ok got it 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes yes the language will be context free as the required condition are that the productions should be of the form A→ x A should belong to V x should belong to {V union T}* where V is set of Variables and T is set of terminals JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.
