I can't find the leftmost and rightmost derivations of strings because there is no Non-terminal state linked to another non-terminal state

问题

The following grammar generates the language of regular expression

S → A | B | C 
A → 0A1 | 1 | A1  
B → 0B1 | 0 | 0B  
C → D10D 
D → empty | 0D | 1D  

Give leftmost and rightmost derivations of the following strings:

1. 010100
2. 000011

来源：https://stackoverflow.com/questions/62273171/i-cant-find-the-leftmost-and-rightmost-derivations-of-strings-because-there-is