search
Log In

Recent posts in Compiler Design

1
Yes u are correct it should be D damm my java concepts are broken :(( here is a code class g{ void he(){ System.out.println("g"); } } class h extends g{ void he(){ System.out.println("h"); } } public class Nitin{ public static void main(String args[]) { h obj = new h(); ((g)obj).he(); ((g)new h()).he(); } OUTPUT: h h
posted Jan 2, 2019 in Compiler Design Arjun
edited Jan 25, 2019 by Arjun
1,504 views
2
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbols that occur in a two pass assembler respectively are $1, 2, 1, 2$ $2, 1, 2, 1$ $2, 1, 1, 2$ $1, 2, 2, 2$
posted Jan 24, 2018 in Compiler Design Utsav09 1,824 views
3
Which of the following problems is not $\text{NP}$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
posted Dec 28, 2016 in Compiler Design Arjun 3,544 views
To see more, click for the full list of questions or popular tags.
...