Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am currently writing a compiler for java. The JLS says “The class hierarchy must be acyclic.” but what about the case where:
B extends A
C extends A
D extends B
D extends C
This is an acyclic graph but invalid how can i detect this case? I am currently using a BFS and whenever i see a back-edge i know there is a cycle but the BFS algorithm doesn’t detect the case mentioned above.
Dinherits from more than one class and multiple inheritance is not allowed in Java. This is how you detect it.