Largest :: [a] -> (a -> a -> Ordering) -> a largest (x:xs) cmp = go x xs where go largest [] = largest go largest (x:xs) = case cmp largest x of LT -> go x xs _ -> go largest xs
Its the second one. Hope this helps. :)
Answer:
Lexical rules that are defined in case of regular grammar are simple and the notation is quite easy to understand.
Regular expression are useful for defining constructs of identifiers or constants. e.g. a|b etc.
In the case of context-free, grammar is not simple and deals with the productions.
Context-free are useful in describing the nested constructs like if-else etc which are not defined by regular expressions.
These produce a higher level of reliability as it provides a medium for generating syntactical as well as semantic data. The grammar is context-free is a little complex.
Explanation:
