anoopsarkar

; ModuleID = 'QuickSort'
source_filename = "DecafComp"

@list = global [100 x i32] zeroinitializer
@globalstring = private unnamed_addr constant [2 x i8] c"\0A\00", align 1
@globalstring.1 = private unnamed_addr constant [7 x i8] c"List:\0A\00", align 1
@globalstring.2 = private unnamed_addr constant [2 x i8] c" \00", align 1
@globalstring.3 = private unnamed_addr constant [16 x i8] c"After sorting:\0A\00", align 1

declare void @print_string(i8*)

anoopsarkar

Archive:  contest.zip
  Length      Date    Time    Name
---------  ---------- -----   ----
        0  12-07-2020 09:23   references/anoop/
        4  11-25-2020 09:15   references/anoop/emptymethod.out
        0  11-25-2020 09:15   references/anoop/ok-scoping-2.out
        4  11-25-2020 09:15   references/anoop/and.out
       10  11-25-2020 09:15   references/anoop/fshadow.out
        3  11-25-2020 09:15   references/anoop/gr.out
        4  11-25-2020 09:15   references/anoop/forward3.out

anoopsarkar

%{ 
#include "exprdefs.h"
#include "llvm/IR/DerivedTypes.h"
#include "llvm/IR/LLVMContext.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/Verifier.h"
#include "llvm/IR/IRBuilder.h"
#include <cstdio> 
#include <stdexcept>

anoopsarkar

// g++ -std=c++17 -o symtbl_test symtbl_test.c

#include <utility>      // std::pair, std::make_pair
#include <string>       // std::string
#include <iostream>     // std::cout
#include <map>          // std::map
#include <list>         // std::list

using namespace std;
typedef pair<int, int> descriptor;

anoopsarkar

#include <stdio.h>
#include <stdlib.h>
#include "intarr.h"

intarr_t* intarr_create( unsigned int len )
{
    return NULL;
}

void intarr_destroy( intarr_t* ia )

anoopsarkar

/* 
 * intarr.h
 *
 * Provides a bounds-checked, resizable array of integers with
 * random-access and stack interfaces, and several utility functions
 * that operate on them.
 * 
 */

/* DO NOT CHANGE THIS FILE - YOUR CODE WILL BE COMPILED AGAINST THE

anoopsarkar

/*
 * imageops.c - Simple operations on images
 *
 * C laboratory exercises.
 * Richard Vaughan, 2014.
 */

#include <assert.h>
#include <stdint.h>
#include <stdio.h>

anoopsarkar

#!/usr/bin/env python2.7
'''
Converts new-style PTB POS tags to the English tagset from the Universal Dependencies project
(see universal-pos-en.html, from http://universaldependencies.github.io/docs/en/pos/all.html).
There are 17 such tags, expanded from the original 12 Universal POS tags of Petrov et al. 2011.
See "limitations" comment below for some details on our interpretation of the difficult-to-map 
categories.

In new-style PTB, TO only applies to prepositional (not infinitival) "to".

anoopsarkar

#include <string.h>
#include <stdlib.h>
#include <stdio.h>

int main( void )
{
    char h[] = "hello";
    char w[] = "this is a very long string .";

    char* x = malloc( strlen(h)*sizeof(char) );

anoopsarkar

#include <stdlib.h>
#include <limits.h>
#include <stdio.h>

int main( void ) 
{
    char x[] = {1,2,3,4,5};
    int* y = malloc( sizeof(int) );
    printf("sz int*=%lu\nsz char*=%lu\nsz double*=%lu\nsz x=%lu\nsz y=%lu\nsz &x=%lu\n&x=%p\ny=%p\n", 
        sizeof(int*),