Skip to main content

PL/SQL Brain Teaser: compile procedure with two declarations with same name?

I posted my second PL/SQL brain teaser on Twitter today @sfonplsql:

I can compile a procedure successfully even tho it contains two declarations with the same name for the identifier. Can you?

But Twitter is probably not the best way to do this, since it is not easy to capture every nuance in a tweet.

For example, Jonathan Whitehead asked: "Complier directives?"

Which leads me to "tweak" the brain teaser to fully elaborate as follows:

The Brain Teaser

I can compile a procedure successfully even though it contains two declarations with the same name for the identifier. And after compilation, if I run DBMS_PREPROCESSOR.print_post_processed_source to display the actual source code that was compiled into the database, it will show BOTH of those declarations.

OK....now, clever PL/SQL developers, can you post an example of code that will solve this teaser?

Comments

  1. Just don't reference them...

    CREATE OR REPLACE PROCEDURE p AS
    x NUMBER;
    x NUMBER;
    y NUMBER;
    BEGIN
    y := 5;
    END p;
    /

    ReplyDelete
  2. Nice work, Oren. Yes, that is the solution! It turns out that the PL/SQL compiler will not complain about two declarations with the same name - as long as you do not reference them in your code.

    ReplyDelete
  3. CREATE OR REPLACE PROCEDURE p AS
    x NUMBER := 8;
    x NUMBER := 9;
    y NUMBER;
    BEGIN
    DEClARE
    x NUMBER;
    BEGIN
    x := 6;
    END;
    END p;
    /

    ReplyDelete
  4. A pleasantly confusing variation on Oren's work. Nice, Atul.

    ReplyDelete
  5. Thanks Steven....

    How about


    CREATE OR REPLACE PROCEDURE p AS
    x NUMBER := -88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888889999999999999999999999999999999999999988;
    x NUMBER := 9;
    y NUMBER;
    BEGIN
    DEClARE
    x NUMBER;
    BEGIN
    x := 6;
    END;
    END p;
    /

    It gives error numeric overflow or underflow.......

    looks like Oracle Checks initial assignment

    ReplyDelete
  6. Yes, an assignment of a default value would certainly count as a usage of that variable.

    ReplyDelete
  7. Steven One more

    CREATE OR REPLACE PROCEDURE p AS
    x NUMBER := -9999999999999988;
    x NUMBER := abs(-9) * 0;
    y NUMBER;
    BEGIN
    DEClARE
    x NUMBER;
    BEGIN
    x := 6;
    END;
    END p;
    /

    It complies OK.

    ReplyDelete
  8. Well you know what means? I was wrong! :-)

    And that's what happens when you state things about code without actually verifying them. Thanks, Atul!

    ReplyDelete
  9. Hello Steven, All,
    I think that it is a compiler bug that it does allow the duplicate declaration in the first place.
    Steven, unrelated to this issue, I would thank you in advance if you can look into
    a feedback that I just posted on the plsqlchallenge site ... I know that you don't have access to e-mail ...
    Thanks a lot & Best Regards,
    Iudith

    ReplyDelete

Post a Comment

Popular posts from this blog

Running out of PGA memory with MULTISET ops? Watch out for DISTINCT!

A PL/SQL team inside Oracle made excellent use of nested tables and MULTISET operators in SQL, blending data in tables with procedurally-generated datasets (nested tables).  All was going well when they hit the dreaded: ORA-04030: out of process memory when trying to allocate 2032 bytes  They asked for my help.  The error occurred on this SELECT: SELECT  *    FROM header_tab trx    WHERE (generated_ntab1 SUBMULTISET OF trx.column_ntab)       AND ((trx.column_ntab MULTISET             EXCEPT DISTINCT generated_ntab2) IS EMPTY) The problem is clearly related to the use of those nested tables. Now, there was clearly sufficient PGA for the nested tables themselves. So the problem was in executing the MULTISET-related functionality. We talked for a bit about dropping the use of nested tables and instead doing everything in SQL, to avoid the PGA error. That would, however require lots of work, revamping algorithms, ensuring correctness, you know the score. Then my eyes snagge

How to Pick the Limit for BULK COLLECT

This question rolled into my In Box today: In the case of using the LIMIT clause of BULK COLLECT, how do we decide what value to use for the limit? First I give the quick answer, then I provide support for that answer Quick Answer Start with 100. That's the default (and only) setting for cursor FOR loop optimizations. It offers a sweet spot of improved performance over row-by-row and not-too-much PGA memory consumption. Test to see if that's fast enough (likely will be for many cases). If not, try higher values until you reach the performance level you need - and you are not consuming too much PGA memory.  Don't hard-code the limit value: make it a parameter to your subprogram or a constant in a package specification. Don't put anything in the collection you don't need. [from Giulio Dottorini] Remember: each session that runs this code will use that amount of memory. Background When you use BULK COLLECT, you retrieve more than row with each fetch,

Quick Guide to User-Defined Types in Oracle PL/SQL

A Twitter follower recently asked for more information on user-defined types in the PL/SQL language, and I figured the best way to answer is to offer up this blog post. PL/SQL is a strongly-typed language . Before you can work with a variable or constant, it must be declared with a type (yes, PL/SQL also supports lots of implicit conversions from one type to another, but still, everything must be declared with a type). PL/SQL offers a wide array of pre-defined data types , both in the language natively (such as VARCHAR2, PLS_INTEGER, BOOLEAN, etc.) and in a variety of supplied packages (e.g., the NUMBER_TABLE collection type in the DBMS_SQL package). Data types in PL/SQL can be scalars, such as strings and numbers, or composite (consisting of one or more scalars), such as record types, collection types and object types. You can't really declare your own "user-defined" scalars, though you can define subtypes  from those scalars, which can be very helpful from the p