Back to Results
First PageMeta Content
Formal languages / Language / Cognitive science / Mathematics / Parse tree / Parsing / Formal grammar / Equivalence / Context-free language / LR parser / Context-free grammar


Parse Trees • If w ∈ L(G), for some CFG, then w has a parse tree, which tells us the (syntactic) structure of w • w could be a program, a SQL-query, an XMLdocument, etc. • Parse trees are an alternative represent
Add to Reading List

Document Date: 2015-01-28 19:32:46


Open Document

File Size: 211,32 KB

Share Result on Facebook