Write a assembly program(mips) that implements a link list to store input lines of text. the program will then print the list constructed.
all nodes and string are to be allocated on the heap. node structure:
address data
address next
nodes are to be added to the head of the list
int strlen(cstring soure) : returns the length of a source (‘\0’ not counted)
cstring strdup(cstring source) : returns a duplicate of source allocated on the heap (sbrk syscall)
address addnode(address data, address next) : returns an address to a new node initialized with data and next traverse(address list, address proc) : traverses the list and calls proc passing the data of the node visit. the last node is to be traversed first.
main:
prompts the user for lines of text (up to 30 characters per line)
creates a link list of these lines head, the lines are to be created using strdup outputs the call traverse(head, print)
print(cstring source) : output source to the terminal
required i/o:
enter text? line 1
enter text? line 2
enter text? enter
line 1
line 2