Date: 2015-01-28 19:32:46Formal 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 representAdd to Reading ListSource URL: www.cs.ucr.eduDownload Document from Source Website File Size: 211,32 KBShare Document on Facebook
|