+/* Copyright (C) 2000, HELM Team.
+ *
+ * This file is part of HELM, an Hypertextual, Electronic
+ * Library of Mathematics, developed at the Computer Science
+ * Department, University of Bologna, Italy.
+ *
+ * HELM is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ *
+ * HELM is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with HELM; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
+ * MA 02111-1307, USA.
+ *
+ * For details, see the HELM World-Wide-Web page,
+ * http://cs.unibo.it/helm/.
+ */
+
%{
open Cic;;
module U = UriManager;;
let uri_of_id_map = Hashtbl.create 53;;
- let binders = ref [];;
-
let get_index_in_list e =
let rec aux i =
function
in
aux 1
;;
+
+ let get_cookingno uri =
+ UriManager.relative_depth !CicTextualParser0.current_uri uri 0
+ ;;
+
%}
%token <string> ID
%token <int> META
%token <UriManager.uri * int * int> INDCONURI
%token ALIAS
%token LPAREN RPAREN PROD LAMBDA COLON DOT SET PROP TYPE CAST IMPLICIT
-%token LETIN FIX COFIX SEMICOLON LCURLY RCURLY CASE EOF
+%token LETIN FIX COFIX SEMICOLON LCURLY RCURLY CASE ARROW EOF
%start main
%type <Cic.term option> main
%%
{ let uri = UriManager.string_of_uri $1 in
let suff = (String.sub uri (String.length uri - 3) 3) in
match suff with
- "con" -> Const ($1,0)
+ "con" ->
+ let cookingno = get_cookingno $1 in
+ Const ($1,cookingno)
| "var" -> Var $1
| _ -> raise (InvalidSuffix suff)
}
- | INDTYURI { MutInd (fst $1, 0, snd $1) }
+ | INDTYURI
+ { let cookingno = get_cookingno (fst $1) in
+ MutInd (fst $1, cookingno, snd $1) }
| INDCONURI
- { let (uri,tyno,consno) = $1 in MutConstruct (uri, 0, tyno, consno) }
+ { let (uri,tyno,consno) = $1 in
+ let cookingno = get_cookingno uri in
+ MutConstruct (uri, cookingno, tyno, consno) }
| ID
{ try
- Rel (get_index_in_list (Name $1) !binders)
+ Rel (get_index_in_list (Name $1) !CicTextualParser0.binders)
with
Not_found ->
Hashtbl.find uri_of_id_map $1
}
| CASE LPAREN expr COLON INDTYURI SEMICOLON expr RPAREN LCURLY branches RCURLY
- { MutCase (fst $5, 0, snd $5, $7, $3, $10) }
+ { let cookingno = get_cookingno (fst $5) in
+ MutCase (fst $5, cookingno, snd $5, $7, $3, $10) }
| CASE LPAREN expr COLON ID SEMICOLON expr RPAREN LCURLY branches RCURLY
{ try
- let _ = get_index_in_list (Name $5) !binders in
+ let _ = get_index_in_list (Name $5) !CicTextualParser0.binders in
raise InductiveTypeURIExpected
with
Not_found ->
match Hashtbl.find uri_of_id_map $5 with
- MutInd (uri,0,typeno) -> MutCase (uri, 0, typeno, $7, $3, $10)
+ MutInd (uri,cookingno,typeno) ->
+ MutCase (uri, cookingno, typeno, $7, $3, $10)
| _ -> raise InductiveTypeURIExpected
}
- | FIX ID LCURLY fixfuns RCURLY
- { let fixfuns = $4 in
+ | fixheader LCURLY exprseplist RCURLY
+ { let fixfunsdecls = snd $1 in
+ let fixfunsbodies = $3 in
let idx =
let rec find idx =
function
[] -> raise Not_found
- | (name,_,_,_)::_ when name = $2 -> idx
+ | (name,_,_)::_ when name = (fst $1) -> idx
| _::tl -> find (idx+1) tl
in
- find 0 fixfuns
+ find 0 fixfunsdecls
in
- Fix (idx,fixfuns)
+ let fixfuns =
+ List.map2 (fun (name,recindex,ty) bo -> (name,recindex,ty,bo))
+ fixfunsdecls fixfunsbodies
+ in
+ for i = 1 to List.length fixfuns do
+ CicTextualParser0.binders := List.tl !CicTextualParser0.binders
+ done ;
+ Fix (idx,fixfuns)
}
- | COFIX ID LCURLY cofixfuns RCURLY
- { let cofixfuns = $4 in
+ | cofixheader LCURLY exprseplist RCURLY
+ { let cofixfunsdecls = (snd $1) in
+ let cofixfunsbodies = $3 in
let idx =
let rec find idx =
function
[] -> raise Not_found
- | (name,_,_)::_ when name = $2 -> idx
+ | (name,_)::_ when name = (fst $1) -> idx
| _::tl -> find (idx+1) tl
in
- find 0 cofixfuns
+ find 0 cofixfunsdecls
in
- CoFix (idx,cofixfuns)
+ let cofixfuns =
+ List.map2 (fun (name,ty) bo -> (name,ty,bo))
+ cofixfunsdecls cofixfunsbodies
+ in
+ for i = 1 to List.length cofixfuns do
+ CicTextualParser0.binders := List.tl !CicTextualParser0.binders
+ done ;
+ CoFix (idx,cofixfuns)
}
| IMPLICIT { Implicit }
| SET { Sort Set }
| META { Meta $1 }
| LPAREN expr expr exprlist RPAREN { Appl ([$2;$3]@$4) }
| pihead expr
- { binders := List.tl !binders ; Prod (fst $1, snd $1,$2) }
+ { CicTextualParser0.binders := List.tl !CicTextualParser0.binders ;
+ Prod (fst $1, snd $1,$2) }
| lambdahead expr
- { binders := List.tl !binders ; Lambda (fst $1, snd $1,$2) }
+ { CicTextualParser0.binders := List.tl !CicTextualParser0.binders ;
+ Lambda (fst $1, snd $1,$2) }
| letinhead expr
- { binders := List.tl !binders ; LetIn (fst $1, snd $1,$2) }
+ { CicTextualParser0.binders := List.tl !CicTextualParser0.binders ;
+ LetIn (fst $1, snd $1,$2) }
;
-fixfuns:
- ID LPAREN NUM RPAREN COLON expr LETIN expr
- { [$1,$3,$6,$8] }
- | ID LPAREN NUM RPAREN COLON expr LETIN expr SEMICOLON fixfuns
- { ($1,$3,$6,$8)::$10 }
+fixheader:
+ FIX ID LCURLY fixfunsdecl RCURLY
+ { let bs = List.rev_map (function (name,_,_) -> Name name) $4 in
+ CicTextualParser0.binders := bs@(!CicTextualParser0.binders) ;
+ $2,$4
+ }
+;
+fixfunsdecl:
+ ID LPAREN NUM RPAREN COLON expr
+ { [$1,$3,$6] }
+ | ID LPAREN NUM RPAREN COLON expr SEMICOLON fixfunsdecl
+ { ($1,$3,$6)::$8 }
;
-cofixfuns:
- ID COLON expr LETIN expr
- { [$1,$3,$5] }
- | ID COLON expr LETIN expr SEMICOLON cofixfuns
- { ($1,$3,$5)::$7 }
+cofixheader:
+ COFIX ID LCURLY cofixfunsdecl RCURLY
+ { let bs = List.rev_map (function (name,_) -> Name name) $4 in
+ CicTextualParser0.binders := bs@(!CicTextualParser0.binders) ;
+ $2,$4
+ }
+;
+cofixfunsdecl:
+ ID COLON expr
+ { [$1,$3] }
+ | ID COLON expr SEMICOLON cofixfunsdecl
+ { ($1,$3)::$5 }
;
pihead:
- PROD ID COLON expr DOT
- { binders := (Name $2)::!binders ; (Cic.Name $2, $4) }
+ PROD ID COLON expr DOT
+ { CicTextualParser0.binders := (Name $2)::!CicTextualParser0.binders ;
+ (Cic.Name $2, $4) }
+ | expr ARROW
+ { CicTextualParser0.binders := Anonimous::!CicTextualParser0.binders ;
+ (Anonimous, $1) }
+ | LPAREN expr RPAREN ARROW
+ { CicTextualParser0.binders := Anonimous::!CicTextualParser0.binders ;
+ (Anonimous, $2) }
;
lambdahead:
LAMBDA ID COLON expr DOT
- { binders := (Name $2)::!binders ; (Cic.Name $2, $4) }
+ { CicTextualParser0.binders := (Name $2)::!CicTextualParser0.binders ;
+ (Cic.Name $2, $4) }
;
letinhead:
LAMBDA ID LETIN expr DOT
- { binders := (Name $2)::!binders ; (Cic.Name $2, $4) }
+ { CicTextualParser0.binders := (Name $2)::!CicTextualParser0.binders ;
+ (Cic.Name $2, $4) }
;
branches:
{ [] }
{ [] }
| expr exprlist { $1::$2 }
;
+exprseplist:
+ expr { [$1] }
+ | expr SEMICOLON exprseplist { $1::$3 }
+;
alias:
ALIAS ID CONURI
- { Hashtbl.add uri_of_id_map $2 (Cic.Const ($3,0)) }
+ { let cookingno = get_cookingno $3 in
+ Hashtbl.add uri_of_id_map $2 (Cic.Const ($3,cookingno)) }
| ALIAS ID INDTYURI
- { Hashtbl.add uri_of_id_map $2 (Cic.MutInd (fst $3, 0, snd $3)) }
+ { let cookingno = get_cookingno (fst $3) in
+ Hashtbl.add uri_of_id_map $2 (Cic.MutInd (fst $3, cookingno, snd $3)) }
| ALIAS ID INDCONURI
{ let uri,indno,consno = $3 in
- Hashtbl.add uri_of_id_map $2 (Cic.MutConstruct (uri, 0, indno ,consno))
+ let cookingno = get_cookingno uri in
+ Hashtbl.add uri_of_id_map $2
+ (Cic.MutConstruct (uri, cookingno, indno ,consno))
}
projects / helm.git / blobdiff