From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | Joe Conway <mail(at)joeconway(dot)com> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Proposal: stand-alone composite types |
Date: | 2002-08-08 03:25:52 |
Message-ID: | 29150.1028777152@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers pgsql-patches |
Joe Conway <mail(at)joeconway(dot)com> writes:
> I'm working on stand-alone composite types and running into a
> reduce/reduce problem with the grammer. Any suggestions would be
> appreciated. Here's what I have:
> DefineStmt:
> | CREATE TYPE_P qualified_name AS
> '(' TableFuncElementList ')'
Use any_name, not qualified_name. As-is, you're forcing the parser
to try to distinguish the two forms of CREATE TYPE before it can
see anything that would tell the difference.
In hindsight I think it was a mistake to set up RangeVar/qualified_name
as a distinct reduction path from non-relation qualified names ---
we'd have been better off using a single production and a uniform
intermediate representation. But I haven't had time to investigate
simplifying the grammar that way.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Hannu Krosing | 2002-08-08 03:30:37 | Re: Open 7.3 items |
Previous Message | Christopher Kings-Lynne | 2002-08-08 03:16:34 | Re: python patch |
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2002-08-08 04:00:31 | Re: Polygon contrib |
Previous Message | Tom Lane | 2002-08-08 03:12:27 | Re: improve SET CONSTRAINTS |