Awesome q2a theme
0 votes
18 views
Consider the context-free grammar
G : S → aSbS | bSaS | ε
How many parse trees are there for the sentence ababababab ?

Doubt: When can Catalan number be used for finding number of parse trees? And what is the general procedure for finding the number of parse trees in a question like this where the number of such trees is large? Answer is 42.
in Compiler Design by (335 points) | 18 views
0
0
No mention of this in applications. :(
0

"Cn is the number of Dyck words[3] of length 2n. A Dyck word is a string consisting of n X's and n Y's such that no initial segment of the string has more Y's than X's. "

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jan 2020
  1. shashin

    1168 Points

  2. Vimal Patel

    308 Points

  3. Deepakk Poonia (Dee)

    305 Points

  4. Debapaul

    239 Points

  5. Satbir

    192 Points

  6. SuvasishDutta

    142 Points

  7. pranay562

    132 Points

  8. Pratyush Priyam Kuan

    119 Points

  9. tp21

    112 Points

  10. DukeThunders

    96 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,008 questions
1,516 answers
8,989 comments
89,815 users