{"id":6098,"date":"2023-11-11T00:01:06","date_gmt":"2023-11-11T08:01:06","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=6098"},"modified":"2023-11-18T09:17:25","modified_gmt":"2023-11-18T17:17:25","slug":"finding-four-letter-words","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=6098","title":{"rendered":"Finding Four-Letter Words"},"content":{"rendered":"

Not all the nasty words are four letters long, but a good chunk of them are. If you ran the program from last week’s Lesson<\/a>, you can quickly check the computer’s dictionary for the words you once couldn’t say on TV, gleefully typing them in and confirming that they exist in the dictionary. But how many four letter words are there?
\n
\nI was going to make this Lesson’s code a monthly challenge because it took me some time to work out a solution. I assumed it would be easy, but a few things tripped me up.<\/p>\n

Rather than use the strlen()<\/em> function, I decide to check the input buffer, array word[]<\/code>, for a newline at element 4: if( word[4]=='\\n' )<\/code> Such a test yields a four-letter word: four characters plus the newline.<\/p>\n

Upon testing the program, however, I found a bunch of possessives included, such as it's<\/code>. To remove them, I added another test: if( word[2]=='\\'' )<\/code> If true, the possessive is skipped over.<\/p>\n

But the biggest problem I had was re-using the word[]<\/code> buffer when scanning the dictionary. This buffer is filled with each word in the dictionary, but it’s not erased or re-initialized. The effect is that characters linger in the buffer, which can lead to false positives.<\/p>\n

For example, a four letter word followed by a two-letter word means the newline at offset word[4]<\/code> still is present. The program would spit out the two-letter word as a match when it isn’t. To remedy this situation, I use the memset()<\/em> function to clear the word[]<\/code> buffer for each iteration of the while<\/em> loop.<\/p>\n

Here is the full code:<\/p>\n

2023_11_11-Lesson.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n\/* this code assumes the following path is valid *\/<\/span>\r\n#define DICTIONARY \"\/usr\/share\/dict\/words\"\r\n#define SIZE 32\r\n\r\nint main()\r\n{\r\n    FILE *dict;\r\n    int wc;\r\n    char word[SIZE],*r;\r\n\r\n    \/* open the dictionary *\/<\/span>\r\n    dict = fopen(DICTIONARY,\"r\");\r\n    if( dict==NULL )\r\n    {\r\n        fprintf(stderr,\"Unable to open %s\\n\",DICTIONARY);\r\n        exit(1);\r\n    }\r\n\r\n    \/* scan for four-letter words *\/<\/span>\r\n    wc = 0;\r\n    while( !feof(dict) )\r\n    {\r\n        memset(word,'\\0',SIZE);        \/* clear buffer *\/<\/span>\r\n        r = fgets(word,SIZE,dict);    \/* read a word *\/<\/span>\r\n        if( r==NULL )\r\n            break;\r\n        if( word[2]=='\\'' )            \/* skip possessives *\/<\/span>\r\n            continue;\r\n        if( word[4]=='\\n' )            \/* four-letter word *\/<\/span>\r\n        {\r\n            printf(\"%s\",word);\r\n            wc++;\r\n        }\r\n    }\r\n    printf(\"I found %d four-letter words!\\n\",wc);\r\n\r\n    \/* close *\/<\/span>\r\n    fclose(dict);\r\n\r\n    return(0);\r\n}<\/pre>\n
The code borrows from examples shown in previous Lessons. The updated while<\/em> loop includes calling memset()<\/em> to clear the input buffer, fetching a new word, then culling out four-letter words that lack an apostrophe at the third character.<\/p>\n
The output shows all of the four-letter words in the digital dictionary. This list includes abbreviations and plurals — and, yes, dirty words. Here’s a snippet of the output on my computer:<\/p>\n
ABCs
\nABMs
\nACLU
\nACTH
\n...
\nzone
\nzoom
\nzoos
\nI found 3376 four-letter words!<\/code><\/p>\n
The memset()<\/em> function was the key to making this program run properly. I’ve written about this function before<\/a>, and how it will be deprecated in the C23 update. The problem is optimization, where this function’s behavior can be skipped if the compiler believes its clean-up loop doesn’t do anything. Alternative functions are available, though for this example memset()<\/em>‘s flaws shouldn’t affect the output.<\/p>\n
Upon reflection, I did make one improvement to the code: The word length value can be set as a constant. For exmample:<\/p>\n
#define LENGTH 4<\/code><\/p>\n
The code can be updated to reflect a flexible word size:<\/p>\n
if( word[LENGTH-2]=='\\'' )<\/code><\/p>\n
and:<\/p>\n
if( word[LENGTH]=='\\n' )<\/code><\/p>\n
These changes come in handy for next week’s Lesson<\/a>, which continues my exploration of the digital dictionary file.<\/p>\n","protected":false},"excerpt":{"rendered":"
Yes, the computer dictionary contains a lot of four letter words! Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-6098","post","type-post","status-publish","format-standard","hentry","category-main"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6098","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=6098"}],"version-history":[{"count":4,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6098\/revisions"}],"predecessor-version":[{"id":6118,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6098\/revisions\/6118"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=6098"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=6098"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=6098"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}