My Math Forum  

Go Back   My Math Forum > College Math Forum > Applied Math

Applied Math Applied Math Forum

LinkBack Thread Tools Display Modes
July 28th, 2011, 12:55 AM   #1
Joined: May 2011

Posts: 38
Thanks: 0

derivation trees question

Let G be the grammar with V = {a, b, c, S}; T = {a, b, c}; starting symbol S; and productions S -> abS, S -> bcS, S -> bbS, S -> a, and S -> cb. Construct
derivation trees for
a) bcbba
b) bbbcbba
c) bcabbbbbcb
lamhmh is offline  
July 28th, 2011, 02:12 AM   #2
Senior Member
Joined: Feb 2009
From: Adelaide, Australia

Posts: 1,519
Thanks: 3

Re: derivation trees question

Please don't dump your entire assignment on the forum. You have to show what you have done and where you are stuck.
aswoods is offline  

  My Math Forum > College Math Forum > Applied Math

derivation, question, trees

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Symbolic logic, SD rules, sub-derivation question cag805 Applied Math 1 December 22nd, 2013 01:09 PM
Proofs on Trees Singularity Applied Math 0 April 19th, 2011 09:29 PM
Spanning Trees uniquereason Applied Math 0 November 4th, 2010 01:03 PM
Object oriented and trees question Nivg Computer Science 0 May 3rd, 2010 05:21 PM
TRIG DERIVATION QUESTION!! dagitt Algebra 1 June 2nd, 2008 02:31 PM

Copyright © 2018 My Math Forum. All rights reserved.