n c language Implement the following two functions that allow breaking a string into non-empty tokens using a given delimiter . For example, For a string “abc-EFG-hi”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] For a string “abc-EFG---hi-”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] For a string “abc”, and a delimiter ‘ ’ : the list of tokens is [“abc”] For a string “++abc++”, and a delimiter ‘+’ : the list of tokens is [“abc”] That is, we break the string using the given delimiter, and the tokens are only the non-empty substrings. The function count_tokens gets a string str, and a char delim, and returns the number of tokens in the string separated by delim. int count_tokens(const char* str, char delim); For example count_tokens("abc-EFG--",'-')needstoreturn2. count_tokens("++a+b+c",'+')needstoreturn3. The function get_tokens gets a string str, and a char delim, and returns the array with the tokens in the correct order. The length of the array should be the number of tokens, computed in count_tokens. char** get_tokens(const char* str, char delim); For example: get_tokens("abc-EFG--",'-')needstoreturn["abc","EFG"] get_tokens("++a+b+c",'+')needstoreturn["a","b","c"].
n c language Implement the following two functions that allow breaking a string into non-empty tokens using a given delimiter . For example,
For a string “abc-EFG-hi”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”]
For a string “abc-EFG---hi-”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”]
For a string “abc”, and a delimiter ‘ ’ : the list of tokens is [“abc”]
For a string “++abc++”, and a delimiter ‘+’ : the list of tokens is [“abc”]
That is, we break the string using the given delimiter, and the tokens are only the non-empty substrings.
The function count_tokens gets a string str, and a char delim, and returns the number of tokens in the string separated by delim.
int count_tokens(const char* str, char delim);
For example
count_tokens("abc-EFG--",'-')needstoreturn2.
count_tokens("++a+b+c",'+')needstoreturn3.
The function get_tokens gets a string str, and a char delim, and returns the array with the tokens in the correct order. The length of the array should be the number of tokens, computed in count_tokens.
char** get_tokens(const char* str, char delim);
For example:
get_tokens("abc-EFG--",'-')needstoreturn["abc","EFG"]
get_tokens("++a+b+c",'+')needstoreturn["a","b","c"].
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)