-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | ackend-lalr
--   
--   Happy is a parser generator for Haskell. Given a grammar specification
--   in BNF, Happy generates Haskell code to parse the grammar. Happy works
--   in a similar way to the <tt>yacc</tt> tool for C.
--   
--   This library provides the following functionality:
--   
--   <ul>
--   <li>Data type definitions for the Grammar AST type, capturing the
--   information in .y-files (Happy.Grammar)</li>
--   <li>A parser for happy grammar files (.y) to produce a Grammar
--   (Happy.Frontend.*)</li>
--   <li>Implementations of the text book algorithms that compute the LR
--   action and goto tables for the given <a>Grammar</a>
--   (Happy.Tabular.*)</li>
--   <li>An LALR code generator to produce table-driven, deterministic
--   parsing code in Haskell (Happy.Backend.LALR.*)</li>
--   <li>A (less maintained) GLR code generator to produce table-driven,
--   non-deterministic parsing code in Haskell, where ambiguous parses
--   produce multiple parse trees (Happy.Backend.GLR.*)</li>
--   </ul>
@package happy-lib:backend-lalr
@version 2.1.7

module Happy.Backend.LALR
lalrBackendDataDir :: IO String
magicFilter :: Maybe String -> String -> String
importsToInject :: Bool -> String
langExtsToInject :: [String]
defines :: Bool -> Bool -> String

module Happy.Backend.LALR.ProduceCode
produceParser :: Grammar String -> Maybe AttributeGrammarExtras -> Directives -> ActionTable -> GotoTable -> [String] -> Maybe String -> Maybe String -> Bool -> Bool -> String
