2. creation of a parser-treeMany compilers creates after the lexical analyse a parser-tree, which represents the precedence of each token. In our example this would be: 2,3,+,"22",Val,*,=,x. With this notation it's easier to create the assembler code, because the parser-tree already represents it.