Copyright | (c) 2001 - 2004 Wolfgang Lux Martin Engelke Björn Peemöller 2015 Jan Tikovsky 2016 Finn Teegen |
---|---|
License | BSD-3-clause |
Maintainer | bjp@informatik.uni-kiel.de |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
The parser does not know the relative precedences of infix operators and therefore parses them as if they all associate to the right and have the same precedence. After performing the definition checks, the compiler is going to process the infix applications in the module and rearrange infix applications according to the relative precedences of the operators involved.