1 votes 1 votes Please post few examples of Linear Ambiguous Context Free Grammar. It would be helpful if you post grammars for famous languages. Theory of Computation context-free-language theory-of-computation context-free-grammar + – Mk Utkarsh asked Mar 22, 2018 • edited Mar 22, 2018 by Mk Utkarsh Mk Utkarsh 1.4k views answer comment Share Follow See all 20 Comments See all 20 20 Comments reply Show 17 previous comments ankitgupta.1729 commented Mar 22, 2018 reply Follow Share yes , I think It was easy but I was stupid to understand it :P .. 0 votes 0 votes Mk Utkarsh commented Mar 22, 2018 reply Follow Share no i'm more stupid :p 0 votes 0 votes ankitgupta.1729 commented Mar 22, 2018 reply Follow Share No, It happens with everyone ..Sometimes we don't understand easy things :) 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes a^i b^j c^k such that i=j or j=k this is linear and inherently ambiguous language more popularly its known as a^m b^m c^n $\cup$ a^m b^n c^n such that m,n>=1 PROVED BY OGDEN (Ogden's lemma) blackcloud answered Jan 15, 2020 blackcloud comment Share Follow See all 0 reply Please log in or register to add a comment.
