Observe the following type definitions:

type token $=|$ True$\_$tok $|$ False$\_$tok $|$ And$\_$tok $|$ Or$\_$tok type bool$\_$ast $=|$ Bool of bool $|$ And of bool$\_$ast $*$ bool$\_$ast $|$ Or of bool$\_$ast $*$ bool$\_$ast

For this CFG:

S $->$ A or S $|$ A A $->$ B and A $|$ B B $->$ true $|$ false

Given the above, what's the lexed$/$tokenized form of the following string?

"true and false or true"

What's the parsed form of the string?