Source code

Dim a() As String : a = Split("Ene,Mene,Muh", ",")

Source code

 int iarr[] = {1, 2, 3};

Source code

 Option Explicit
Private Type MyType
    IntVal1 As Integer
    intVal2 As Integer
    StrVal  As String
End Type
Private Type ArrayOfMyType
    Arr() As MyType
End Type
Private Function New_ArrayOfMyType(ParamArray params()) As ArrayOfMyType
    Dim i As Integer, j As Integer
    Dim u As Integer: u = (UBound(params) + 1) / 3 - 1
    With New_ArrayOfMyType
        ReDim .Arr(0 To u)
        For i = 0 To u
            .Arr(i).IntVal1 = CInt(params(j)): j = j + 1
            .Arr(i).intVal2 = CInt(params(j)): j = j + 1
            .Arr(i).StrVal = CStr(params(j)): j = j + 1
        Next
    End With
End Function
Private Function MyTypeToString(this As MyType) As String
    With this
        MyTypeToString = CStr(.IntVal1) & " " & _
                         CStr(.intVal2) & " " & _
                         .StrVal
    End With
End Function
Private Sub Command1_Click()
    Dim a As ArrayOfMyType
    a = New_ArrayOfMyType(1, 2, "first", 3, 4, "second", 5, 6, "third")
    MsgBox MyTypeToString(a.Arr(0))
End Sub

Jabaco Source

MsgBox Me.ContentFrame.Parent.getComponentCount()

Source code

Option Explicit

'  cf. http://de.wikipedia.org/wiki/Ackermannfunktion

Public Function Ackermann(m As Long, n As Long) As Long
   If m = 0 Then
      Ackermann = n + 1
   Else 
      If n = 0 Then
         Ackermann = Ackermann(m - 1, 1)
      Else
         Ackermann = Ackermann(m - 1, Ackermann(m, n - 1))
      End If
   End If
End Function

Public Function AckermannIterative(m As Long, n As Long) As Long
     Do While m <> 0
         If n = 0 Then
             n = 1
         Else
             n = AckermannIterative(m, n - 1)
         End If
         m = m - 1
     Loop
     
     AckermannIterative = n + 1
End Function

Source code

public class jAckermann 
{ 
    public static long nesting; 
    public static long nestingMax; 

    // start with 
    // 
    // java -Xss4M -Xms32M -Xmx128M jAckermann 
    
    public static void main(String args[]) 
    { 
        Exception Err = null; 
        Exception h3 = null; 
        MyThread t; 

        t = new MyThread(); 

        t.start(); 
     } 

public static void runTest() 
    { 
        long res; 

        nesting = 0; 
        System.out.println("Ackermann test started ..."); 
        try { 
                res = AckermannIterative(4, 1); 
                // res = Ackermann(4, 0); 
                System.out.println("OK! res = " + res + " max. nesting = " + nestingMax); 
        } 
        catch (StackOverflowError e) { 
                System.out.println("Stack overflow! nesting = " + nesting); 
        } 
    }   

//                                 nesting 
// A(3, 6) = 509                 508 
// A(3, 7) = 1021         1021 - 1023 
// A(4, 0) = 13                 12 - 16 
// A(4, 1) = 65533            65532 

public static long Ackermann(long m, long n) throws StackOverflowError 
    { 
        long Ackermann = 0L; 
        Exception Err = null; 
        Exception h8 = null; 

        nesting++; 

        if (nesting > nestingMax) { 
                nestingMax = nesting; 
        } 
        
        if(m == (long)0) 
        { 
                Ackermann = n + (long)1; 
        } else 
        { 
                if(n == (long)0) 
                { 
                        Ackermann = Ackermann(m - (long)1, 1); 
                } else 
                { 
                        Ackermann = Ackermann(m - (long)1, Ackermann(m, n - (long)1)); 
                } 
        } 

        nesting--; 

        return Ackermann; 
    }  

public static long AckermannIterative(long m, long n) throws StackOverflowError 
    { 
        long AckermannIterative = 0L; 
        Exception Err = null; 
        Exception h8 = null; 

        nesting++; 

        if (nesting > nestingMax) { 
                nestingMax = nesting; 
        } 

        do 
        { 
                if(m != (long)0) 
                { 
                        if(n == (long)0) 
                        { 
                                n = 1; 
                        } else 
                        { 
                                n = AckermannIterative(m, n - (long)1); 
                        } 
                        m -= 1; 
                } else 
                { 
                        AckermannIterative = n + (long)1; 

                        nesting--; 

                        return AckermannIterative; 
                } 
        } while(true); 
    } 

} 

class MyThread extends Thread 
{ 
    public void run() 
    { 
        jAckermann.runTest(); 
    } 
}

Source code

java -Xss4M -Xms32M -Xmx128M jAckermann