Awesome q2a theme
0 votes
29 views
Can a regular grammar be ambiguous? If so then plz give some example.
in Theory of Computation by (23 points) | 29 views
+2
yes possible

$S\rightarrow aS|Sa|a$
0
It can be ambiguous but never be inherently ambiguous
0
@shaik Masthan what is inherently ambiguous
0

dangling else is the best example for inherently ambiguity

https://en.wikipedia.org/wiki/Dangling_else

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users 2020 Aug 10 - 16
  1. jayeshasawa001

    11 Points

  2. Arkaprava

    6 Points

  3. Nilabja Sarkar

    4 Points

  4. 404 found

    3 Points

  5. shashankrustagi2021

    2 Points

  6. Ashutosh777

    2 Points

  7. Mellophi

    2 Points

  8. siddharths067

    1 Points

  9. sparshgarg

    1 Points

  10. sonam13

    1 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Aug 2020
  1. Mellophi

    152 Points

  2. Ashutosh777

    78 Points

  3. anurag sharma

    48 Points

  4. jayeshasawa001

    16 Points

  5. Kushagra गुप्ता

    15 Points

  6. Shaik Masthan

    13 Points

  7. srestha

    13 Points

  8. shashankrustagi2021

    12 Points

  9. munishchaturvedi

    10 Points

  10. arjun12

    10 Points

7,745 questions
1,842 answers
11,186 comments
95,103 users