BNFC.Backend.Agda

Agda backend.

Generate bindings to Haskell data types for use in Agda.

Example for abstract syntax generated in Haskell backend:

module CPP.Abs where

import Prelude (Char, Double, Integer, String)
import qualified Prelude as C (Eq, Ord, Show, Read)

import qualified Data.Text

newtype Ident = Ident Data.Text.Text
  deriving (C.Eq, C.Ord, C.Show, C.Read)

data Def = DFun Type Ident [Arg] [Stm]
  deriving (C.Eq, C.Ord, C.Show, C.Read)

data Arg = ADecl Type Ident
  deriving (C.Eq, C.Ord, C.Show, C.Read)

data Stm
    = SExp Exp
    | SInit Type Ident Exp
    | SBlock [Stm]
    | SIfElse Exp Stm Stm
  deriving (C.Eq, C.Ord, C.Show, C.Read)

data Exp

data Type = Type_bool | Type_int | Type_double | Type_void
  deriving (C.Eq, C.Ord, C.Show, C.Read)

This should be accompanied by the following Agda code:

module CPP.AST where

open import Agda.Builtin.Char using () renaming (Char to Char)
open import Agda.Builtin.Float public using () renaming (Float to Double)
open import Agda.Builtin.Int   public using () renaming (Int to Integer)
open import Agda.Builtin.List using () renaming (List to #List)
open import Agda.Builtin.String using () renaming
  ( String to #String
  ; primStringFromList to #stringFromList
  )

{-# FOREIGN GHC import Prelude (Char, Double, Integer, String) #-}
{-# FOREIGN GHC import qualified Data.Text #-}
{-# FOREIGN GHC import qualified CPP.Abs #-}
{-# FOREIGN GHC import CPP.Print (printTree) #-}

data Ident : Set where
  ident : #String → Ident

{-# COMPILE GHC Ident = data CPP.Abs.Ident (CPP.Abs.Ident) #-}

data Def : Set where
  dFun : (t : Type) (x : Ident) (as : List Arg) (ss : List Stm) → Def

{-# COMPILE GHC Def = data CPP.Abs.Def (CPP.Abs.DFun) #-}

data Arg : Set where
  aDecl : (t : Type) (x : Ident) → Arg

{-# COMPILE GHC Arg = data CPP.Abs.Arg (CPP.Abs.ADecl) #-}

data Stm : Set where
  sExp : (e : Exp) → Stm
  sInit : (t : Type) (x : Ident) (e : Exp) → Stm
  sBlock : (ss : List Stm) → Stm
  sIfElse : (e : Exp) (s s' : Stm) → Stm

{-# COMPILE GHC Stm = data CPP.Abs.Stm
  ( CPP.Abs.SExp
  | CPP.Abs.SInit
  | CPP.Abs.SBlock
  | CPP.Abs.SIfElse
  ) #-}

data Type : Set where
  typeBool typeInt typeDouble typeVoid : Type

{-# COMPILE GHC Type = data CPP.Abs.Type
  ( CPP.Abs.Type_bool
  | CPP.Abs.Type_int
  | CPP.Abs.Type_double
  | CPP.Abs.Type_void
  ) #-}

-- Binding the BNFC pretty printers.

printIdent  : Ident → String
printIdent (ident s) = String.fromList s

postulate
  printType    : Type    → String
  printExp     : Exp     → String
  printStm     : Stm     → String
  printArg     : Arg     → String
  printDef     : Def     → String
  printProgram : Program → String

{-# COMPILE GHC printType    = \ t -> Data.Text.pack (printTree (t :: CPP.Abs.Type)) #-}
{-# COMPILE GHC printExp     = \ e -> Data.Text.pack (printTree (e :: CPP.Abs.Exp))  #-}
{-# COMPILE GHC printStm     = \ s -> Data.Text.pack (printTree (s :: CPP.Abs.Stm))  #-}
{-# COMPILE GHC printArg     = \ a -> Data.Text.pack (printTree (a :: CPP.Abs.Arg))  #-}
{-# COMPILE GHC printDef     = \ d -> Data.Text.pack (printTree (d :: CPP.Abs.Def))  #-}
{-# COMPILE GHC printProgram = \ p -> Data.Text.pack (printTree (p :: CPP.Abs.Program)) #-}

Documentation

makeAgda

Arguments

:: String

Current time.

-> SharedOptions

Options.

-> CF

Grammar.

-> Backend

Entry-point for Agda backend.